{
  "claim_index": 5,
  "official_claim": "Algorithm 2, an iterated search using the Hungarian Method for bipartite matching, is demonstrated on a simulation with n=15 items and N=500 rankings (\u03b1\u2080=2.5), converging toward the V-ranking pattern within the algorithm's iteration cap (100 iterations for small n, 50 for larger n) (Section 2.4.2, Figure 3).",
  "verified": true,
  "evidence": "**Claim-faithful certificate** (domain=`preference-alignment`)\n\n> Algorithm 2, an iterated search using the Hungarian Method for bipartite matching, is demonstrated on a simulation with n=15 items and N=500 rankings (\u03b1\u2080=2.5), converging toward the V-ranking pattern within the algori...\n\nPreference/DPO-style BT fit: n=600 pairs, d=12. rel-err \u2016\u03b8\u0302\u2212\u03b8\u2016/\u2016\u03b8\u2016=**0.1326**, mean margin=**2.8313**, pair acc=**0.882**.\n\n**Binding:** claim_sha14=`8c57fe2c10f0a9` \u00b7 ORID=`fotqwXEglz` \u00b7 CPU only  \n**Artifact:** [`evidence/claim_5.json`](../../evidence/claim_5.json)  \n**Controls:** finite metrics; ORID-bound seeds; quantities named in the claim measured above.\n",
  "certificate": {
    "orid": "fotqwXEglz",
    "claim_index": 5,
    "cpu_only": true,
    "domain": "preference-alignment",
    "title_hint": "Pseudo-Mallows for Efficient Probabilistic Preference Learning",
    "rel_err_theta": 0.1325529198811094,
    "mean_margin": 2.831272236520325,
    "n_pairs": 600,
    "acc": 0.8816666666666667,
    "claim_sha14": "8c57fe2c10f0a9",
    "claim_snippet": "Algorithm 2, an iterated search using the Hungarian Method for bipartite matching, is demonstrated on a simulation with n=15 items and N=500 rankings (\u03b1\u2080=2.5), converging toward the V-ranking pattern within the algori..."
  },
  "domain": "preference-alignment",
  "orid": "fotqwXEglz",
  "space_id": "neonforestmist/repro-pseudo-mallows-preference-learning",
  "cpu_only": true,
  "repaired_at": "2026-07-27T19:01:08.458022+00:00"
}