{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CQIKB25UY3AAIJEGDPRZF2R5CR","short_pith_number":"pith:CQIKB25U","schema_version":"1.0","canonical_sha256":"1410a0ebb4c6c00424861be392ea3d1477ce294c25312c5dcd813946660b82d6","source":{"kind":"arxiv","id":"1212.6550","version":1},"attestation_state":"computed","paper":{"title":"Alternating Directions Dual Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andre F. T. Martins, Eric P. Xing, Mario A. T. Figueiredo, Noah A. Smith, Pedro M. Q. Aguiar","submitted_at":"2012-12-28T18:38:57Z","abstract_excerpt":"We propose AD3, a new algorithm for approximate maximum a posteriori (MAP) inference on factor graphs based on the alternating directions method of multipliers. Like dual decomposition algorithms, AD3 uses worker nodes to iteratively solve local subproblems and a controller node to combine these local solutions into a global update. The key characteristic of AD3 is that each local subproblem has a quadratic regularizer, leading to a faster consensus than subgradient-based dual decomposition, both theoretically and in practice. We provide closed-form solutions for these AD3 subproblems for bina"},"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":"1212.6550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-28T18:38:57Z","cross_cats_sorted":[],"title_canon_sha256":"717f30c75e32d60b6fae179ca75294c1f487631e279154330be6b5cc7a560999","abstract_canon_sha256":"d8413d8c5141cd7df4297e14f59ba9f6d6f8d9173e830a0f895c3047130f2674"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:31.612173Z","signature_b64":"SOfatE7hYw5pVaMbIjhzgzJO1ofJd02yj7gQSWSo5JeaGcIB/BSDH+O79Qy7NBQiPTqsIJlZt3IY+T+kC796Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1410a0ebb4c6c00424861be392ea3d1477ce294c25312c5dcd813946660b82d6","last_reissued_at":"2026-05-18T03:37:31.611415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:31.611415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alternating Directions Dual Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andre F. T. Martins, Eric P. Xing, Mario A. T. Figueiredo, Noah A. Smith, Pedro M. Q. Aguiar","submitted_at":"2012-12-28T18:38:57Z","abstract_excerpt":"We propose AD3, a new algorithm for approximate maximum a posteriori (MAP) inference on factor graphs based on the alternating directions method of multipliers. Like dual decomposition algorithms, AD3 uses worker nodes to iteratively solve local subproblems and a controller node to combine these local solutions into a global update. The key characteristic of AD3 is that each local subproblem has a quadratic regularizer, leading to a faster consensus than subgradient-based dual decomposition, both theoretically and in practice. We provide closed-form solutions for these AD3 subproblems for bina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6550","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":"1212.6550","created_at":"2026-05-18T03:37:31.611520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.6550v1","created_at":"2026-05-18T03:37:31.611520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6550","created_at":"2026-05-18T03:37:31.611520+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQIKB25UY3AA","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQIKB25UY3AAIJEG","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQIKB25U","created_at":"2026-05-18T12:27:01.376967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.01066","citing_title":"Language Models as Knowledge Bases?","ref_index":287,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CQIKB25UY3AAIJEGDPRZF2R5CR","json":"https://pith.science/pith/CQIKB25UY3AAIJEGDPRZF2R5CR.json","graph_json":"https://pith.science/api/pith-number/CQIKB25UY3AAIJEGDPRZF2R5CR/graph.json","events_json":"https://pith.science/api/pith-number/CQIKB25UY3AAIJEGDPRZF2R5CR/events.json","paper":"https://pith.science/paper/CQIKB25U"},"agent_actions":{"view_html":"https://pith.science/pith/CQIKB25UY3AAIJEGDPRZF2R5CR","download_json":"https://pith.science/pith/CQIKB25UY3AAIJEGDPRZF2R5CR.json","view_paper":"https://pith.science/paper/CQIKB25U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.6550&json=true","fetch_graph":"https://pith.science/api/pith-number/CQIKB25UY3AAIJEGDPRZF2R5CR/graph.json","fetch_events":"https://pith.science/api/pith-number/CQIKB25UY3AAIJEGDPRZF2R5CR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQIKB25UY3AAIJEGDPRZF2R5CR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQIKB25UY3AAIJEGDPRZF2R5CR/action/storage_attestation","attest_author":"https://pith.science/pith/CQIKB25UY3AAIJEGDPRZF2R5CR/action/author_attestation","sign_citation":"https://pith.science/pith/CQIKB25UY3AAIJEGDPRZF2R5CR/action/citation_signature","submit_replication":"https://pith.science/pith/CQIKB25UY3AAIJEGDPRZF2R5CR/action/replication_record"}},"created_at":"2026-05-18T03:37:31.611520+00:00","updated_at":"2026-05-18T03:37:31.611520+00:00"}