{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZQTUEYXVNISTG3BDKL346MOGAH","short_pith_number":"pith:ZQTUEYXV","schema_version":"1.0","canonical_sha256":"cc274262f56a25336c2352f7cf31c601e6a18da43831c43dd241569e75b65949","source":{"kind":"arxiv","id":"1404.3653","version":2},"attestation_state":"computed","paper":{"title":"Maximum Persistency in Energy Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Alexander Shekhovtsov","submitted_at":"2014-04-14T16:59:38Z","abstract_excerpt":"We consider discrete pairwise energy minimization problem (weighted constraint satisfaction, max-sum labeling) and methods that identify a globally optimal partial assignment of variables. When finding a complete optimal assignment is intractable, determining optimal values for a part of variables is an interesting possibility. Existing methods are based on different sufficient conditions. We propose a new sufficient condition for partial optimality which is: (1) verifiable in polynomial time (2) invariant to reparametrization of the problem and permutation of labels and (3) includes many exis"},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1404.3653","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-14T16:59:38Z","cross_cats_sorted":[],"title_canon_sha256":"b6c8c9db639ed572427de3ea6470dc82cb3d15aca8cb015942d95b99d9829144","abstract_canon_sha256":"99b7b625fae8355774c3c6455519259c92b3c2edc5203472784b62f860284fbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:45.500505Z","signature_b64":"8cBjJ+rXdFAzWSU/YmxGcAaAi+udJMOr1keMW2N5amjLq9qudP5//MYfzfkIOoFFyMCUMzkYW+IrTZSHer5tCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc274262f56a25336c2352f7cf31c601e6a18da43831c43dd241569e75b65949","last_reissued_at":"2026-05-18T02:49:45.500165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:45.500165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Persistency in Energy Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Alexander Shekhovtsov","submitted_at":"2014-04-14T16:59:38Z","abstract_excerpt":"We consider discrete pairwise energy minimization problem (weighted constraint satisfaction, max-sum labeling) and methods that identify a globally optimal partial assignment of variables. When finding a complete optimal assignment is intractable, determining optimal values for a part of variables is an interesting possibility. Existing methods are based on different sufficient conditions. We propose a new sufficient condition for partial optimality which is: (1) verifiable in polynomial time (2) invariant to reparametrization of the problem and permutation of labels and (3) includes many exis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3653","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","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":"1404.3653","created_at":"2026-05-18T02:49:45.500218+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3653v2","created_at":"2026-05-18T02:49:45.500218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3653","created_at":"2026-05-18T02:49:45.500218+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZQTUEYXVNIST","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZQTUEYXVNISTG3BD","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZQTUEYXV","created_at":"2026-05-18T12:28:59.999130+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/ZQTUEYXVNISTG3BDKL346MOGAH","json":"https://pith.science/pith/ZQTUEYXVNISTG3BDKL346MOGAH.json","graph_json":"https://pith.science/api/pith-number/ZQTUEYXVNISTG3BDKL346MOGAH/graph.json","events_json":"https://pith.science/api/pith-number/ZQTUEYXVNISTG3BDKL346MOGAH/events.json","paper":"https://pith.science/paper/ZQTUEYXV"},"agent_actions":{"view_html":"https://pith.science/pith/ZQTUEYXVNISTG3BDKL346MOGAH","download_json":"https://pith.science/pith/ZQTUEYXVNISTG3BDKL346MOGAH.json","view_paper":"https://pith.science/paper/ZQTUEYXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3653&json=true","fetch_graph":"https://pith.science/api/pith-number/ZQTUEYXVNISTG3BDKL346MOGAH/graph.json","fetch_events":"https://pith.science/api/pith-number/ZQTUEYXVNISTG3BDKL346MOGAH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZQTUEYXVNISTG3BDKL346MOGAH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZQTUEYXVNISTG3BDKL346MOGAH/action/storage_attestation","attest_author":"https://pith.science/pith/ZQTUEYXVNISTG3BDKL346MOGAH/action/author_attestation","sign_citation":"https://pith.science/pith/ZQTUEYXVNISTG3BDKL346MOGAH/action/citation_signature","submit_replication":"https://pith.science/pith/ZQTUEYXVNISTG3BDKL346MOGAH/action/replication_record"}},"created_at":"2026-05-18T02:49:45.500218+00:00","updated_at":"2026-05-18T02:49:45.500218+00:00"}