{
  "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
  "contracts": {
    "103-logspace-language-equality": {
      "family": "103",
      "statement_type": "language_class_equality",
      "formal_scope_covers_claim": true,
      "required_model": {
        "input_model": "binary_language",
        "machine_model": "finite_control_endmarked_input_local_binary_work_tapes",
        "randomness_model": "fresh_independent_fair_bits",
        "space_model": "all_traversed_writable_cells",
        "randomized_time_model": "polynomial_worst_case_all_coin_tapes"
      },
      "obligations": [
        "exact_machine_semantics_mapping",
        "fixed_machine_time_and_space_promises",
        "rl_or_bpl_acceptance_gap",
        "language_decision_not_random_sample_output",
        "compiler_and_numerical_time_bounds_separately_reviewed",
        "independent_check_status_recorded"
      ],
      "excluded_uses": [
        "derandomize_arbitrary_ml",
        "deterministic_cryptographic_randomness",
        "preserve_random_output_distribution",
        "selected_formal_compiler_resource_bounds",
        "production_speedup",
        "automatic_resource_promise_verification"
      ],
      "source_locations": [
        "lean/docs/103.md",
        "lean/OAI/Computability/Logspace/Deterministic.lean",
        "lean/OAI/Computability/Logspace/Equality.lean",
        "preprints/Exact-Derandomization-of-Logarithmic-Space-L-equals-RL-equals-BPL-September-23-2026/build/sections/compiler.tex"
      ],
      "source_location_stage": "Exact file pointers; not new line/section reading or independent proof evidence",
      "source_location_hashes": [
        {
          "path": "lean/docs/103.md",
          "sha256": "21e0be3e46468655991435570d83521e12ab9c83ad76fa6f484c88edcbc0e139"
        },
        {
          "path": "lean/OAI/Computability/Logspace/Deterministic.lean",
          "sha256": "f51289517dc00b6f843e6f408f393c1bcac7d25e78eb162c0c629618875d252b"
        },
        {
          "path": "lean/OAI/Computability/Logspace/Equality.lean",
          "sha256": "4e04bb9a264ff32042267832d47423079a0d72b9880994b5e84957d672d5fbe9"
        },
        {
          "path": "preprints/Exact-Derandomization-of-Logarithmic-Space-L-equals-RL-equals-BPL-September-23-2026/build/sections/compiler.tex",
          "sha256": "c9edf110e23b522052f88b76e0f4dd586a153f566d32f0d4d2b704ab74537d95"
        }
      ]
    },
    "110-uniform-kserver": {
      "family": "110",
      "statement_type": "finite_metric_uniform_online_algorithm",
      "formal_scope_covers_claim": true,
      "required_model": {
        "metric_model": "finite_rational_metric",
        "request_model": "oblivious_finite_sequence",
        "service_model": "one_labeled_server_per_request",
        "time_model": "polynomial_in_encoding_and_log_request_counter",
        "additive_cost_model": "finite_unrestricted_instance_constant"
      },
      "obligations": [
        "two_at_most_k_below_number_of_points",
        "metric_and_encoding_validated",
        "legal_server_choice",
        "implementation_correspondence",
        "constructor_steps_and_activation_reviewed",
        "finite_horizon_additive_loss_reviewed",
        "actual_request_latency_measured",
        "independent_check_status_recorded"
      ],
      "excluded_uses": [
        "zero_additive_loss_for_uniform_implementation",
        "polynomial_activation_delay",
        "adaptive_adversary",
        "deadlines_or_heterogeneous_capacity",
        "production_speedup",
        "request_time_independent_of_history_counter"
      ],
      "source_locations": [
        "lean/docs/110.md",
        "lean/ComparatorChallenges/UniformKServer.lean",
        "preprints/Uniform-computation-of-the-squared-logarithmic-k-server-bound-September-24-2026/build/source/sections/04-uniform-computation.tex"
      ],
      "source_location_stage": "Exact file pointers; not new line/section reading or independent proof evidence",
      "source_location_hashes": [
        {
          "path": "lean/docs/110.md",
          "sha256": "398ad379c334661bdba0c43c96f500483c18f73efb94123e79a79cd7b76c8afc"
        },
        {
          "path": "lean/ComparatorChallenges/UniformKServer.lean",
          "sha256": "5defbe05414f2769784983a55aeb30ccc94c692e700f0772579febbf7a7b78cb"
        },
        {
          "path": "preprints/Uniform-computation-of-the-squared-logarithmic-k-server-bound-September-24-2026/build/source/sections/04-uniform-computation.tex",
          "sha256": "1910910ef41491c73d562e368976ca3e44ef6c21b8b6746b6f55f19f292b69b3"
        }
      ]
    },
    "374-brenier-stability": {
      "family": "374",
      "statement_type": "uniform_one_third_holder_transport_map_stability",
      "formal_scope_covers_claim": true,
      "required_model": {
        "dimension_minimum": 2,
        "source_model": "uniform_compact_convex_body_nonempty_interior",
        "target_model": "borel_probabilities_one_fixed_nonempty_compact_container",
        "map_model": "unique_quadratic_optimal_maps",
        "error_model": "source_L2_map_norm_vs_target_W2"
      },
      "obligations": [
        "uniform_source_and_domain",
        "fixed_compact_target_container",
        "quadratic_optimality_mapping",
        "domain_constant_selected_and_validated",
        "same_source_l2_and_target_w2_metrics",
        "discretization_or_regularization_bridge_separately_reviewed",
        "independent_check_status_recorded"
      ],
      "excluded_uses": [
        "uniform_half_exponent",
        "pointwise_prediction_error",
        "automatic_entropic_solver_guarantee",
        "arbitrary_learned_transport_map",
        "discrete_source_same_theorem",
        "algorithm_for_fitting_transport_maps"
      ],
      "source_locations": [
        "lean/docs/374.md",
        "lean/OAI/Analysis/Brenier/Basic.lean",
        "lean/OAI/Analysis/Brenier/Stability.lean",
        "preprints/Sharp-One-Third-Stability-of-Brenier-Maps-September-25-2026/build/source/sections/gradient.tex"
      ],
      "source_location_stage": "Exact file pointers; not new line/section reading or independent proof evidence",
      "source_location_hashes": [
        {
          "path": "lean/docs/374.md",
          "sha256": "db319fc02b2a12ef2e60b7322c24b50f1ff41c16366da563da9dc9b3f11d0fa5"
        },
        {
          "path": "lean/OAI/Analysis/Brenier/Basic.lean",
          "sha256": "1a6ccd5ee35afe99ffd5f20aceced072d2852038ed8ae82d99b215d94634b837"
        },
        {
          "path": "lean/OAI/Analysis/Brenier/Stability.lean",
          "sha256": "30be40a80f4518c674b76afd9ad73c93c2bdfdb4d08cd09b302d3ea0eddfc97a"
        },
        {
          "path": "preprints/Sharp-One-Third-Stability-of-Brenier-Maps-September-25-2026/build/source/sections/gradient.tex",
          "sha256": "9ea85375b635fd322e71cb7c87cfc015cff8189b2b64fef3a5dbb7a12abba377"
        }
      ]
    },
    "131-lazy-switch-chain": {
      "family": "131",
      "statement_type": "specified_markov_chain_mixing",
      "formal_scope_covers_claim": true,
      "required_model": {
        "graph_model": "simple_undirected_labeled",
        "host_model": "complete_host",
        "kernel": "half_hold_uniform_four_set_uniform_ordered_matching_pair",
        "step_unit": "all_holding_rejected_and_accepted_steps",
        "target_law": "uniform_labeled_degree_fiber"
      },
      "obligations": [
        "graphical_labeled_degree_vector",
        "n_at_least_four_or_separate_small_case",
        "implementation_kernel_correspondence",
        "total_chain_step_accounting",
        "target_tv_and_bound_recorded",
        "no_host_connectivity_attribute_or_weight_restrictions",
        "source_claim_vs_independent_check_recorded"
      ],
      "excluded_uses": [
        "selected_formal_exact_sampler",
        "host_restricted_switch_mixing",
        "connected_only_mixing",
        "directed_or_weighted_extension",
        "accepted_swaps_use_same_step_bound",
        "practical_large_graph_deadline"
      ],
      "source_locations": [
        "lean/docs/131.md",
        "preprints/Polynomial-Mixing-of-the-Switch-Chain-for-Every-Graphical-Degree-Sequence-September-25-2026/main.pdf"
      ],
      "source_location_stage": "Exact file pointers; not new line/section reading or independent proof evidence",
      "source_location_hashes": [
        {
          "path": "lean/docs/131.md",
          "sha256": "95890a0433c375da400f600f581f1eb352416bc25f720c3483767022ce3fba4c"
        },
        {
          "path": "preprints/Polynomial-Mixing-of-the-Switch-Chain-for-Every-Graphical-Degree-Sequence-September-25-2026/main.pdf",
          "sha256": "e70eab92c1315e6706eea3613e9826871e009d1ef8de31f82d5750d026240af3"
        }
      ]
    },
    "365-joint-same-patch": {
      "family": "365",
      "statement_type": "identifiability",
      "formal_scope_covers_claim": false,
      "required_model": {
        "dimension_minimum": 3,
        "regularity": "smooth",
        "measurement_model": "ideal_same_patch_boundary_operator"
      },
      "obligations": [
        "smooth_manifold_and_boundary",
        "trivial_rank_two_bundle",
        "smooth_unitary_connection",
        "nonempty_open_patch",
        "gauge_and_diffeomorphism_quotient"
      ],
      "excluded_uses": [
        "finite_noisy_reconstruction_guarantee",
        "efficient_reconstruction_algorithm"
      ],
      "source_locations": [
        "lean/docs/365.md",
        "preprints/Determination-of-a-metric-and-a-unitary-connection-from-one-boundary-patch-October-5-2026/paper.pdf"
      ],
      "source_location_stage": "Exact file pointers; not new line/section reading or independent proof evidence",
      "source_location_hashes": [
        {
          "path": "lean/docs/365.md",
          "sha256": "6f0cf7314968e12c2ad323d6f4a91fb5ae7a1f545a6c78043527d130f546c4e2"
        },
        {
          "path": "preprints/Determination-of-a-metric-and-a-unitary-connection-from-one-boundary-patch-October-5-2026/paper.pdf",
          "sha256": "8e1bdd3a9067234842406dba45efc9e8efae5be0cd72a6c09f6dceee8793badb"
        }
      ]
    },
    "372-static-elasticity": {
      "family": "372",
      "statement_type": "uniqueness",
      "formal_scope_covers_claim": true,
      "required_model": {
        "dimension": 3,
        "regularity": "smooth",
        "measurement_model": "full_static_boundary_operator"
      },
      "obligations": [
        "connected_bounded_smooth_domain",
        "smooth_lame_parameters",
        "mu_positive",
        "three_lambda_plus_two_mu_positive",
        "full_operator_equality"
      ],
      "excluded_uses": [
        "finite_noisy_reconstruction_guarantee",
        "efficient_reconstruction_algorithm",
        "anisotropic_elasticity"
      ],
      "source_locations": [
        "lean/docs/372.md",
        "preprints/Global-Uniqueness-for-the-Smooth-Isotropic-Elasticity-Inverse-Problem-September-24-2026/article.pdf"
      ],
      "source_location_stage": "Exact file pointers; not new line/section reading or independent proof evidence",
      "source_location_hashes": [
        {
          "path": "lean/docs/372.md",
          "sha256": "5c6a8e21366181a580d561cfdc50d32306ac2f428ea487084db21bc5d603e3d6"
        },
        {
          "path": "preprints/Global-Uniqueness-for-the-Smooth-Isotropic-Elasticity-Inverse-Problem-September-24-2026/article.pdf",
          "sha256": "5cadfeb6eb45bea20b6ceb4879266d49938154c38dbf34a6531b47b4f3cfbff9"
        }
      ]
    },
    "281-qaoa-energy": {
      "family": "281",
      "statement_type": "ordered_limit_expected_energy",
      "formal_scope_covers_claim": false,
      "required_model": {
        "instance_model": "gaussian_zero_field_SK",
        "limit_order": "size_then_depth"
      },
      "obligations": [
        "unique_source_version",
        "expected_energy_per_spin",
        "ordered_limits",
        "angle_selection_cost_recorded",
        "required_depth_unknown"
      ],
      "excluded_uses": [
        "finite_instance_optimality",
        "efficient_angle_selection",
        "hardware_speedup"
      ],
      "source_locations": [
        "lean/docs/281.md",
        "preprints/QAOA-attains-the-SK-ground-state-energy-in-the-thermodynamic-first-limit-September-25-2026/QAOA-attains-the-SK-ground-state-energy-in-the-thermodynamic-first-limit-September-25-2026.pdf"
      ],
      "source_location_stage": "Exact file pointers; not new line/section reading or independent proof evidence",
      "source_location_hashes": [
        {
          "path": "lean/docs/281.md",
          "sha256": "244155dd6e7310ab65b1b4ec342c499149057fe90ae0aba8340a0c5bd656a072"
        },
        {
          "path": "preprints/QAOA-attains-the-SK-ground-state-energy-in-the-thermodynamic-first-limit-September-25-2026/QAOA-attains-the-SK-ground-state-energy-in-the-thermodynamic-first-limit-September-25-2026.pdf",
          "sha256": "4d07ebe181b03157398deef72b23eff8046183f67855d30f9e48e222550a44ba"
        }
      ]
    },
    "266-three-bases": {
      "family": "266",
      "statement_type": "computer_assisted_exclusion",
      "formal_scope_covers_claim": false,
      "required_model": {
        "dimension": 6,
        "arithmetic_model": "specified_binary64_compiler_contract"
      },
      "obligations": [
        "complete_verifier_pipeline",
        "compiler_conditions",
        "rounding_and_arithmetic_conditions",
        "source_and_certificate_hashes",
        "four_basis_exclusion"
      ],
      "excluded_uses": [
        "lean_verified_exactly_three"
      ],
      "source_locations": [
        "lean/docs/266.md",
        "preprints/The-maximum-number-of-mutually-unbiased-bases-in-dimension-six-September-24-2026/The-maximum-number-of-mutually-unbiased-bases-in-dimension-six-September-24-2026.pdf"
      ],
      "source_location_stage": "Exact file pointers; not new line/section reading or independent proof evidence",
      "source_location_hashes": [
        {
          "path": "lean/docs/266.md",
          "sha256": "3141714e25026b26a4028e27ee001e70295310bad4290b5a8f7c9fd546e8a174"
        },
        {
          "path": "preprints/The-maximum-number-of-mutually-unbiased-bases-in-dimension-six-September-24-2026/The-maximum-number-of-mutually-unbiased-bases-in-dimension-six-September-24-2026.pdf",
          "sha256": "b4cc74c840c902494d589b51c8e9706490f37cf2735e69a0486122131c6b7446"
        }
      ]
    },
    "276-gad-capacity": {
      "family": "276",
      "statement_type": "memoryless_classical_capacity",
      "formal_scope_covers_claim": true,
      "required_model": {
        "channel_model": "qubit_generalized_amplitude_damping",
        "decoding_model": "asymptotic_collective"
      },
      "obligations": [
        "parameter_convention",
        "memoryless_channel",
        "channel_fit_evidence",
        "scalar_optimization_error",
        "collective_decoding_assumption"
      ],
      "excluded_uses": [
        "quantum_capacity",
        "secret_key_capacity",
        "separate_measurement_capacity",
        "finite_block_decoder"
      ],
      "source_locations": [
        "lean/docs/276.md",
        "preprints/Classical-capacity-and-entropy-inequalities-for-generalized-amplitude-damping-September-24-2026/paper.pdf"
      ],
      "source_location_stage": "Exact file pointers; not new line/section reading or independent proof evidence",
      "source_location_hashes": [
        {
          "path": "lean/docs/276.md",
          "sha256": "34d51d11d25cf4d1108b3914cfcb7d13a9df63a0cb3dd82071406f07c0640a99"
        },
        {
          "path": "preprints/Classical-capacity-and-entropy-inequalities-for-generalized-amplitude-damping-September-24-2026/paper.pdf",
          "sha256": "5656514823b55d5a4dbb15b284a2637952b957a451aef2e6428f3efbb88f6442"
        }
      ]
    },
    "245-pts-beta-normalization": {
      "family": "245",
      "statement_type": "conditional_system_wide_termination",
      "formal_scope_covers_claim": true,
      "required_model": {
        "expression_calculus": "pure_type_system",
        "reduction_relation": "full_beta_including_annotations",
        "normalization_quantifier": "all_legal_expressions_all_valid_contexts"
      },
      "obligations": [
        "exact_pts_specification_mapping",
        "global_weak_normalization_proof",
        "legal_expression_and_valid_context",
        "full_annotation_reduction",
        "no_added_rewrite_rules_or_eta",
        "runtime_bound_status_recorded"
      ],
      "excluded_uses": [
        "single_term_normal_form_implies_strong_normalization",
        "termination_of_added_rewrite_rules",
        "beta_eta_normalization",
        "practical_runtime_bound",
        "arbitrary_program_termination"
      ],
      "source_locations": [
        "lean/docs/245.md",
        "preprints/Weak-and-strong-normalization-in-pure-type-systems-September-25-2026/paper.pdf"
      ],
      "source_location_stage": "Exact file pointers; not new line/section reading or independent proof evidence",
      "source_location_hashes": [
        {
          "path": "lean/docs/245.md",
          "sha256": "d05302b4c350e522680f61473d849ae2eae567d20a73da624948f533fee813f6"
        },
        {
          "path": "preprints/Weak-and-strong-normalization-in-pure-type-systems-September-25-2026/paper.pdf",
          "sha256": "9db295a439634e3169700af595760553afafc9c5db979de9d2ac27a534af63ef"
        }
      ]
    },
    "254-artin-membership": {
      "family": "254",
      "statement_type": "effective_decision_procedure",
      "formal_scope_covers_claim": false,
      "required_model": {
        "group_class": "finite_rank_Artin",
        "input_model": "coxeter_matrix_subset_conjugator_word_test_word",
        "arithmetic_model": "exact_computable_cyclotomic_field"
      },
      "obligations": [
        "valid_finite_coxeter_matrix",
        "exact_word_and_parabolic_input",
        "categorical_detector_implementation",
        "exact_coefficient_field",
        "complex_size_and_coefficient_growth_measured",
        "external_kernel_trust_record"
      ],
      "excluded_uses": [
        "polynomial_runtime",
        "production_speedup",
        "lean_verified_membership_algorithm",
        "intersection_constructor_supplied_by_membership_test"
      ],
      "source_locations": [
        "lean/docs/254.md",
        "preprints/Parabolic-intersections-in-Artin-groups-September-23-2026/paper.pdf"
      ],
      "source_location_stage": "Exact file pointers; not new line/section reading or independent proof evidence",
      "source_location_hashes": [
        {
          "path": "lean/docs/254.md",
          "sha256": "327dfb32694d5072c4a47aff41da516a7cbe663634285577f344beb98d94d4e2"
        },
        {
          "path": "preprints/Parabolic-intersections-in-Artin-groups-September-23-2026/paper.pdf",
          "sha256": "4cd7fa316371447c2cb8a99d36bf9f48934c2366550609917210574e3f4f7e2e"
        }
      ]
    },
    "279-exact-quantum-factoring": {
      "family": "279",
      "statement_type": "ideal_exact_uniform_circuit_factoring",
      "formal_scope_covers_claim": true,
      "required_model": {
        "input_model": "binary_integer_at_least_two",
        "hardware_model": "ideal_exact_qubit_circuit",
        "gate_set": "NOT_CNOT_Toffoli_H_S_inverses_and_single_controls"
      },
      "obligations": [
        "complete_prime_factorization_output",
        "uniform_classical_circuit_generator",
        "gate_and_qubit_bounds",
        "exact_probability_one_model",
        "noise_and_fault_tolerance_separately_analyzed",
        "practical_resources_measured"
      ],
      "excluded_uses": [
        "classical_polynomial_factoring",
        "hardware_probability_one",
        "practical_resource_improvement",
        "standard_Clifford_T_gate_set_without_translation"
      ],
      "source_locations": [
        "lean/docs/279.md",
        "preprints/Exact-quantum-factoring-over-a-fixed-finite-gate-set-September-25-2026/main.pdf"
      ],
      "source_location_stage": "Exact file pointers; not new line/section reading or independent proof evidence",
      "source_location_hashes": [
        {
          "path": "lean/docs/279.md",
          "sha256": "70edc97191b737cec8ade36d26bd53cd0c75f9c0e33c8afa53e7ce32ee67a88d"
        },
        {
          "path": "preprints/Exact-quantum-factoring-over-a-fixed-finite-gate-set-September-25-2026/main.pdf",
          "sha256": "35e89279253b6c8ae5ae7c941283b4b9de517243564f87e9b323ffeae4a85699"
        }
      ]
    },
    "314-chromatic-cyclic-length": {
      "family": "314",
      "statement_type": "finite_p_group_fixed_point_loss",
      "formal_scope_covers_claim": false,
      "required_model": {
        "group_class": "finite_p_group",
        "subgroup_model": "embedded_subgroup",
        "spectrum_class": "finite_p_local_genuine_G_spectrum",
        "height_model": "nonnegative_integer"
      },
      "obligations": [
        "finite_p_group_verified",
        "embedded_subgroup_verified",
        "shortest_subnormal_cyclic_chain",
        "cyclic_quotient_counted_once",
        "finite_genuine_spectrum_hypothesis",
        "target_height_nonnegative"
      ],
      "excluded_uses": [
        "arbitrary_finite_group_without_reduction",
        "loss_from_abstract_subgroup_type_alone",
        "polynomial_subgroup_enumeration",
        "spectrum_witness_constructor"
      ],
      "source_locations": [
        "preprints/Cyclic-Length-and-Chromatic-Fixed-Point-Loss-September-24-2026/Cyclic-Length-and-Chromatic-Fixed-Point-Loss-September-24-2026.pdf"
      ],
      "source_location_stage": "Exact file pointers; not new line/section reading or independent proof evidence",
      "source_location_hashes": [
        {
          "path": "preprints/Cyclic-Length-and-Chromatic-Fixed-Point-Loss-September-24-2026/Cyclic-Length-and-Chromatic-Fixed-Point-Loss-September-24-2026.pdf",
          "sha256": "1bf9f0b94473b85cecfc6746269e22509d11c918e866a31b67d3329dd3acd857"
        }
      ]
    },
    "238-coordinate-trace-smoothing": {
      "family": "238",
      "statement_type": "uniform_full_permutation_trace_mixing_bound",
      "formal_scope_covers_claim": true,
      "required_model": {
        "domain_model": "dyadic_labeled_slots",
        "switch_model": "one_shared_bit_per_sweep_coordinate_pair",
        "randomness_model": "independent_fair_switch_bits",
        "permutation_convention": "input_to_output",
        "time_unit": "complete_forward_coordinate_sweeps",
        "error_model": "full_permutation_total_variation"
      },
      "obligations": [
        "universal_source_P_or_u_selected_and_validated",
        "integer_v_twice_v_at_least_P",
        "source_protocol_and_implementation_mapping",
        "same_assignment_forward_inverse_and_workers",
        "independent_randomness_or_separate_prg_bridge",
        "optional_non_dyadic_cycle_bridge_and_query_cost",
        "full_joint_law_not_only_marginals",
        "independent_check_status_recorded"
      ],
      "excluded_uses": [
        "single_card_uniform_implies_joint_uniform",
        "one_sweep_general_uniform",
        "fixed_unreviewed_sweep_count",
        "seeded_rng_is_independent_fair_bit_oracle",
        "non_dyadic_constant_worst_case_cycle_cost",
        "cryptographic_security",
        "perfect_uniform_general_permutation",
        "source_point_query_compiler_formally_verified"
      ],
      "source_locations": [
        "lean/docs/238.md",
        "lean/ComparatorChallenges/CoordinateTrace.lean",
        "lean/ComparatorChallenges/CoordinateTrace.json",
        "lean/OAI/Probability/ThorpRouting/RegularTrace.lean",
        "lean/OAI/Probability/ThorpRouting/TraceDecay.lean",
        "preprints/Random-subspace-tests-and-trace-smoothing-for-coordinate-sweeps-September-26-2026/build/sections/introduction.tex",
        "preprints/Random-subspace-tests-and-trace-smoothing-for-coordinate-sweeps-September-26-2026/build/sections/proof.tex"
      ],
      "source_location_stage": "Exact selected file pointers; extents separately recorded in family/manuscript evidence",
      "source_location_hashes": [
        {
          "path": "lean/docs/238.md",
          "sha256": "90935144b3f4346476ff852911ad709fe354446bc383e291db4afb90a98aaa49"
        },
        {
          "path": "lean/ComparatorChallenges/CoordinateTrace.lean",
          "sha256": "836e2da11957968255042992c8bc5e18f63fd00b1d93787e2236fcef484406e5"
        },
        {
          "path": "lean/ComparatorChallenges/CoordinateTrace.json",
          "sha256": "b7f98ec669c151ff5556e891fac05f654534018230827ffef516e880b3fa05ac"
        },
        {
          "path": "lean/OAI/Probability/ThorpRouting/RegularTrace.lean",
          "sha256": "8d5dff8d9bc942a3969b13d2311f770971d8c54a396ec4e40ea03c04abca457e"
        },
        {
          "path": "lean/OAI/Probability/ThorpRouting/TraceDecay.lean",
          "sha256": "504d3765b8e4fef1e2b3095db9f7b2300ede7c41e98cc01a884f0824d0686756"
        },
        {
          "path": "preprints/Random-subspace-tests-and-trace-smoothing-for-coordinate-sweeps-September-26-2026/build/sections/introduction.tex",
          "sha256": "dfd4625b6ddb9d46a553f1557b0594e48c70c078e9dd3ec528bfec2fb02713b2"
        },
        {
          "path": "preprints/Random-subspace-tests-and-trace-smoothing-for-coordinate-sweeps-September-26-2026/build/sections/proof.tex",
          "sha256": "84272ab701a783ca55b1cc80ad9ed43d46a26db130783e911e50b44495d218dc"
        }
      ]
    },
    "115-bounded-integral-flow": {
      "family": "115",
      "statement_type": "paper_level_bounded_flow_counting_and_approximate_sampling",
      "formal_scope_covers_claim": false,
      "required_model": {
        "graph_model": "finite_directed_multigraph_loops_allowed",
        "state_model": "integer_arc_value_vector",
        "commodity_model": "single_commodity",
        "bound_model": "finite_binary_integer_lower_upper",
        "balance_model": "outflow_minus_inflow_prescribed",
        "target_law": "uniform_all_feasible_arc_vectors",
        "randomness_model": "independent_fair_bits",
        "sampling_model": "TV_tau_bounded_time_polynomial_inverse_tau",
        "counting_model": "relative_epsilon_confidence_one_minus_delta",
        "cost_model": "no_extra_global_cost_constraint"
      },
      "obligations": [
        "lower_bound_shift_and_balance_validated",
        "parallel_and_loop_private_vertices_preserved",
        "source_flow_to_table_bijection_mapping",
        "actual_count_backend_and_parameters_reviewed",
        "exact_feasibility_at_each_sampling_child",
        "fresh_adaptive_count_calls_and_failure_budget",
        "finite_bit_branch_precision_and_total_TV_bound",
        "feasible_output_on_every_execution",
        "scenario_law_and_integer_units_fit_workflow",
        "source_paper_vs_selected_formal_scope_recorded"
      ],
      "excluded_uses": [
        "exact_uniform_bounded_flow_sampler",
        "sampling_runtime_polynomial_only_log_inverse_tau",
        "multicommodity_extension",
        "uniform_path_decompositions",
        "uniform_cost_optimal_flows",
        "zero_approximate_count_proves_infeasible",
        "actual_outage_probability",
        "selected_formal_flow_sampler_without_bridge"
      ],
      "source_locations": [
        "preprints/An-FPRAS-for-Cell-Bounded-Contingency-Tables-September-24-2026/build/sections/flows.tex",
        "lean/docs/115.md",
        "lean/ComparatorChallenges/ContingencyTables.lean",
        "lean/ComparatorChallenges/ContingencyTables.json"
      ],
      "source_location_hashes": [
        {
          "path": "preprints/An-FPRAS-for-Cell-Bounded-Contingency-Tables-September-24-2026/build/sections/flows.tex",
          "sha256": "07de54a84f723132480bbe349492638e273a80e2184674035c129ee8883c00a8"
        },
        {
          "path": "lean/docs/115.md",
          "sha256": "7503f6655041af845dd16fb16746316e877356e75bcb3793ba68917585e02fb6"
        },
        {
          "path": "lean/ComparatorChallenges/ContingencyTables.lean",
          "sha256": "809f0a2575fb97e579e883d47aa6f38717c9df57f4b186d21dcdeb59743118b5"
        },
        {
          "path": "lean/ComparatorChallenges/ContingencyTables.json",
          "sha256": "4baaa8be9da6f2c3b8664c94cad82b8f2c549b69315374584d6d01e381719a57"
        }
      ]
    },
    "124-three-machine-unit-scheduling": {
      "family": "124",
      "statement_type": "fixed_finite_machine_polynomial_exact_unit_scheduling",
      "formal_scope_covers_claim": true,
      "required_model": {
        "graph_model": "explicitly_listed_nonempty_finite_DAG",
        "machine_count": 3,
        "processing_times": "all_one",
        "nonpreemptive": true,
        "machines": "identical",
        "release_times": "all_zero",
        "communication_delays": "none",
        "eligibility": "all_machines",
        "additional_resources": "none",
        "deadline_model": "none_or_integer_one_through_n",
        "time_model": "deterministic_multitape_binary_input_length",
        "machine_model": "one_fixed_finite_machine_for_all_inputs"
      },
      "obligations": [
        "explicit_graph_acyclicity_and_job_identity_mapping",
        "unit_nonpreemptive_identical_machine_model_fit",
        "no_silent_release_eligibility_setup_or_resource_features",
        "binary_input_and_schedule_output_encoding_bridge",
        "actual_implementation_correspondence_to_fixed_machine",
        "proof_imports_and_independent_check_status_recorded",
        "direct_capacity_and_strict_precedence_witness_checks",
        "polynomial_backend_not_tiny_exponential_reference",
        "large_exponent_and_constant_practical_limits_reviewed",
        "existing_solver_and_workflow_value_comparison"
      ],
      "excluded_uses": [
        "generic_unequal_duration_scheduler",
        "four_machine_extension",
        "release_or_eligibility_extension",
        "unit_splitting_automatically_preserves_nonpreemption",
        "tiny_DP_is_source_polynomial_backend",
        "CP_SAT_is_source_verified_machine",
        "solver_optimal_status_is_independent_proof",
        "production_speedup_from_polynomial_classification"
      ],
      "source_locations": [
        "preprints/A-polynomial-time-algorithm-for-three-machine-unit-job-scheduling-September-24-2026/build/paper.tex",
        "lean/docs/124.md",
        "lean/ComparatorChallenges/ThreeMachine.lean",
        "lean/ComparatorChallenges/ThreeMachine.json",
        "lean/OAI/Computability/Scheduling/Main.lean"
      ],
      "source_location_hashes": [
        {
          "path": "preprints/A-polynomial-time-algorithm-for-three-machine-unit-job-scheduling-September-24-2026/build/paper.tex",
          "sha256": "38f8318c45e578108367b3e35d87575ff0c1c56fb203d68a2d3b24b193eb6e2d"
        },
        {
          "path": "lean/docs/124.md",
          "sha256": "2d5e4213616aa59a02822ec073df5df1d057c1ee18d7a2ece021d3d660e26ff5"
        },
        {
          "path": "lean/ComparatorChallenges/ThreeMachine.lean",
          "sha256": "8635be3f542436b7bca3ab9d813ec7de7e2cfa201b4885d9a78ad3962096b7a2"
        },
        {
          "path": "lean/ComparatorChallenges/ThreeMachine.json",
          "sha256": "b12d227dd79d4674d180b15a2c62a712afcd5dedd9102e599fbaf9835dceb863"
        },
        {
          "path": "lean/OAI/Computability/Scheduling/Main.lean",
          "sha256": "94df75ac25f7c06690e4d404aed6fbca43d09c343dd581d989663debae55b82b"
        }
      ]
    },
    "138-fast-subset-sum-decision": {
      "family": "138",
      "statement_type": "paper_level_two_sided_randomized_subset_sum_decision",
      "formal_scope_covers_claim": false,
      "required_model": {
        "value_model": "positive_integers_repeated_values_allowed",
        "target_model": "nonnegative_integer_empty_subset_allowed",
        "output_model": "YES_NO_decision",
        "error_model": "two_sided_at_most_one_third_per_fixed_input",
        "input_access": "readonly_one_integer_per_word",
        "randomness_model": "fresh_independent_uniform_word_per_operation",
        "word_width": "ceil_four_times_n_plus_b_plus_log2_n_plus_two",
        "bit_regime": "every_fixed_c_eventually_b_at_most_n_power_c",
        "time_model": "every_random_execution_capped_word_operations",
        "advice_model": "none"
      },
      "obligations": [
        "original_positive_integer_model_and_item_identity_mapping",
        "word_width_and_multiword_operation_cost_bridge",
        "fresh_randomness_and_per_fixed_input_error_bridge",
        "known_bit_guard_and_unevaluated_fixed_cutoff_reviewed",
        "exact_fallback_and_actual_main_backend_distinguished",
        "two_sided_decision_not_exact_witness_or_count",
        "adaptive_self_reduction_and_amplification_budget_if_witness_requested",
        "returned_original_ID_witness_exactly_checked",
        "source_proof_and_absent_family_formal_scope_recorded",
        "practical_existing_solver_and_workflow_comparison"
      ],
      "excluded_uses": [
        "exact_negative_certificate_from_randomized_NO",
        "source_decision_directly_returns_witness",
        "exact_solution_count",
        "signed_adjustments_without_bridge",
        "combined_0_49_time_0_2_space_algorithm",
        "fast_main_branch_at_practical_n_without_guards",
        "source_verified_CP_SAT_or_MITM",
        "production_reconciliation_speedup"
      ],
      "source_locations": [
        "preprints/Subset-Sum-in-Time-2-power-0-49n-October-4-2026/build/sections/introduction.tex",
        "preprints/Subset-Sum-in-Time-2-power-0-49n-October-4-2026/build/sections/setup.tex",
        "preprints/Subset-Sum-in-Time-2-power-0-49n-October-4-2026/build/sections/implementation.tex"
      ],
      "source_location_stage": "Exact selected-section reading extents are in manuscript ledger v8; no independent proof or source-program execution",
      "source_location_hashes": [
        {
          "path": "preprints/Subset-Sum-in-Time-2-power-0-49n-October-4-2026/build/sections/introduction.tex",
          "sha256": "583a20059e520cff2aa5d99c5c7a457da6d6deae83a664813cc2b474a1920376"
        },
        {
          "path": "preprints/Subset-Sum-in-Time-2-power-0-49n-October-4-2026/build/sections/setup.tex",
          "sha256": "7a5681c2a0ec43838737d517978a49d6b2d68125f6419526a00d053a283c00ba"
        },
        {
          "path": "preprints/Subset-Sum-in-Time-2-power-0-49n-October-4-2026/build/sections/implementation.tex",
          "sha256": "ef78713f1e782ccb8c0360aa2ff68e0145cef9105371423e2617215d0d6e3aea"
        }
      ]
    },
    "138-low-space-subset-sum-decision": {
      "family": "138",
      "statement_type": "paper_level_one_sided_low_space_subset_sum_decision",
      "formal_scope_covers_claim": false,
      "required_model": {
        "value_model": "positive_integers_repeated_values_allowed",
        "target_model": "nonnegative_integer_empty_subset_allowed",
        "output_model": "YES_NO_decision",
        "error_model": "never_false_YES_at_most_one_third_false_NO",
        "input_access": "readonly_one_integer_per_word",
        "randomness_model": "fresh_independent_uniform_word_per_operation",
        "writable_space_model": "all_registers_addresses_counters_stacks_tables_seeds_random_values",
        "bit_regime": "every_fixed_c_eventually_b_at_most_n_power_c",
        "time_model": "every_random_execution_capped_word_operations",
        "space_bound": "A_c_times_n_plus_b_plus_two_power_15_times_2_power_0_199n_words"
      },
      "obligations": [
        "original_positive_integer_model_and_item_identity_mapping",
        "word_width_and_multiword_operation_cost_bridge",
        "all_writable_state_and_record_vs_occurrence_memory_accounted",
        "known_u_guard_and_unevaluated_fixed_cutoff_reviewed",
        "all_subset_exact_fallback_not_fast_main_branch",
        "fresh_round_trials_and_capped_work_reviewed",
        "one_sided_decision_not_exact_negative_or_count",
        "overlap_masks_not_merged_only_by_equal_sum",
        "adaptive_witness_recovery_error_budget_and_ID_check",
        "source_proof_and_absent_family_formal_scope_recorded"
      ],
      "excluded_uses": [
        "exact_negative_certificate_from_randomized_NO",
        "exact_solution_count",
        "combined_0_49_time_0_2_space_algorithm",
        "low_space_main_branch_at_practical_n_without_guards",
        "merge_equal_weight_different_overlap_masks",
        "space_excludes_stacks_or_random_seeds",
        "source_verified_CP_SAT_or_MITM",
        "production_reconciliation_speedup"
      ],
      "source_locations": [
        "preprints/A-Low-Space-Algorithm-for-Worst-Case-Subset-Sum-September-26-2026/build/introduction.tex",
        "preprints/A-Low-Space-Algorithm-for-Worst-Case-Subset-Sum-September-26-2026/build/resources.tex",
        "preprints/A-Low-Space-Algorithm-for-Worst-Case-Subset-Sum-September-26-2026/build/implementation.tex"
      ],
      "source_location_stage": "Exact selected-section reading extents are in manuscript ledger v8; no independent proof or source-program execution",
      "source_location_hashes": [
        {
          "path": "preprints/A-Low-Space-Algorithm-for-Worst-Case-Subset-Sum-September-26-2026/build/introduction.tex",
          "sha256": "36be7da587a332a23246d5ca9c19a4ed9f855886481fba44c10780a5710450aa"
        },
        {
          "path": "preprints/A-Low-Space-Algorithm-for-Worst-Case-Subset-Sum-September-26-2026/build/resources.tex",
          "sha256": "2b7555941f4d16098c84550f9e6069461027835f855f08d2f96db6b3c9a46b30"
        },
        {
          "path": "preprints/A-Low-Space-Algorithm-for-Worst-Case-Subset-Sum-September-26-2026/build/implementation.tex",
          "sha256": "430e40ff767cfa5b625d46d71cdc7f90d3c8b6d9637592a07f3d9dc4c6e5870a"
        }
      ]
    }
  },
  "independent_proof_verification": "not_run",
  "interpretation": "Eighteen documentary source/model contracts. The two subset-sum decision claims are separate paper-level results with different error and resource models; no family scope document, combined time/space algorithm, source-program execution, evidence-content certification or buyer acceptance is supplied."
}
