{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7ODQ6WUEKNEE67PEIR72DVFFY5","short_pith_number":"pith:7ODQ6WUE","schema_version":"1.0","canonical_sha256":"fb870f5a8453484f7de4447fa1d4a5c748c32b716509976c53974a196dc4b2e0","source":{"kind":"arxiv","id":"1309.6829","version":1},"attestation_state":"computed","paper":{"title":"Bethe-ADMM for Tree Decomposition based Parallel MAP Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Arindam Banerjee, Huahua Wang, Qiang Fu","submitted_at":"2013-09-26T12:38:09Z","abstract_excerpt":"We consider the problem of maximum a posteriori (MAP) inference in discrete graphical models. We present a parallel MAP inference algorithm called Bethe-ADMM based on two ideas: tree-decomposition of the graph and the alternating direction method of multipliers (ADMM). However, unlike the standard ADMM, we use an inexact ADMM augmented with a Bethe-divergence based proximal function, which makes each subproblem in ADMM easy to solve in parallel using the sum-product algorithm. We rigorously prove global convergence of Bethe-ADMM. The proposed algorithm is extensively evaluated on both syntheti"},"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":"1309.6829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:38:09Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d27507a700c15674a8732d1b01df5297dcdd5af9f6c61ea0eaeb13f274e052d8","abstract_canon_sha256":"8a0d2222721f3e90d93c1a03c5168c377d48f99ac1b8466c76bcf47abf6a2c5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.268368Z","signature_b64":"eJVnK97HCy5XR3LjA9P/OW3jKxPmC5QvNq4C0KJgXM+V/DDFH9x2xyu8lEt7JkPIj2VzMBgWpSn1GnH3vj2gDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb870f5a8453484f7de4447fa1d4a5c748c32b716509976c53974a196dc4b2e0","last_reissued_at":"2026-05-18T03:12:10.267740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.267740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bethe-ADMM for Tree Decomposition based Parallel MAP Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Arindam Banerjee, Huahua Wang, Qiang Fu","submitted_at":"2013-09-26T12:38:09Z","abstract_excerpt":"We consider the problem of maximum a posteriori (MAP) inference in discrete graphical models. We present a parallel MAP inference algorithm called Bethe-ADMM based on two ideas: tree-decomposition of the graph and the alternating direction method of multipliers (ADMM). However, unlike the standard ADMM, we use an inexact ADMM augmented with a Bethe-divergence based proximal function, which makes each subproblem in ADMM easy to solve in parallel using the sum-product algorithm. We rigorously prove global convergence of Bethe-ADMM. The proposed algorithm is extensively evaluated on both syntheti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6829","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":"1309.6829","created_at":"2026-05-18T03:12:10.267829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6829v1","created_at":"2026-05-18T03:12:10.267829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6829","created_at":"2026-05-18T03:12:10.267829+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ODQ6WUEKNEE","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ODQ6WUEKNEE67PE","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ODQ6WUE","created_at":"2026-05-18T12:27:36.564083+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/7ODQ6WUEKNEE67PEIR72DVFFY5","json":"https://pith.science/pith/7ODQ6WUEKNEE67PEIR72DVFFY5.json","graph_json":"https://pith.science/api/pith-number/7ODQ6WUEKNEE67PEIR72DVFFY5/graph.json","events_json":"https://pith.science/api/pith-number/7ODQ6WUEKNEE67PEIR72DVFFY5/events.json","paper":"https://pith.science/paper/7ODQ6WUE"},"agent_actions":{"view_html":"https://pith.science/pith/7ODQ6WUEKNEE67PEIR72DVFFY5","download_json":"https://pith.science/pith/7ODQ6WUEKNEE67PEIR72DVFFY5.json","view_paper":"https://pith.science/paper/7ODQ6WUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6829&json=true","fetch_graph":"https://pith.science/api/pith-number/7ODQ6WUEKNEE67PEIR72DVFFY5/graph.json","fetch_events":"https://pith.science/api/pith-number/7ODQ6WUEKNEE67PEIR72DVFFY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ODQ6WUEKNEE67PEIR72DVFFY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ODQ6WUEKNEE67PEIR72DVFFY5/action/storage_attestation","attest_author":"https://pith.science/pith/7ODQ6WUEKNEE67PEIR72DVFFY5/action/author_attestation","sign_citation":"https://pith.science/pith/7ODQ6WUEKNEE67PEIR72DVFFY5/action/citation_signature","submit_replication":"https://pith.science/pith/7ODQ6WUEKNEE67PEIR72DVFFY5/action/replication_record"}},"created_at":"2026-05-18T03:12:10.267829+00:00","updated_at":"2026-05-18T03:12:10.267829+00:00"}