{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:T4ITVFESCLTNBPFX2M5YPOUILA","short_pith_number":"pith:T4ITVFES","schema_version":"1.0","canonical_sha256":"9f113a949212e6d0bcb7d33b87ba88583eeb088ef5b34b3e59eae04e6b2cd902","source":{"kind":"arxiv","id":"1305.1961","version":1},"attestation_state":"computed","paper":{"title":"An Improved Three-Weight Message-Passing Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC","physics.comp-ph"],"primary_cat":"cs.AI","authors_text":"Jonathan S. Yedidia, Jos\\'e Bento, Nate Derbinsky, Veit Elser","submitted_at":"2013-05-08T21:24:14Z","abstract_excerpt":"We describe how the powerful \"Divide and Concur\" algorithm for constraint satisfaction can be derived as a special case of a message-passing version of the Alternating Direction Method of Multipliers (ADMM) algorithm for convex optimization, and introduce an improved message-passing algorithm based on ADMM/DC by introducing three distinct weights for messages, with \"certain\" and \"no opinion\" weights, as well as the standard weight used in ADMM/DC. The \"certain\" messages allow our improved algorithm to implement constraint propagation as a special case, while the \"no opinion\" messages speed con"},"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":"1305.1961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-05-08T21:24:14Z","cross_cats_sorted":["cs.DS","math.OC","physics.comp-ph"],"title_canon_sha256":"76ed18041a5dd4558b5c4d498d0b38961ae378e5aff4f4a647233935ad8f9568","abstract_canon_sha256":"c579a4a00f39647fd4967f2bfd0662d274d3edc25940fd18f840592e2513bd1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:09.695391Z","signature_b64":"oBUjNQCg0bsfvDGakCEsx2YSa7+84XHbeuLYM+n9K7Kk3kt8fx+CPyhPX8Naq1C91VLbyIlP877FJiDMDBwEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f113a949212e6d0bcb7d33b87ba88583eeb088ef5b34b3e59eae04e6b2cd902","last_reissued_at":"2026-05-18T03:26:09.694560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:09.694560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Three-Weight Message-Passing Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC","physics.comp-ph"],"primary_cat":"cs.AI","authors_text":"Jonathan S. Yedidia, Jos\\'e Bento, Nate Derbinsky, Veit Elser","submitted_at":"2013-05-08T21:24:14Z","abstract_excerpt":"We describe how the powerful \"Divide and Concur\" algorithm for constraint satisfaction can be derived as a special case of a message-passing version of the Alternating Direction Method of Multipliers (ADMM) algorithm for convex optimization, and introduce an improved message-passing algorithm based on ADMM/DC by introducing three distinct weights for messages, with \"certain\" and \"no opinion\" weights, as well as the standard weight used in ADMM/DC. The \"certain\" messages allow our improved algorithm to implement constraint propagation as a special case, while the \"no opinion\" messages speed con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1961","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":"1305.1961","created_at":"2026-05-18T03:26:09.694703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.1961v1","created_at":"2026-05-18T03:26:09.694703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1961","created_at":"2026-05-18T03:26:09.694703+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4ITVFESCLTN","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4ITVFESCLTNBPFX","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4ITVFES","created_at":"2026-05-18T12:27:59.945178+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/T4ITVFESCLTNBPFX2M5YPOUILA","json":"https://pith.science/pith/T4ITVFESCLTNBPFX2M5YPOUILA.json","graph_json":"https://pith.science/api/pith-number/T4ITVFESCLTNBPFX2M5YPOUILA/graph.json","events_json":"https://pith.science/api/pith-number/T4ITVFESCLTNBPFX2M5YPOUILA/events.json","paper":"https://pith.science/paper/T4ITVFES"},"agent_actions":{"view_html":"https://pith.science/pith/T4ITVFESCLTNBPFX2M5YPOUILA","download_json":"https://pith.science/pith/T4ITVFESCLTNBPFX2M5YPOUILA.json","view_paper":"https://pith.science/paper/T4ITVFES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.1961&json=true","fetch_graph":"https://pith.science/api/pith-number/T4ITVFESCLTNBPFX2M5YPOUILA/graph.json","fetch_events":"https://pith.science/api/pith-number/T4ITVFESCLTNBPFX2M5YPOUILA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4ITVFESCLTNBPFX2M5YPOUILA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4ITVFESCLTNBPFX2M5YPOUILA/action/storage_attestation","attest_author":"https://pith.science/pith/T4ITVFESCLTNBPFX2M5YPOUILA/action/author_attestation","sign_citation":"https://pith.science/pith/T4ITVFESCLTNBPFX2M5YPOUILA/action/citation_signature","submit_replication":"https://pith.science/pith/T4ITVFESCLTNBPFX2M5YPOUILA/action/replication_record"}},"created_at":"2026-05-18T03:26:09.694703+00:00","updated_at":"2026-05-18T03:26:09.694703+00:00"}