import { EvaluationClaim } from 'ppef/types/claims';
/**
 * T1: Hub Deferral Claim
 *
 * Degree-prioritised expansion defers hub nodes to later in the expansion
 * compared to standard BFS.
 */
export declare const CLAIM_T1_HUB_DEFERRAL: EvaluationClaim;
/**
 * T2: Path Diversity Claim
 *
 * Degree-prioritised expansion discovers more diverse paths (measured by
 * unique node coverage) than standard BFS.
 */
export declare const CLAIM_T2_PATH_DIVERSITY: EvaluationClaim;
/**
 * T3: Entropy Ordering Claim
 *
 * Entropy-guided expansion (EGE) achieves stronger correlation between
 * expansion order and neighbourhood entropy than degree-prioritised.
 */
export declare const CLAIM_T3_ENTROPY_ORDERING: EvaluationClaim;
/**
 * T4: Path Discovery Rate Claim
 *
 * Path-preserving multi-frontier expansion (PPME) discovers paths faster
 * (more paths per node expanded) than degree-prioritised.
 */
export declare const CLAIM_T4_PATH_DISCOVERY: EvaluationClaim;
/**
 * T5: Adaptation Claim
 *
 * Retrospective salience-guided expansion (RSGE) improves path quality
 * over time through its adaptive two-phase mechanism.
 */
export declare const CLAIM_T5_ADAPTATION: EvaluationClaim;
/**
 * T6: Cross-Domain Path Claim
 *
 * Heterogeneity-aware expansion (HABE) discovers a higher proportion of
 * paths crossing domain boundaries than entropy-guided expansion.
 */
export declare const CLAIM_T6_CROSS_DOMAIN: EvaluationClaim;
/**
 * T7: Salience Improvement Claim
 *
 * Multi-frontier adaptive salience-feedback (MFASF) achieves higher mean
 * path salience than path-preserving expansion.
 */
export declare const CLAIM_T7_SALIENCE_IMPROVEMENT: EvaluationClaim;
/**
 * T8: Termination Efficiency Claim
 *
 * MFASF requires fewer nodes per salient path (higher efficiency) than
 * degree-prioritised expansion due to adaptive termination.
 */
export declare const CLAIM_T8_TERMINATION_EFFICIENCY: EvaluationClaim;
/**
 * R1: MI Sensitivity Claim
 *
 * Path salience ranking produces higher top-path MI than shortest-path ranking.
 */
export declare const CLAIM_R1_MI_SENSITIVITY: EvaluationClaim;
/**
 * R2: Length Independence Claim
 *
 * Path salience ranking shows low correlation between path length and rank,
 * unlike shortest-path ranking.
 */
export declare const CLAIM_R2_LENGTH_INDEPENDENCE: EvaluationClaim;
/**
 * R3: Weak-Link Dominance Claim
 *
 * Path salience ranking is more sensitive to weak links (low-MI edges) than
 * random ranking, correctly penalizing paths with bottlenecks.
 */
export declare const CLAIM_R3_WEAK_LINK: EvaluationClaim;
/**
 * All traversal claims (T1-T8).
 */
export declare const TRAVERSAL_CLAIMS: EvaluationClaim[];
/**
 * All ranking claims (R1-R3).
 */
export declare const RANKING_CLAIMS: EvaluationClaim[];
/**
 * All thesis claims (T1-T8 + R1-R3).
 */
export declare const THESIS_CLAIMS: EvaluationClaim[];
/**
 * Claims by category.
 */
export declare const CLAIMS_BY_CATEGORY: {
    readonly traversal: EvaluationClaim[];
    readonly ranking: EvaluationClaim[];
};
/**
 * Get claims by tag.
 *
 * @param tag - Tag to filter by
 * @returns Claims with the specified tag
 */
export declare const getClaimsByTag: (tag: string) => EvaluationClaim[];
/**
 * Get claims involving a specific SUT.
 *
 * @param sutId - SUT ID to filter by
 * @returns Claims where the SUT is primary or baseline
 */
export declare const getClaimsBySut: (sutId: string) => EvaluationClaim[];
//# sourceMappingURL=thesis-claims.d.ts.map