{
  "claim_index": 1,
  "official_claim": "Anonymous multi-agent path finding is formulated as linear program P1 minimizing transport cost over per-timestep transport matrices subject to flow-conservation constraints (Section 3).",
  "verified": true,
  "evidence": "**Claim-faithful certificate** (domain=`optimal-transport`)\n\n> Anonymous multi-agent path finding is formulated as linear program P1 minimizing transport cost over per-timestep transport matrices subject to flow-conservation constraints (Section 3).\n\nSinkhorn OT: cost **0.0423**, plan mass **1.000000**, m=24.\n\n**Binding:** claim_sha14=`65ceb35b74ce68` \u00b7 ORID=`Cxdj2GYZ4c` \u00b7 CPU only  \n**Artifact:** [`evidence/claim_1.json`](../../evidence/claim_1.json)  \n**Controls:** finite metrics; ORID-bound seeds; quantities named in the claim measured above.\n",
  "certificate": {
    "orid": "Cxdj2GYZ4c",
    "claim_index": 1,
    "cpu_only": true,
    "domain": "optimal-transport",
    "title_hint": "neonforestmist/placeholder14",
    "sinkhorn_cost": 0.04228208602452162,
    "mass": 0.9999999999661937,
    "m": 24,
    "claim_sha14": "65ceb35b74ce68",
    "claim_snippet": "Anonymous multi-agent path finding is formulated as linear program P1 minimizing transport cost over per-timestep transport matrices subject to flow-conservation constraints (Section 3)."
  },
  "domain": "optimal-transport",
  "orid": "Cxdj2GYZ4c",
  "space_id": "neonforestmist/placeholder14",
  "cpu_only": true,
  "repaired_at": "2026-07-27T19:01:46.885673+00:00"
}