{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2L65ZNSAVJMLLHIKMQRZAKV4OQ","short_pith_number":"pith:2L65ZNSA","canonical_record":{"source":{"id":"1409.3307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-11T03:18:18Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1c4114d23d328a30bf07fca0e7e96e4258e66cd1b07a8cce243b55a116910626","abstract_canon_sha256":"9155a964d4ed5d95bb83257137df3a71839641d512252d249174a9ae2fa138d9"},"schema_version":"1.0"},"canonical_sha256":"d2fddcb640aa58b59d0a6423902abc7434c124b0296c94dac81850e928150978","source":{"kind":"arxiv","id":"1409.3307","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3307","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3307v1","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3307","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"pith_short_12","alias_value":"2L65ZNSAVJML","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2L65ZNSAVJMLLHIK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2L65ZNSA","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2L65ZNSAVJMLLHIKMQRZAKV4OQ","target":"record","payload":{"canonical_record":{"source":{"id":"1409.3307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-11T03:18:18Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1c4114d23d328a30bf07fca0e7e96e4258e66cd1b07a8cce243b55a116910626","abstract_canon_sha256":"9155a964d4ed5d95bb83257137df3a71839641d512252d249174a9ae2fa138d9"},"schema_version":"1.0"},"canonical_sha256":"d2fddcb640aa58b59d0a6423902abc7434c124b0296c94dac81850e928150978","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:02.604379Z","signature_b64":"354TwFXd97YtdFRmGV3ljjNxatDI51kyKWAKk57KbaHDqXiICOXRhAIJBmrQxF4YzSxF5x8Ibo8lM8v0vcNhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2fddcb640aa58b59d0a6423902abc7434c124b0296c94dac81850e928150978","last_reissued_at":"2026-05-18T00:59:02.603640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:02.603640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.3307","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-18T00:59:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sVxQKdrNOuOU7ZKZkcnWc+mFiLJDC3rjf5O0Q+v1mYLRDd893h9CzkLSkj/w6wtIoe1LWoEKCiPHwSxj20u2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:56:34.381652Z"},"content_sha256":"f912d25c11fe4be7c4f90a7e8abf7cd96e27d3094ee58e0afcb955dcfa5bd248","schema_version":"1.0","event_id":"sha256:f912d25c11fe4be7c4f90a7e8abf7cd96e27d3094ee58e0afcb955dcfa5bd248"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2L65ZNSAVJMLLHIKMQRZAKV4OQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Tsung-Hui Chang","submitted_at":"2014-09-11T03:18:18Z","abstract_excerpt":"This paper studies efficient distributed optimization methods for multi-agent networks. Specifically, we consider a convex optimization problem with a globally coupled linear equality constraint and local polyhedra constraints, and develop distributed optimization methods based on the alternating direction method of multipliers (ADMM). The considered problem has many applications in machine learning and smart grid control problems. Due to the presence of the polyhedra constraints, agents in the existing methods have to deal with polyhedra constrained subproblems at each iteration. One of the k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3307","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-18T00:59:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CRzmTU0XYp2SBDGZtp95oh9eu+wqYKMvy+WCiPFj/OJkv6trF41uVr64Tys9WWpJZZZeahpD/NWdWrVZ2iafDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:56:34.382050Z"},"content_sha256":"96d1b00fb45c6d746c53e97e94a4ec0c62edd5df093e70a2bbf062cf6a8a7a05","schema_version":"1.0","event_id":"sha256:96d1b00fb45c6d746c53e97e94a4ec0c62edd5df093e70a2bbf062cf6a8a7a05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2L65ZNSAVJMLLHIKMQRZAKV4OQ/bundle.json","state_url":"https://pith.science/pith/2L65ZNSAVJMLLHIKMQRZAKV4OQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2L65ZNSAVJMLLHIKMQRZAKV4OQ/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-27T11:56:34Z","links":{"resolver":"https://pith.science/pith/2L65ZNSAVJMLLHIKMQRZAKV4OQ","bundle":"https://pith.science/pith/2L65ZNSAVJMLLHIKMQRZAKV4OQ/bundle.json","state":"https://pith.science/pith/2L65ZNSAVJMLLHIKMQRZAKV4OQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2L65ZNSAVJMLLHIKMQRZAKV4OQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2L65ZNSAVJMLLHIKMQRZAKV4OQ","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":"9155a964d4ed5d95bb83257137df3a71839641d512252d249174a9ae2fa138d9","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-11T03:18:18Z","title_canon_sha256":"1c4114d23d328a30bf07fca0e7e96e4258e66cd1b07a8cce243b55a116910626"},"schema_version":"1.0","source":{"id":"1409.3307","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3307","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3307v1","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3307","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"pith_short_12","alias_value":"2L65ZNSAVJML","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2L65ZNSAVJMLLHIK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2L65ZNSA","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:96d1b00fb45c6d746c53e97e94a4ec0c62edd5df093e70a2bbf062cf6a8a7a05","target":"graph","created_at":"2026-05-18T00:59:02Z","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 studies efficient distributed optimization methods for multi-agent networks. Specifically, we consider a convex optimization problem with a globally coupled linear equality constraint and local polyhedra constraints, and develop distributed optimization methods based on the alternating direction method of multipliers (ADMM). The considered problem has many applications in machine learning and smart grid control problems. Due to the presence of the polyhedra constraints, agents in the existing methods have to deal with polyhedra constrained subproblems at each iteration. One of the k","authors_text":"Tsung-Hui Chang","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-11T03:18:18Z","title":"A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3307","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:f912d25c11fe4be7c4f90a7e8abf7cd96e27d3094ee58e0afcb955dcfa5bd248","target":"record","created_at":"2026-05-18T00:59:02Z","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":"9155a964d4ed5d95bb83257137df3a71839641d512252d249174a9ae2fa138d9","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-11T03:18:18Z","title_canon_sha256":"1c4114d23d328a30bf07fca0e7e96e4258e66cd1b07a8cce243b55a116910626"},"schema_version":"1.0","source":{"id":"1409.3307","kind":"arxiv","version":1}},"canonical_sha256":"d2fddcb640aa58b59d0a6423902abc7434c124b0296c94dac81850e928150978","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2fddcb640aa58b59d0a6423902abc7434c124b0296c94dac81850e928150978","first_computed_at":"2026-05-18T00:59:02.603640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:02.603640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"354TwFXd97YtdFRmGV3ljjNxatDI51kyKWAKk57KbaHDqXiICOXRhAIJBmrQxF4YzSxF5x8Ibo8lM8v0vcNhAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:02.604379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3307","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f912d25c11fe4be7c4f90a7e8abf7cd96e27d3094ee58e0afcb955dcfa5bd248","sha256:96d1b00fb45c6d746c53e97e94a4ec0c62edd5df093e70a2bbf062cf6a8a7a05"],"state_sha256":"549b8d49b8d7470579d2cf8a38c4743091337da6653ef5d6d9733225d9ddee70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vT3wblsfq6qV2dYaC6u/yyHSqvoUT0uAD0VIZkMx1j92B+l72/NKP9AinqiLBxNDREGNv1he/0NIugODd2E8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:56:34.384421Z","bundle_sha256":"61cb99539c4a296936a54be98d13fed5b7615761f87ae5642fcf31f89b44f893"}}