{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GEPZWIXA7K7UVIHKVEJHGEXHPF","short_pith_number":"pith:GEPZWIXA","schema_version":"1.0","canonical_sha256":"311f9b22e0fabf4aa0eaa9127312e77953e49bd4c5044c8c3061bab1eb143c20","source":{"kind":"arxiv","id":"1708.03314","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.03314","created_at":"2026-05-18T00:38:14.120194+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.03314v1","created_at":"2026-05-18T00:38:14.120194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03314","created_at":"2026-05-18T00:38:14.120194+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEPZWIXA7K7U","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEPZWIXA7K7UVIHK","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEPZWIXA","created_at":"2026-05-18T12:31:15.632608+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/GEPZWIXA7K7UVIHKVEJHGEXHPF","json":"https://pith.science/pith/GEPZWIXA7K7UVIHKVEJHGEXHPF.json","graph_json":"https://pith.science/api/pith-number/GEPZWIXA7K7UVIHKVEJHGEXHPF/graph.json","events_json":"https://pith.science/api/pith-number/GEPZWIXA7K7UVIHKVEJHGEXHPF/events.json","paper":"https://pith.science/paper/GEPZWIXA"},"agent_actions":{"view_html":"https://pith.science/pith/GEPZWIXA7K7UVIHKVEJHGEXHPF","download_json":"https://pith.science/pith/GEPZWIXA7K7UVIHKVEJHGEXHPF.json","view_paper":"https://pith.science/paper/GEPZWIXA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.03314&json=true","fetch_graph":"https://pith.science/api/pith-number/GEPZWIXA7K7UVIHKVEJHGEXHPF/graph.json","fetch_events":"https://pith.science/api/pith-number/GEPZWIXA7K7UVIHKVEJHGEXHPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEPZWIXA7K7UVIHKVEJHGEXHPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEPZWIXA7K7UVIHKVEJHGEXHPF/action/storage_attestation","attest_author":"https://pith.science/pith/GEPZWIXA7K7UVIHKVEJHGEXHPF/action/author_attestation","sign_citation":"https://pith.science/pith/GEPZWIXA7K7UVIHKVEJHGEXHPF/action/citation_signature","submit_replication":"https://pith.science/pith/GEPZWIXA7K7UVIHKVEJHGEXHPF/action/replication_record"}},"created_at":"2026-05-18T00:38:14.120194+00:00","updated_at":"2026-05-18T00:38:14.120194+00:00"}