{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5GV5C4MLLEQGGTMFNDCJRXWOS6","short_pith_number":"pith:5GV5C4ML","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"},"canonical_sha256":"e9abd1718b5920634d8568c498dece97a283f2c10699e49b99915bfa4db576f8","source":{"kind":"arxiv","id":"2605.13392","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13392","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13392v1","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13392","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"5GV5C4MLLEQG","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"5GV5C4MLLEQGGTMF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"5GV5C4ML","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5GV5C4MLLEQGGTMFNDCJRXWOS6","target":"record","payload":{"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"},"canonical_sha256":"e9abd1718b5920634d8568c498dece97a283f2c10699e49b99915bfa4db576f8","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"},"source_kind":"arxiv","source_id":"2605.13392","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qA0jcje0TvI64k3b9mQ3Z69cpAmDUWwiFBZVgrFnOS/abYIOD1gij3f86T8vIXRw9gEesXMPiI2ohY3XlkS5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:18:11.629277Z"},"content_sha256":"cb973b390449cf9efa529817e3c59fb4b4d03fd75682189308121995256d799d","schema_version":"1.0","event_id":"sha256:cb973b390449cf9efa529817e3c59fb4b4d03fd75682189308121995256d799d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5GV5C4MLLEQGGTMFNDCJRXWOS6","target":"graph","payload":{"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"},"verdict_id":"5dae5416-624e-4979-8fe0-e45bce4246ac"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XD9rRaw4xXmaY9UY11yLs0C+7qBGbF9WapIti4twPVYwDhntfvbEmpZP2WeN4TTaCv9zSKgySMps+VpQJskkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:18:11.630280Z"},"content_sha256":"c6bb68eac2893362d66f5073965ec908a9e6c33da24d561378f1a9910a8ce7ff","schema_version":"1.0","event_id":"sha256:c6bb68eac2893362d66f5073965ec908a9e6c33da24d561378f1a9910a8ce7ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5GV5C4MLLEQGGTMFNDCJRXWOS6/bundle.json","state_url":"https://pith.science/pith/5GV5C4MLLEQGGTMFNDCJRXWOS6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5GV5C4MLLEQGGTMFNDCJRXWOS6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T17:18:11Z","links":{"resolver":"https://pith.science/pith/5GV5C4MLLEQGGTMFNDCJRXWOS6","bundle":"https://pith.science/pith/5GV5C4MLLEQGGTMFNDCJRXWOS6/bundle.json","state":"https://pith.science/pith/5GV5C4MLLEQGGTMFNDCJRXWOS6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5GV5C4MLLEQGGTMFNDCJRXWOS6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5GV5C4MLLEQGGTMFNDCJRXWOS6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"986c3c697888fdf18a66bff564abc1af5674daeb6b62f6612de978b9dc1c1b23","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T11:50:58Z","title_canon_sha256":"12c8037465f18aadba90c66d823dafddaf4510ef647634ef80c3dba79939052f"},"schema_version":"1.0","source":{"id":"2605.13392","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13392","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13392v1","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13392","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"5GV5C4MLLEQG","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"5GV5C4MLLEQGGTMF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"5GV5C4ML","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:c6bb68eac2893362d66f5073965ec908a9e6c33da24d561378f1a9910a8ce7ff","target":"graph","created_at":"2026-05-18T02:44:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Experimental results indicate that the new tightening technique outperforms the previous approach by Sontag et al. UAI 2012 that searches for frustrated cycles."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Singleton Arc Consistency yields a new cluster-finding procedure that tightens MAP-MRF LP relaxations more effectively than frustrated-cycle search."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","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"}],"snapshot_sha256":"7a3a5d8ad92c5d451450495df401028dc0a48d4cbe6018f1d8d85d667746a1aa"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Asaf Lev-Ran, Pavel Arkhipov, Vladimir Kolmogorov","cross_cats":[],"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","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T11:50:58Z","title":"Tighter relaxations for MAP-MRF optimization via Singleton Arc Consistency"},"references":{"count":38,"internal_anchors":0,"resolved_work":38,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Prestwich, Thomas Schiex, and Seydou Traor \\'e","work_id":"d4802d3d-01fa-40bd-be74-1fc9d9d2decc","year":2014},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"A new algorithm for singleton arc consistency","work_id":"ae50673c-dc67-4a5d-ba66-2270b97bbe5a","year":2004},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Markov Random Fields for Vision and Image Processing","work_id":"10edeeaf-3461-46c5-bb67-284df329d33d","year":2011},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"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","year":2011},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"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","year":2005}],"snapshot_sha256":"2432e6868a87db23af8afda72e3716a0b10d6cde982059e1d2fcbd36c4182fe4"},"source":{"id":"2605.13392","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:44:11.921565Z","id":"5dae5416-624e-4979-8fe0-e45bce4246ac","model_set":{"reader":"grok-4.3"},"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","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","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.","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."}},"verdict_id":"5dae5416-624e-4979-8fe0-e45bce4246ac"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cb973b390449cf9efa529817e3c59fb4b4d03fd75682189308121995256d799d","target":"record","created_at":"2026-05-18T02:44:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"986c3c697888fdf18a66bff564abc1af5674daeb6b62f6612de978b9dc1c1b23","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T11:50:58Z","title_canon_sha256":"12c8037465f18aadba90c66d823dafddaf4510ef647634ef80c3dba79939052f"},"schema_version":"1.0","source":{"id":"2605.13392","kind":"arxiv","version":1}},"canonical_sha256":"e9abd1718b5920634d8568c498dece97a283f2c10699e49b99915bfa4db576f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9abd1718b5920634d8568c498dece97a283f2c10699e49b99915bfa4db576f8","first_computed_at":"2026-05-18T02:44:47.698603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:47.698603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zutoGtVtLmIVFRrV55PVIGZ50cVeVUX4qiSjXxeKV95q+BqmQHVm4epZGAp4eDe6WyY2ibQ2hEuCIL50LbcpCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:47.699022Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13392","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb973b390449cf9efa529817e3c59fb4b4d03fd75682189308121995256d799d","sha256:c6bb68eac2893362d66f5073965ec908a9e6c33da24d561378f1a9910a8ce7ff"],"state_sha256":"96eb65b27c76d5c0e81dedbaede38d35159c544987d1cd3da67eb00a727e5304"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFn1GdQySGoiUdPttqudrUY2vN6cTYx8MGJXEHiaKnN8gE08awGsR523QBMLmTfAC5Yr0iYFvs2MGsrKYlcoAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T17:18:11.634615Z","bundle_sha256":"462bb30af94945003e6e082a3352c99941e678c0f291e32463567fd3484d5eb1"}}