{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:76NKDSJLTXZWAUBZUKL7BUX3SE","short_pith_number":"pith:76NKDSJL","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"},"canonical_sha256":"ff9aa1c92b9df3605039a297f0d2fb912dfe901d964343e15cd8a73119b798e0","source":{"kind":"arxiv","id":"1510.07356","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07356","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07356v1","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07356","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"pith_short_12","alias_value":"76NKDSJLTXZW","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"76NKDSJLTXZWAUBZ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"76NKDSJL","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:76NKDSJLTXZWAUBZUKL7BUX3SE","target":"record","payload":{"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"},"canonical_sha256":"ff9aa1c92b9df3605039a297f0d2fb912dfe901d964343e15cd8a73119b798e0","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"},"source_kind":"arxiv","source_id":"1510.07356","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:25:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AAJehaHmRybNhIthYYECcXVl6zwV+w7uMaezHytb5y0cmMoqibm9sgzBvRlolAS63RB7mf5+eqicUy0OM+AeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:07:18.259526Z"},"content_sha256":"17fe2c8796b438d01cb350a42bc55df8969a46ff08808afd29a15c9503ddde73","schema_version":"1.0","event_id":"sha256:17fe2c8796b438d01cb350a42bc55df8969a46ff08808afd29a15c9503ddde73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:76NKDSJLTXZWAUBZUKL7BUX3SE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:25:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1N5gAaM5nA51aXCWRx5Y+9WZaT/DWa7c7Z980JXz9UW2RcLpip1KvkVX2oDS+0mjV2jl6w7DMxSICA4FxPSXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:07:18.259879Z"},"content_sha256":"9b47438fce0faf81918c932ca7f83b979daf92ca4b5f96cc3ce3054ef1e5b7c1","schema_version":"1.0","event_id":"sha256:9b47438fce0faf81918c932ca7f83b979daf92ca4b5f96cc3ce3054ef1e5b7c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76NKDSJLTXZWAUBZUKL7BUX3SE/bundle.json","state_url":"https://pith.science/pith/76NKDSJLTXZWAUBZUKL7BUX3SE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76NKDSJLTXZWAUBZUKL7BUX3SE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T03:07:18Z","links":{"resolver":"https://pith.science/pith/76NKDSJLTXZWAUBZUKL7BUX3SE","bundle":"https://pith.science/pith/76NKDSJLTXZWAUBZUKL7BUX3SE/bundle.json","state":"https://pith.science/pith/76NKDSJLTXZWAUBZUKL7BUX3SE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76NKDSJLTXZWAUBZUKL7BUX3SE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:76NKDSJLTXZWAUBZUKL7BUX3SE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"760259c0418777bf286122ba7396d9a4650711d4eb8dadfef9fde0553bc783a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-26T02:49:20Z","title_canon_sha256":"3ff7cd900fd5f644b9a5099e772c8369b955cf7e2b8f09823a918b61fd87ffe1"},"schema_version":"1.0","source":{"id":"1510.07356","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07356","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07356v1","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07356","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"pith_short_12","alias_value":"76NKDSJLTXZW","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"76NKDSJLTXZWAUBZ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"76NKDSJL","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:9b47438fce0faf81918c932ca7f83b979daf92ca4b5f96cc3ce3054ef1e5b7c1","target":"graph","created_at":"2026-05-18T01:25:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alejandro Ribeiro, Aryan Mokhtari, Qing Ling, Wei Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-26T02:49:20Z","title":"Decentralized Quadratically Approximated Alternating Direction Method of Multipliers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07356","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:17fe2c8796b438d01cb350a42bc55df8969a46ff08808afd29a15c9503ddde73","target":"record","created_at":"2026-05-18T01:25:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"760259c0418777bf286122ba7396d9a4650711d4eb8dadfef9fde0553bc783a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-26T02:49:20Z","title_canon_sha256":"3ff7cd900fd5f644b9a5099e772c8369b955cf7e2b8f09823a918b61fd87ffe1"},"schema_version":"1.0","source":{"id":"1510.07356","kind":"arxiv","version":1}},"canonical_sha256":"ff9aa1c92b9df3605039a297f0d2fb912dfe901d964343e15cd8a73119b798e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff9aa1c92b9df3605039a297f0d2fb912dfe901d964343e15cd8a73119b798e0","first_computed_at":"2026-05-18T01:25:56.943423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:56.943423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nC6+OUyUL1bbRNVF74CTrNeiu3GxMGHkJPvHIS3gyffHqruIqLDbhyLLYiWJceaZigQwhpfGbh9GJ2OuOxRiCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:56.944011Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07356","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17fe2c8796b438d01cb350a42bc55df8969a46ff08808afd29a15c9503ddde73","sha256:9b47438fce0faf81918c932ca7f83b979daf92ca4b5f96cc3ce3054ef1e5b7c1"],"state_sha256":"41373dcb004ed03c7b7dd9b246f35f6c773126fcac1dae59cff6f70b471cd3ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LBHaHmvcIDkdpiFyivD+NpZWE4V/bPWvj7FADYgTn2ahP4JxZhFbbrq0nKvRznYcIajJHp1/42HLTLynQOqRCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:07:18.261905Z","bundle_sha256":"a25ed6a91686880694b8388e26085652cc93682464994b138c4a8c6ed1ff30fb"}}