{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YISFGWY6TB7BZR3Y3NOEZM2JM4","short_pith_number":"pith:YISFGWY6","canonical_record":{"source":{"id":"1410.6641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-10-24T10:32:18Z","cross_cats_sorted":[],"title_canon_sha256":"d7331ce6c02a3ec65e2d362ce7c51d0f5337e0fa417566d411cb329ea34ccf26","abstract_canon_sha256":"6edaa4e2cad44e0815c101dcab6762947c75807d4a03c0868329d4317e95a9e5"},"schema_version":"1.0"},"canonical_sha256":"c224535b1e987e1cc778db5c4cb349671ea85449784be7dfbb1c055c447addb7","source":{"kind":"arxiv","id":"1410.6641","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6641","created_at":"2026-05-18T01:35:11Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6641v2","created_at":"2026-05-18T01:35:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6641","created_at":"2026-05-18T01:35:11Z"},{"alias_kind":"pith_short_12","alias_value":"YISFGWY6TB7B","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YISFGWY6TB7BZR3Y","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YISFGWY6","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YISFGWY6TB7BZR3Y3NOEZM2JM4","target":"record","payload":{"canonical_record":{"source":{"id":"1410.6641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-10-24T10:32:18Z","cross_cats_sorted":[],"title_canon_sha256":"d7331ce6c02a3ec65e2d362ce7c51d0f5337e0fa417566d411cb329ea34ccf26","abstract_canon_sha256":"6edaa4e2cad44e0815c101dcab6762947c75807d4a03c0868329d4317e95a9e5"},"schema_version":"1.0"},"canonical_sha256":"c224535b1e987e1cc778db5c4cb349671ea85449784be7dfbb1c055c447addb7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:11.875526Z","signature_b64":"y9OmDJDeeTAJIO9Ak+P9FcR81eqJKt9EGUV9PmOUZ6REeq9GL8zZ/Bhux3G2F3K2DgMTF4NJhkEe1N7j+PSLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c224535b1e987e1cc778db5c4cb349671ea85449784be7dfbb1c055c447addb7","last_reissued_at":"2026-05-18T01:35:11.874844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:11.874844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.6641","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-18T01:35:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eM0keyQVQloHsQVb7yHhG/6IKt0CzMIKmI6qfdzu4cpkAuUKOcNnqYYXGotJZbu1iUakbU4Gc9W7QinqXIXrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:48:29.260862Z"},"content_sha256":"802ce0f2d7028138d1473e7510e40c0a9c6f53fc7288ce337a190509fa27b58c","schema_version":"1.0","event_id":"sha256:802ce0f2d7028138d1473e7510e40c0a9c6f53fc7288ce337a190509fa27b58c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YISFGWY6TB7BZR3Y3NOEZM2JM4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partial Optimality by Pruning for MAP-Inference with General Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alexander Shekhovtsov, Bogdan Savchynskyy, Christoph Schn\\\"orr, J\\\"org Hendrik Kappes, Paul Swoboda","submitted_at":"2014-10-24T10:32:18Z","abstract_excerpt":"We consider the energy minimization problem for undirected graphical models, also known as MAP-inference problem for Markov random fields which is NP-hard in general. We propose a novel polynomial time algorithm to obtain a part of its optimal non-relaxed integral solution. Our algorithm is initialized with variables taking integral values in the solution of a convex relaxation of the MAP-inference problem and iteratively prunes those, which do not satisfy our criterion for partial optimality. We show that our pruning strategy is in a certain sense theoretically optimal. Also empirically our m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6641","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-18T01:35:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KCo8a5ari+R2s7j2RzedEZ3i4Iz/GyqbBg9c9dm6k9AedIZHlJTjqKN88QnQNKbAvSjE4Hk9jVOwrsXov/S6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:48:29.261208Z"},"content_sha256":"49ab13248e0875228716956a7f845482f2a087b44f3724769ed8387a6dcd6376","schema_version":"1.0","event_id":"sha256:49ab13248e0875228716956a7f845482f2a087b44f3724769ed8387a6dcd6376"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YISFGWY6TB7BZR3Y3NOEZM2JM4/bundle.json","state_url":"https://pith.science/pith/YISFGWY6TB7BZR3Y3NOEZM2JM4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YISFGWY6TB7BZR3Y3NOEZM2JM4/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-10T22:48:29Z","links":{"resolver":"https://pith.science/pith/YISFGWY6TB7BZR3Y3NOEZM2JM4","bundle":"https://pith.science/pith/YISFGWY6TB7BZR3Y3NOEZM2JM4/bundle.json","state":"https://pith.science/pith/YISFGWY6TB7BZR3Y3NOEZM2JM4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YISFGWY6TB7BZR3Y3NOEZM2JM4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YISFGWY6TB7BZR3Y3NOEZM2JM4","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":"6edaa4e2cad44e0815c101dcab6762947c75807d4a03c0868329d4317e95a9e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-10-24T10:32:18Z","title_canon_sha256":"d7331ce6c02a3ec65e2d362ce7c51d0f5337e0fa417566d411cb329ea34ccf26"},"schema_version":"1.0","source":{"id":"1410.6641","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6641","created_at":"2026-05-18T01:35:11Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6641v2","created_at":"2026-05-18T01:35:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6641","created_at":"2026-05-18T01:35:11Z"},{"alias_kind":"pith_short_12","alias_value":"YISFGWY6TB7B","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YISFGWY6TB7BZR3Y","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YISFGWY6","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:49ab13248e0875228716956a7f845482f2a087b44f3724769ed8387a6dcd6376","target":"graph","created_at":"2026-05-18T01:35:11Z","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 the energy minimization problem for undirected graphical models, also known as MAP-inference problem for Markov random fields which is NP-hard in general. We propose a novel polynomial time algorithm to obtain a part of its optimal non-relaxed integral solution. Our algorithm is initialized with variables taking integral values in the solution of a convex relaxation of the MAP-inference problem and iteratively prunes those, which do not satisfy our criterion for partial optimality. We show that our pruning strategy is in a certain sense theoretically optimal. Also empirically our m","authors_text":"Alexander Shekhovtsov, Bogdan Savchynskyy, Christoph Schn\\\"orr, J\\\"org Hendrik Kappes, Paul Swoboda","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-10-24T10:32:18Z","title":"Partial Optimality by Pruning for MAP-Inference with General Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6641","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:802ce0f2d7028138d1473e7510e40c0a9c6f53fc7288ce337a190509fa27b58c","target":"record","created_at":"2026-05-18T01:35:11Z","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":"6edaa4e2cad44e0815c101dcab6762947c75807d4a03c0868329d4317e95a9e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-10-24T10:32:18Z","title_canon_sha256":"d7331ce6c02a3ec65e2d362ce7c51d0f5337e0fa417566d411cb329ea34ccf26"},"schema_version":"1.0","source":{"id":"1410.6641","kind":"arxiv","version":2}},"canonical_sha256":"c224535b1e987e1cc778db5c4cb349671ea85449784be7dfbb1c055c447addb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c224535b1e987e1cc778db5c4cb349671ea85449784be7dfbb1c055c447addb7","first_computed_at":"2026-05-18T01:35:11.874844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:11.874844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y9OmDJDeeTAJIO9Ak+P9FcR81eqJKt9EGUV9PmOUZ6REeq9GL8zZ/Bhux3G2F3K2DgMTF4NJhkEe1N7j+PSLCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:11.875526Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.6641","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:802ce0f2d7028138d1473e7510e40c0a9c6f53fc7288ce337a190509fa27b58c","sha256:49ab13248e0875228716956a7f845482f2a087b44f3724769ed8387a6dcd6376"],"state_sha256":"db0adc8d36708e4b6a8c7128aca37e301e3a4113437cdb0c1f4471d8239386aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7iAniRWqVh/OF0+FI7u7rrrzcBFjz1rQesxvZz+XGwpJ/eT4Z7HjLqc0bpfSvqb4zON8LXrEXqWwxUueTpu7AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:48:29.263469Z","bundle_sha256":"b590c72bc3d85795ba71bc65341c7ecfbeeec071f2d4bbc2603d16c8d3498ebf"}}