{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QSXC5XZX4JVSPIWBGONYDF3ZIR","short_pith_number":"pith:QSXC5XZX","canonical_record":{"source":{"id":"1202.2805","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-02-13T18:01:59Z","cross_cats_sorted":[],"title_canon_sha256":"81750094a323319c1a420a60caaa35e53fec458a23d506e72d429afb400fc610","abstract_canon_sha256":"f28f591052955a36e330efcbf3d090832f13850f5fe74fde915d5e7b1845732c"},"schema_version":"1.0"},"canonical_sha256":"84ae2edf37e26b27a2c1339b8197794468396bb8e21cf71659901dc81a420e91","source":{"kind":"arxiv","id":"1202.2805","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2805","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2805v2","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2805","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"pith_short_12","alias_value":"QSXC5XZX4JVS","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QSXC5XZX4JVSPIWB","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QSXC5XZX","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QSXC5XZX4JVSPIWBGONYDF3ZIR","target":"record","payload":{"canonical_record":{"source":{"id":"1202.2805","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-02-13T18:01:59Z","cross_cats_sorted":[],"title_canon_sha256":"81750094a323319c1a420a60caaa35e53fec458a23d506e72d429afb400fc610","abstract_canon_sha256":"f28f591052955a36e330efcbf3d090832f13850f5fe74fde915d5e7b1845732c"},"schema_version":"1.0"},"canonical_sha256":"84ae2edf37e26b27a2c1339b8197794468396bb8e21cf71659901dc81a420e91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:11.519684Z","signature_b64":"I/3JcNUbNnohRKZrKt3aftq3YtpVB9Fvsijvh+AJqsqkTWdKA+wlNUMI4LltHTNjPTjQyV/me6JEyHKGMzx5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84ae2edf37e26b27a2c1339b8197794468396bb8e21cf71659901dc81a420e91","last_reissued_at":"2026-05-18T03:27:11.519087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:11.519087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.2805","source_version":2,"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-18T03:27:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Hj/gzEWa2E06Y7eQu3vtQnEHLgz6DokHkqmqwpvf9T/sjf+9mZsvrhPPWo6+xNEGCgL6UAnHJDEbARXs7OlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:36:47.307475Z"},"content_sha256":"8d4152b897107331d7a00c5a8a06f1f159aeb06ddea2d0ffc25a70c4c8e7b44f","schema_version":"1.0","event_id":"sha256:8d4152b897107331d7a00c5a8a06f1f159aeb06ddea2d0ffc25a70c4c8e7b44f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QSXC5XZX4JVSPIWBGONYDF3ZIR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"D-ADMM: A Communication-Efficient Distributed Algorithm For Separable Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jo\\~ao F. C. Mota, Jo\\~ao M. F. Xavier, Markus P\\\"uschel, Pedro M. Q. Aguiar","submitted_at":"2012-02-13T18:01:59Z","abstract_excerpt":"We propose a distributed algorithm, named Distributed Alternating Direction Method of Multipliers (D-ADMM), for solving separable optimization problems in networks of interconnected nodes or agents. In a separable optimization problem there is a private cost function and a private constraint set at each node. The goal is to minimize the sum of all the cost functions, constraining the solution to be in the intersection of all the constraint sets. D-ADMM is proven to converge when the network is bipartite or when all the functions are strongly convex, although in practice, convergence is observe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2805","kind":"arxiv","version":2},"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-18T03:27:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"us5w4X86pIPENQcjyBQCAgBTR3mAK2hdULCVYVeWqkvWPG28tO+XnaBlUxSmqelGVAIlgYjN1a8T0ISGJ+EiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:36:47.308050Z"},"content_sha256":"22f3b5f2b27de4aee901abffa0165a5641bda82b5f9bfaea4a0100f9c07291ca","schema_version":"1.0","event_id":"sha256:22f3b5f2b27de4aee901abffa0165a5641bda82b5f9bfaea4a0100f9c07291ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSXC5XZX4JVSPIWBGONYDF3ZIR/bundle.json","state_url":"https://pith.science/pith/QSXC5XZX4JVSPIWBGONYDF3ZIR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSXC5XZX4JVSPIWBGONYDF3ZIR/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-06-07T05:36:47Z","links":{"resolver":"https://pith.science/pith/QSXC5XZX4JVSPIWBGONYDF3ZIR","bundle":"https://pith.science/pith/QSXC5XZX4JVSPIWBGONYDF3ZIR/bundle.json","state":"https://pith.science/pith/QSXC5XZX4JVSPIWBGONYDF3ZIR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSXC5XZX4JVSPIWBGONYDF3ZIR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QSXC5XZX4JVSPIWBGONYDF3ZIR","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":"f28f591052955a36e330efcbf3d090832f13850f5fe74fde915d5e7b1845732c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-02-13T18:01:59Z","title_canon_sha256":"81750094a323319c1a420a60caaa35e53fec458a23d506e72d429afb400fc610"},"schema_version":"1.0","source":{"id":"1202.2805","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2805","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2805v2","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2805","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"pith_short_12","alias_value":"QSXC5XZX4JVS","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QSXC5XZX4JVSPIWB","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QSXC5XZX","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:22f3b5f2b27de4aee901abffa0165a5641bda82b5f9bfaea4a0100f9c07291ca","target":"graph","created_at":"2026-05-18T03:27:11Z","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":"We propose a distributed algorithm, named Distributed Alternating Direction Method of Multipliers (D-ADMM), for solving separable optimization problems in networks of interconnected nodes or agents. In a separable optimization problem there is a private cost function and a private constraint set at each node. The goal is to minimize the sum of all the cost functions, constraining the solution to be in the intersection of all the constraint sets. D-ADMM is proven to converge when the network is bipartite or when all the functions are strongly convex, although in practice, convergence is observe","authors_text":"Jo\\~ao F. C. Mota, Jo\\~ao M. F. Xavier, Markus P\\\"uschel, Pedro M. Q. Aguiar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-02-13T18:01:59Z","title":"D-ADMM: A Communication-Efficient Distributed Algorithm For Separable Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2805","kind":"arxiv","version":2},"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:8d4152b897107331d7a00c5a8a06f1f159aeb06ddea2d0ffc25a70c4c8e7b44f","target":"record","created_at":"2026-05-18T03:27:11Z","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":"f28f591052955a36e330efcbf3d090832f13850f5fe74fde915d5e7b1845732c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-02-13T18:01:59Z","title_canon_sha256":"81750094a323319c1a420a60caaa35e53fec458a23d506e72d429afb400fc610"},"schema_version":"1.0","source":{"id":"1202.2805","kind":"arxiv","version":2}},"canonical_sha256":"84ae2edf37e26b27a2c1339b8197794468396bb8e21cf71659901dc81a420e91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84ae2edf37e26b27a2c1339b8197794468396bb8e21cf71659901dc81a420e91","first_computed_at":"2026-05-18T03:27:11.519087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:11.519087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I/3JcNUbNnohRKZrKt3aftq3YtpVB9Fvsijvh+AJqsqkTWdKA+wlNUMI4LltHTNjPTjQyV/me6JEyHKGMzx5CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:11.519684Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.2805","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d4152b897107331d7a00c5a8a06f1f159aeb06ddea2d0ffc25a70c4c8e7b44f","sha256:22f3b5f2b27de4aee901abffa0165a5641bda82b5f9bfaea4a0100f9c07291ca"],"state_sha256":"1597e21b906a25f51aefef6d74e53c42fd1da6f24d8e629a7c50fd85643ead15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fiCGtzrZGff6VPahF+L6fPABFEGjNgUqnQUCxJbNTaP2nYk+mwW3letpp+aDGRTP/nB4Mq21mE92WdPnr8f+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T05:36:47.311555Z","bundle_sha256":"be30993ec21d63687da1c1a082ee2492e16bf6b41522d39d7742b57f5eca3c60"}}