{
  "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
  "family": "113",
  "schedules": [
    {
      "original_vertices": 2,
      "epsilon": "1/10",
      "delta": "1/20",
      "stages": 16,
      "subdivision_parameter": 34,
      "enlarged_vertices": 138,
      "D0": 8100000000,
      "D": 15425640000000000,
      "sigma": "1/154256400000000000000000",
      "samples_per_stage": "4521057018782400000000000000000000000000000000000",
      "samples_per_stage_decimal_digits": 49,
      "median_trials": 61,
      "total_fresh_sampler_runs": "4412551650331622400000000000000000000000000000000000",
      "interpretation": "Declared nonempty general counting schedule before charging the replicated sampler. Empty/infeasible branches are separate; no practical variant or theorem lower bound is asserted."
    },
    {
      "original_vertices": 4,
      "epsilon": "1/10",
      "delta": "1/20",
      "stages": 39,
      "subdivision_parameter": 80,
      "enlarged_vertices": 1924,
      "D0": 62500000000,
      "D": 23136100000000000000,
      "sigma": "1/231361000000000000000000000",
      "samples_per_stage": "23552281421240000000000000000000000000000000000000000000",
      "samples_per_stage_decimal_digits": 56,
      "median_trials": 61,
      "total_fresh_sampler_runs": "56030877501129960000000000000000000000000000000000000000000",
      "interpretation": "Declared nonempty general counting schedule before charging the replicated sampler. Empty/infeasible branches are separate; no practical variant or theorem lower bound is asserted."
    },
    {
      "original_vertices": 8,
      "epsilon": "1/10",
      "delta": "1/20",
      "stages": 120,
      "subdivision_parameter": 242,
      "enlarged_vertices": 27112,
      "D0": 656100000000,
      "D": 48227322291840000000000,
      "sigma": "1/482273222918400000000000000000",
      "samples_per_stage": "300037825391889953326845542400000000000000000000000000000000000",
      "samples_per_stage_decimal_digits": 63,
      "median_trials": 61,
      "total_fresh_sampler_runs": "2196276881868634458352509370368000000000000000000000000000000000000",
      "interpretation": "Declared nonempty general counting schedule before charging the replicated sampler. Empty/infeasible branches are separate; no practical variant or theorem lower bound is asserted."
    }
  ],
  "arithmetic": "exact integers and fractions",
  "source_proof_verification": "not_run",
  "source_location": "preprints/A-Fully-Polynomial-Randomized-Approximation-Scheme-for-Perfect-Matchings-in-General-Graphs-September-23-2026/build/main.tex",
  "source_lines": {
    "schedule": [
      2540,
      2589
    ],
    "statistics": [
      2640,
      2650
    ],
    "amplification": [
      2826,
      2832
    ]
  },
  "deterministic_companion": {
    "guaranteed_count_factor": "512^n",
    "interpretation": "Exponential approximation factor, not fixed relative-error accuracy. Large-degree polynomial runtime explicitly stated; sharp global face-dimension bound is outside the selected formal scope."
  }
}