{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OZAWIFWR7UQBVA4AWRSCV5JEGO","short_pith_number":"pith:OZAWIFWR","schema_version":"1.0","canonical_sha256":"76416416d1fd201a8380b4642af52433961c39765fa7e8c7616e51a3916dafd2","source":{"kind":"arxiv","id":"1202.3739","version":1},"attestation_state":"computed","paper":{"title":"Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.CO"],"primary_cat":"cs.AI","authors_text":"Akshat Kumar, Shlomo Zilberstein","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"Computing maximum a posteriori (MAP) estimation in graphical models is an important inference problem with many applications. We present message-passing algorithms for quadratic programming (QP) formulations of MAP estimation for pairwise Markov random fields. In particular, we use the concave-convex procedure (CCCP) to obtain a locally optimal algorithm for the non-convex QP formulation. A similar technique is used to derive a globally convergent algorithm for the convex QP relaxation of MAP. We also show that a recently developed expectation-maximization (EM) algorithm for the QP formulation"},"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":"1202.3739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["cs.DS","stat.CO"],"title_canon_sha256":"5b9b113a4569ee48e6a3fc5b2a9e77c1679fa24f87916c7be7849e47acaf8c65","abstract_canon_sha256":"95374c428787a8a0643e6b63f6ee18c70dc5c429cfab51ebb5fd167473d42faf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:03.181986Z","signature_b64":"Sti5jDuTiC7VZq9BxJss7n++HBp94MBgMhf0nKkqBRuV5mTXikxbtfX0mGUqnRpVckjj58M0cvlEnyf+2OK1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76416416d1fd201a8380b4642af52433961c39765fa7e8c7616e51a3916dafd2","last_reissued_at":"2026-05-18T04:02:03.181285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:03.181285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.CO"],"primary_cat":"cs.AI","authors_text":"Akshat Kumar, Shlomo Zilberstein","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"Computing maximum a posteriori (MAP) estimation in graphical models is an important inference problem with many applications. We present message-passing algorithms for quadratic programming (QP) formulations of MAP estimation for pairwise Markov random fields. In particular, we use the concave-convex procedure (CCCP) to obtain a locally optimal algorithm for the non-convex QP formulation. A similar technique is used to derive a globally convergent algorithm for the convex QP relaxation of MAP. We also show that a recently developed expectation-maximization (EM) algorithm for the QP formulation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3739","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":"1202.3739","created_at":"2026-05-18T04:02:03.181397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3739v1","created_at":"2026-05-18T04:02:03.181397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3739","created_at":"2026-05-18T04:02:03.181397+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZAWIFWR7UQB","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZAWIFWR7UQBVA4A","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZAWIFWR","created_at":"2026-05-18T12:27:18.751474+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/OZAWIFWR7UQBVA4AWRSCV5JEGO","json":"https://pith.science/pith/OZAWIFWR7UQBVA4AWRSCV5JEGO.json","graph_json":"https://pith.science/api/pith-number/OZAWIFWR7UQBVA4AWRSCV5JEGO/graph.json","events_json":"https://pith.science/api/pith-number/OZAWIFWR7UQBVA4AWRSCV5JEGO/events.json","paper":"https://pith.science/paper/OZAWIFWR"},"agent_actions":{"view_html":"https://pith.science/pith/OZAWIFWR7UQBVA4AWRSCV5JEGO","download_json":"https://pith.science/pith/OZAWIFWR7UQBVA4AWRSCV5JEGO.json","view_paper":"https://pith.science/paper/OZAWIFWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3739&json=true","fetch_graph":"https://pith.science/api/pith-number/OZAWIFWR7UQBVA4AWRSCV5JEGO/graph.json","fetch_events":"https://pith.science/api/pith-number/OZAWIFWR7UQBVA4AWRSCV5JEGO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZAWIFWR7UQBVA4AWRSCV5JEGO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZAWIFWR7UQBVA4AWRSCV5JEGO/action/storage_attestation","attest_author":"https://pith.science/pith/OZAWIFWR7UQBVA4AWRSCV5JEGO/action/author_attestation","sign_citation":"https://pith.science/pith/OZAWIFWR7UQBVA4AWRSCV5JEGO/action/citation_signature","submit_replication":"https://pith.science/pith/OZAWIFWR7UQBVA4AWRSCV5JEGO/action/replication_record"}},"created_at":"2026-05-18T04:02:03.181397+00:00","updated_at":"2026-05-18T04:02:03.181397+00:00"}