{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:76NKDSJLTXZWAUBZUKL7BUX3SE","short_pith_number":"pith:76NKDSJL","schema_version":"1.0","canonical_sha256":"ff9aa1c92b9df3605039a297f0d2fb912dfe901d964343e15cd8a73119b798e0","source":{"kind":"arxiv","id":"1510.07356","version":1},"attestation_state":"computed","paper":{"title":"Decentralized Quadratically Approximated Alternating Direction Method of Multipliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alejandro Ribeiro, Aryan Mokhtari, Qing Ling, Wei Shi","submitted_at":"2015-10-26T02:49:20Z","abstract_excerpt":"This paper considers an optimization problem that components of the objective function are available at different nodes of a network and nodes are allowed to only exchange information with their neighbors. The decentralized alternating method of multipliers (DADMM) is a well-established iterative method for solving this category of problems; however, implementation of DADMM requires solving an optimization subproblem at each iteration for each node. This procedure is often computationally costly for the nodes. We introduce a decentralized quadratic approximation of ADMM (DQM) that reduces comp"},"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":"1510.07356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-26T02:49:20Z","cross_cats_sorted":[],"title_canon_sha256":"3ff7cd900fd5f644b9a5099e772c8369b955cf7e2b8f09823a918b61fd87ffe1","abstract_canon_sha256":"760259c0418777bf286122ba7396d9a4650711d4eb8dadfef9fde0553bc783a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:56.944011Z","signature_b64":"nC6+OUyUL1bbRNVF74CTrNeiu3GxMGHkJPvHIS3gyffHqruIqLDbhyLLYiWJceaZigQwhpfGbh9GJ2OuOxRiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff9aa1c92b9df3605039a297f0d2fb912dfe901d964343e15cd8a73119b798e0","last_reissued_at":"2026-05-18T01:25:56.943423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:56.943423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized Quadratically Approximated Alternating Direction Method of Multipliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alejandro Ribeiro, Aryan Mokhtari, Qing Ling, Wei Shi","submitted_at":"2015-10-26T02:49:20Z","abstract_excerpt":"This paper considers an optimization problem that components of the objective function are available at different nodes of a network and nodes are allowed to only exchange information with their neighbors. The decentralized alternating method of multipliers (DADMM) is a well-established iterative method for solving this category of problems; however, implementation of DADMM requires solving an optimization subproblem at each iteration for each node. This procedure is often computationally costly for the nodes. We introduce a decentralized quadratic approximation of ADMM (DQM) that reduces comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07356","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":"1510.07356","created_at":"2026-05-18T01:25:56.943514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.07356v1","created_at":"2026-05-18T01:25:56.943514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07356","created_at":"2026-05-18T01:25:56.943514+00:00"},{"alias_kind":"pith_short_12","alias_value":"76NKDSJLTXZW","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"76NKDSJLTXZWAUBZ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"76NKDSJL","created_at":"2026-05-18T12:29:07.941421+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/76NKDSJLTXZWAUBZUKL7BUX3SE","json":"https://pith.science/pith/76NKDSJLTXZWAUBZUKL7BUX3SE.json","graph_json":"https://pith.science/api/pith-number/76NKDSJLTXZWAUBZUKL7BUX3SE/graph.json","events_json":"https://pith.science/api/pith-number/76NKDSJLTXZWAUBZUKL7BUX3SE/events.json","paper":"https://pith.science/paper/76NKDSJL"},"agent_actions":{"view_html":"https://pith.science/pith/76NKDSJLTXZWAUBZUKL7BUX3SE","download_json":"https://pith.science/pith/76NKDSJLTXZWAUBZUKL7BUX3SE.json","view_paper":"https://pith.science/paper/76NKDSJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.07356&json=true","fetch_graph":"https://pith.science/api/pith-number/76NKDSJLTXZWAUBZUKL7BUX3SE/graph.json","fetch_events":"https://pith.science/api/pith-number/76NKDSJLTXZWAUBZUKL7BUX3SE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76NKDSJLTXZWAUBZUKL7BUX3SE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76NKDSJLTXZWAUBZUKL7BUX3SE/action/storage_attestation","attest_author":"https://pith.science/pith/76NKDSJLTXZWAUBZUKL7BUX3SE/action/author_attestation","sign_citation":"https://pith.science/pith/76NKDSJLTXZWAUBZUKL7BUX3SE/action/citation_signature","submit_replication":"https://pith.science/pith/76NKDSJLTXZWAUBZUKL7BUX3SE/action/replication_record"}},"created_at":"2026-05-18T01:25:56.943514+00:00","updated_at":"2026-05-18T01:25:56.943514+00:00"}