{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GEPZWIXA7K7UVIHKVEJHGEXHPF","short_pith_number":"pith:GEPZWIXA","canonical_record":{"source":{"id":"1708.03314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-09T06:32:20Z","cross_cats_sorted":[],"title_canon_sha256":"863394dacf7e6d6b8ecdd7630d4dddf74edd05729b895a2e44fb0e19123b440b","abstract_canon_sha256":"04e172ff475001256e0fad2044d119706d64eebbe5f653ae0c135bb8de2dc5c1"},"schema_version":"1.0"},"canonical_sha256":"311f9b22e0fabf4aa0eaa9127312e77953e49bd4c5044c8c3061bab1eb143c20","source":{"kind":"arxiv","id":"1708.03314","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03314","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03314v1","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03314","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"pith_short_12","alias_value":"GEPZWIXA7K7U","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GEPZWIXA7K7UVIHK","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GEPZWIXA","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GEPZWIXA7K7UVIHKVEJHGEXHPF","target":"record","payload":{"canonical_record":{"source":{"id":"1708.03314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-09T06:32:20Z","cross_cats_sorted":[],"title_canon_sha256":"863394dacf7e6d6b8ecdd7630d4dddf74edd05729b895a2e44fb0e19123b440b","abstract_canon_sha256":"04e172ff475001256e0fad2044d119706d64eebbe5f653ae0c135bb8de2dc5c1"},"schema_version":"1.0"},"canonical_sha256":"311f9b22e0fabf4aa0eaa9127312e77953e49bd4c5044c8c3061bab1eb143c20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:14.120722Z","signature_b64":"1P1RPsvxK3sZzPIIotF0O7pa6wOmvoleYtI/MTQzEp2pNrdxg/vPQJzEajgaJspOMl4bJnIhWmqpakvZETfdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"311f9b22e0fabf4aa0eaa9127312e77953e49bd4c5044c8c3061bab1eb143c20","last_reissued_at":"2026-05-18T00:38:14.120114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:14.120114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.03314","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-18T00:38:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NgYJF6JEtjuH0PMD15pyk/6WhSl78ZkkG1Tx0iY7vBHxjqA2Jxwv768Tsu7zhAbBpTtrv6T8QOgO+EUfM2aeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:13:49.227622Z"},"content_sha256":"b41bc5206bdd7988fa0d04b482dcd2809314f4d0d019c9175201981f1730f2ce","schema_version":"1.0","event_id":"sha256:b41bc5206bdd7988fa0d04b482dcd2809314f4d0d019c9175201981f1730f2ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GEPZWIXA7K7UVIHKVEJHGEXHPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partial Optimality of Dual Decomposition for MAP Inference in Pairwise MRFs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Bauer, Klaus-Robert M\\\"uller, Nico G\\\"ornitz, Shinichi Nakajima","submitted_at":"2017-08-09T06:32:20Z","abstract_excerpt":"Markov random fields (MRFs) are a powerful tool for modelling statistical dependencies for a set of random variables using a graphical representation. An important computational problem related to MRFs, called maximum a posteriori (MAP) inference, is finding a joint variable assignment with the maximal probability. It is well known that the two popular optimisation techniques for this task, linear programming (LP) relaxation and dual decomposition (DD), have a strong connection both providing an optimal solution to the MAP problem when a corresponding LP relaxation is tight. However, less is k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03314","kind":"arxiv","version":1},"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-18T00:38:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6wgqorpl+a8+3ao42GCTSpbAGQirqMk6TJldZqiEjbVIif3leaNWxieOW7qNUCIoPVs+joz5LAT6XBeDZoRHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:13:49.228202Z"},"content_sha256":"860f11dd446b0662db28ed4171a3bf9c8523728f594de9964a8e7aa28f21f953","schema_version":"1.0","event_id":"sha256:860f11dd446b0662db28ed4171a3bf9c8523728f594de9964a8e7aa28f21f953"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEPZWIXA7K7UVIHKVEJHGEXHPF/bundle.json","state_url":"https://pith.science/pith/GEPZWIXA7K7UVIHKVEJHGEXHPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEPZWIXA7K7UVIHKVEJHGEXHPF/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-23T21:13:49Z","links":{"resolver":"https://pith.science/pith/GEPZWIXA7K7UVIHKVEJHGEXHPF","bundle":"https://pith.science/pith/GEPZWIXA7K7UVIHKVEJHGEXHPF/bundle.json","state":"https://pith.science/pith/GEPZWIXA7K7UVIHKVEJHGEXHPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEPZWIXA7K7UVIHKVEJHGEXHPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GEPZWIXA7K7UVIHKVEJHGEXHPF","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":"04e172ff475001256e0fad2044d119706d64eebbe5f653ae0c135bb8de2dc5c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-09T06:32:20Z","title_canon_sha256":"863394dacf7e6d6b8ecdd7630d4dddf74edd05729b895a2e44fb0e19123b440b"},"schema_version":"1.0","source":{"id":"1708.03314","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03314","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03314v1","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03314","created_at":"2026-05-18T00:38:14Z"},{"alias_kind":"pith_short_12","alias_value":"GEPZWIXA7K7U","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GEPZWIXA7K7UVIHK","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GEPZWIXA","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:860f11dd446b0662db28ed4171a3bf9c8523728f594de9964a8e7aa28f21f953","target":"graph","created_at":"2026-05-18T00:38:14Z","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":"Markov random fields (MRFs) are a powerful tool for modelling statistical dependencies for a set of random variables using a graphical representation. An important computational problem related to MRFs, called maximum a posteriori (MAP) inference, is finding a joint variable assignment with the maximal probability. It is well known that the two popular optimisation techniques for this task, linear programming (LP) relaxation and dual decomposition (DD), have a strong connection both providing an optimal solution to the MAP problem when a corresponding LP relaxation is tight. However, less is k","authors_text":"Alexander Bauer, Klaus-Robert M\\\"uller, Nico G\\\"ornitz, Shinichi Nakajima","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-09T06:32:20Z","title":"Partial Optimality of Dual Decomposition for MAP Inference in Pairwise MRFs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03314","kind":"arxiv","version":1},"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:b41bc5206bdd7988fa0d04b482dcd2809314f4d0d019c9175201981f1730f2ce","target":"record","created_at":"2026-05-18T00:38:14Z","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":"04e172ff475001256e0fad2044d119706d64eebbe5f653ae0c135bb8de2dc5c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-09T06:32:20Z","title_canon_sha256":"863394dacf7e6d6b8ecdd7630d4dddf74edd05729b895a2e44fb0e19123b440b"},"schema_version":"1.0","source":{"id":"1708.03314","kind":"arxiv","version":1}},"canonical_sha256":"311f9b22e0fabf4aa0eaa9127312e77953e49bd4c5044c8c3061bab1eb143c20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"311f9b22e0fabf4aa0eaa9127312e77953e49bd4c5044c8c3061bab1eb143c20","first_computed_at":"2026-05-18T00:38:14.120114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:14.120114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1P1RPsvxK3sZzPIIotF0O7pa6wOmvoleYtI/MTQzEp2pNrdxg/vPQJzEajgaJspOMl4bJnIhWmqpakvZETfdBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:14.120722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.03314","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b41bc5206bdd7988fa0d04b482dcd2809314f4d0d019c9175201981f1730f2ce","sha256:860f11dd446b0662db28ed4171a3bf9c8523728f594de9964a8e7aa28f21f953"],"state_sha256":"d0240c64d520cc7ea3b41337a6ad0389cf267c1c6df93ceb7c2d00aeeb6d0273"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M6a80ijxblzJ/dK8Y6rPxVgd7H1kFXeOep8OQmVZ61ALZG+jPt/yxKcd9IlIX7I52722/UL+bHqaogBV0xC4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T21:13:49.231594Z","bundle_sha256":"157f74d6ec962285a425a49969c0cd2eaf1b2c0e955efa964d3b7db3cb6a0d72"}}