{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZQTUEYXVNISTG3BDKL346MOGAH","short_pith_number":"pith:ZQTUEYXV","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"},"canonical_sha256":"cc274262f56a25336c2352f7cf31c601e6a18da43831c43dd241569e75b65949","source":{"kind":"arxiv","id":"1404.3653","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3653","created_at":"2026-05-18T02:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3653v2","created_at":"2026-05-18T02:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3653","created_at":"2026-05-18T02:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZQTUEYXVNIST","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZQTUEYXVNISTG3BD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZQTUEYXV","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZQTUEYXVNISTG3BDKL346MOGAH","target":"record","payload":{"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"},"canonical_sha256":"cc274262f56a25336c2352f7cf31c601e6a18da43831c43dd241569e75b65949","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"},"source_kind":"arxiv","source_id":"1404.3653","source_version":2,"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:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fdbMToX8+pD516//jj0g4FBnwDhZivScpkDiRd5Lsj1KLp5kk3RMCbj+G6jhoAYuYo9ML0W8RGp7VS7GI951Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:04:27.611789Z"},"content_sha256":"5075d37a2d3973239ac69b6b4046b5ed78dbe81a19483d5f75ab30f9746b901d","schema_version":"1.0","event_id":"sha256:5075d37a2d3973239ac69b6b4046b5ed78dbe81a19483d5f75ab30f9746b901d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZQTUEYXVNISTG3BDKL346MOGAH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5jNkR6xajZOiXD1TlGJUc0GB78WK2DuZ82BJ6ra8BuS7vI0coE7nne9JfcHym3V+khilxqtUnckV5Ah7qlMmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:04:27.612479Z"},"content_sha256":"213670ae8e6ec9b7e866e89c24271720f92b500830ede9f88e185c974d382913","schema_version":"1.0","event_id":"sha256:213670ae8e6ec9b7e866e89c24271720f92b500830ede9f88e185c974d382913"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQTUEYXVNISTG3BDKL346MOGAH/bundle.json","state_url":"https://pith.science/pith/ZQTUEYXVNISTG3BDKL346MOGAH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQTUEYXVNISTG3BDKL346MOGAH/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-06-11T01:04:27Z","links":{"resolver":"https://pith.science/pith/ZQTUEYXVNISTG3BDKL346MOGAH","bundle":"https://pith.science/pith/ZQTUEYXVNISTG3BDKL346MOGAH/bundle.json","state":"https://pith.science/pith/ZQTUEYXVNISTG3BDKL346MOGAH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQTUEYXVNISTG3BDKL346MOGAH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZQTUEYXVNISTG3BDKL346MOGAH","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":"99b7b625fae8355774c3c6455519259c92b3c2edc5203472784b62f860284fbb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-14T16:59:38Z","title_canon_sha256":"b6c8c9db639ed572427de3ea6470dc82cb3d15aca8cb015942d95b99d9829144"},"schema_version":"1.0","source":{"id":"1404.3653","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3653","created_at":"2026-05-18T02:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3653v2","created_at":"2026-05-18T02:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3653","created_at":"2026-05-18T02:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZQTUEYXVNIST","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZQTUEYXVNISTG3BD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZQTUEYXV","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:213670ae8e6ec9b7e866e89c24271720f92b500830ede9f88e185c974d382913","target":"graph","created_at":"2026-05-18T02:49:45Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexander Shekhovtsov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-14T16:59:38Z","title":"Maximum Persistency in Energy Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3653","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5075d37a2d3973239ac69b6b4046b5ed78dbe81a19483d5f75ab30f9746b901d","target":"record","created_at":"2026-05-18T02:49:45Z","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":"99b7b625fae8355774c3c6455519259c92b3c2edc5203472784b62f860284fbb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-14T16:59:38Z","title_canon_sha256":"b6c8c9db639ed572427de3ea6470dc82cb3d15aca8cb015942d95b99d9829144"},"schema_version":"1.0","source":{"id":"1404.3653","kind":"arxiv","version":2}},"canonical_sha256":"cc274262f56a25336c2352f7cf31c601e6a18da43831c43dd241569e75b65949","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc274262f56a25336c2352f7cf31c601e6a18da43831c43dd241569e75b65949","first_computed_at":"2026-05-18T02:49:45.500165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:45.500165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8cBjJ+rXdFAzWSU/YmxGcAaAi+udJMOr1keMW2N5amjLq9qudP5//MYfzfkIOoFFyMCUMzkYW+IrTZSHer5tCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:45.500505Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3653","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5075d37a2d3973239ac69b6b4046b5ed78dbe81a19483d5f75ab30f9746b901d","sha256:213670ae8e6ec9b7e866e89c24271720f92b500830ede9f88e185c974d382913"],"state_sha256":"0b658f38b785f7ea533a9dcded075c65c1320f209c5277012af5cf3a56b11316"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"klIAcRKCKIqp1p/ygp6wWv+uQfcfFx7LNtDOEoQyiJJEvYFilHNHGebyrU7Vp92Qv85/fK+gMLiHvM6XnH+/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:04:27.616521Z","bundle_sha256":"c5cb4f1b85f301108c103645c2eb7ac84256e42e526ad1eaeeab947d426bf0c0"}}