{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5GV5C4MLLEQGGTMFNDCJRXWOS6","short_pith_number":"pith:5GV5C4ML","schema_version":"1.0","canonical_sha256":"e9abd1718b5920634d8568c498dece97a283f2c10699e49b99915bfa4db576f8","source":{"kind":"arxiv","id":"2605.13392","version":1},"attestation_state":"computed","paper":{"title":"Tighter relaxations for MAP-MRF optimization via Singleton Arc Consistency","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Running Singleton Arc Consistency on a derived CSP identifies clusters that tighten LP relaxations for MAP-MRF inference more effectively than frustrated cycle search","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Asaf Lev-Ran, Pavel Arkhipov, Vladimir Kolmogorov","submitted_at":"2026-05-13T11:50:58Z","abstract_excerpt":"We consider the MAP-MRF inference task, that is, minimizing a function of discrete variables represented as a sum of unary and pairwise terms. A prominent approach for tackling this NP-hard problem in practice is to solve its natural LP relaxation and then iteratively tighten the relaxation by adding clusters. Based on some theoretical observations, we propose a new technique for identifying such clusters. It works by running the Singleton Arc Consistency algorithm in a certain CSP instance. Experimental results indicate that the new tightening technique outperforms the previous approach by [S"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.13392","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T11:50:58Z","cross_cats_sorted":[],"title_canon_sha256":"12c8037465f18aadba90c66d823dafddaf4510ef647634ef80c3dba79939052f","abstract_canon_sha256":"986c3c697888fdf18a66bff564abc1af5674daeb6b62f6612de978b9dc1c1b23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:47.699022Z","signature_b64":"zutoGtVtLmIVFRrV55PVIGZ50cVeVUX4qiSjXxeKV95q+BqmQHVm4epZGAp4eDe6WyY2ibQ2hEuCIL50LbcpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9abd1718b5920634d8568c498dece97a283f2c10699e49b99915bfa4db576f8","last_reissued_at":"2026-05-18T02:44:47.698603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:47.698603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tighter relaxations for MAP-MRF optimization via Singleton Arc Consistency","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Running Singleton Arc Consistency on a derived CSP identifies clusters that tighten LP relaxations for MAP-MRF inference more effectively than frustrated cycle search","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Asaf Lev-Ran, Pavel Arkhipov, Vladimir Kolmogorov","submitted_at":"2026-05-13T11:50:58Z","abstract_excerpt":"We consider the MAP-MRF inference task, that is, minimizing a function of discrete variables represented as a sum of unary and pairwise terms. A prominent approach for tackling this NP-hard problem in practice is to solve its natural LP relaxation and then iteratively tighten the relaxation by adding clusters. Based on some theoretical observations, we propose a new technique for identifying such clusters. It works by running the Singleton Arc Consistency algorithm in a certain CSP instance. Experimental results indicate that the new tightening technique outperforms the previous approach by [S"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Experimental results indicate that the new tightening technique outperforms the previous approach by Sontag et al. UAI 2012 that searches for frustrated cycles.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the clusters discovered by Singleton Arc Consistency are sufficiently numerous and cheap to enumerate to produce a practically useful tightening of the LP relaxation on real-world instances.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Singleton Arc Consistency yields a new cluster-finding procedure that tightens MAP-MRF LP relaxations more effectively than frustrated-cycle search.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Running Singleton Arc Consistency on a derived CSP identifies clusters that tighten LP relaxations for MAP-MRF inference more effectively than frustrated cycle search","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"7a3a5d8ad92c5d451450495df401028dc0a48d4cbe6018f1d8d85d667746a1aa"},"source":{"id":"2605.13392","kind":"arxiv","version":1},"verdict":{"id":"5dae5416-624e-4979-8fe0-e45bce4246ac","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:44:11.921565Z","strongest_claim":"Experimental results indicate that the new tightening technique outperforms the previous approach by Sontag et al. UAI 2012 that searches for frustrated cycles.","one_line_summary":"Singleton Arc Consistency yields a new cluster-finding procedure that tightens MAP-MRF LP relaxations more effectively than frustrated-cycle search.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the clusters discovered by Singleton Arc Consistency are sufficiently numerous and cheap to enumerate to produce a practically useful tightening of the LP relaxation on real-world instances.","pith_extraction_headline":"Running Singleton Arc Consistency on a derived CSP identifies clusters that tighten LP relaxations for MAP-MRF inference more effectively than frustrated cycle search"},"references":{"count":38,"sample":[{"doi":"","year":2014,"title":"Prestwich, Thomas Schiex, and Seydou Traor \\'e","work_id":"d4802d3d-01fa-40bd-be74-1fc9d9d2decc","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"A new algorithm for singleton arc consistency","work_id":"ae50673c-dc67-4a5d-ba66-2270b97bbe5a","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2011,"title":"Markov Random Fields for Vision and Image Processing","work_id":"10edeeaf-3461-46c5-bb67-284df329d33d","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2011,"title":"D. Batra, S. Nowozin, and P. Kohli. Tighter relaxations for MAP-MRF inference: A local primal-dual gap based separation algorithm. In International Conference on Artificial Intelligence and Statistics","work_id":"eabbd35b-fbea-4fd1-acda-ca444d2a052e","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2005,"title":"Christian Bessi \\`e re, Jean-Charles R \\'e gin, Roland H. C. Yap, and Yuanlin Zhang. An optimal coarse-grained arc consistency algorithm. Artificial Intelligence , 165(2):165--185, 2005","work_id":"31bf329b-0bac-430d-841a-64e2123b6dcb","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":38,"snapshot_sha256":"2432e6868a87db23af8afda72e3716a0b10d6cde982059e1d2fcbd36c4182fe4","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.13392","created_at":"2026-05-18T02:44:47.698671+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13392v1","created_at":"2026-05-18T02:44:47.698671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13392","created_at":"2026-05-18T02:44:47.698671+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GV5C4MLLEQG","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GV5C4MLLEQGGTMF","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GV5C4ML","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5GV5C4MLLEQGGTMFNDCJRXWOS6","json":"https://pith.science/pith/5GV5C4MLLEQGGTMFNDCJRXWOS6.json","graph_json":"https://pith.science/api/pith-number/5GV5C4MLLEQGGTMFNDCJRXWOS6/graph.json","events_json":"https://pith.science/api/pith-number/5GV5C4MLLEQGGTMFNDCJRXWOS6/events.json","paper":"https://pith.science/paper/5GV5C4ML"},"agent_actions":{"view_html":"https://pith.science/pith/5GV5C4MLLEQGGTMFNDCJRXWOS6","download_json":"https://pith.science/pith/5GV5C4MLLEQGGTMFNDCJRXWOS6.json","view_paper":"https://pith.science/paper/5GV5C4ML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13392&json=true","fetch_graph":"https://pith.science/api/pith-number/5GV5C4MLLEQGGTMFNDCJRXWOS6/graph.json","fetch_events":"https://pith.science/api/pith-number/5GV5C4MLLEQGGTMFNDCJRXWOS6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GV5C4MLLEQGGTMFNDCJRXWOS6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GV5C4MLLEQGGTMFNDCJRXWOS6/action/storage_attestation","attest_author":"https://pith.science/pith/5GV5C4MLLEQGGTMFNDCJRXWOS6/action/author_attestation","sign_citation":"https://pith.science/pith/5GV5C4MLLEQGGTMFNDCJRXWOS6/action/citation_signature","submit_replication":"https://pith.science/pith/5GV5C4MLLEQGGTMFNDCJRXWOS6/action/replication_record"}},"created_at":"2026-05-18T02:44:47.698671+00:00","updated_at":"2026-05-18T02:44:47.698671+00:00"}