{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FJMGFIEMUNYIZCNYHIPMMNBF35","short_pith_number":"pith:FJMGFIEM","canonical_record":{"source":{"id":"1510.08736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-29T15:26:35Z","cross_cats_sorted":[],"title_canon_sha256":"5e6f3a7d6f00f567b1789aee2052da4a9ed372249bd03cbb1ce5124f5b4ee2f5","abstract_canon_sha256":"d85326f33de4a5111e47087eac944603d3cfb3f2d2f66f32adc292dd09299faa"},"schema_version":"1.0"},"canonical_sha256":"2a5862a08ca3708c89b83a1ec63425df4a11b43c299fb47d1bd6fbbc99b39a1d","source":{"kind":"arxiv","id":"1510.08736","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08736","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08736v1","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08736","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"FJMGFIEMUNYI","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FJMGFIEMUNYIZCNY","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FJMGFIEM","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FJMGFIEMUNYIZCNYHIPMMNBF35","target":"record","payload":{"canonical_record":{"source":{"id":"1510.08736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-29T15:26:35Z","cross_cats_sorted":[],"title_canon_sha256":"5e6f3a7d6f00f567b1789aee2052da4a9ed372249bd03cbb1ce5124f5b4ee2f5","abstract_canon_sha256":"d85326f33de4a5111e47087eac944603d3cfb3f2d2f66f32adc292dd09299faa"},"schema_version":"1.0"},"canonical_sha256":"2a5862a08ca3708c89b83a1ec63425df4a11b43c299fb47d1bd6fbbc99b39a1d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:34.679695Z","signature_b64":"Vr4r6JtdCIS621q2JV8mMwUNfEAWknc2/DvvnRP8v8+M5tsHFQOU0UHlHgUx7yxkVjTeFbHogTRHzEU9aCcDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a5862a08ca3708c89b83a1ec63425df4a11b43c299fb47d1bd6fbbc99b39a1d","last_reissued_at":"2026-05-18T00:58:34.678996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:34.678996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.08736","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:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"68kTAEro7aA7ab3M2b0IpTzWvAsN0tuFrDb+j54+pbC9KUX0pYw2hZblvAUQH6Mq3PVhDF8nshwbW8nhFyUvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:22:08.387249Z"},"content_sha256":"b59f5855ce56ffdcaf06bc548be4bb0ccc522b348d38f25c50b3a0ea4b581cc3","schema_version":"1.0","event_id":"sha256:b59f5855ce56ffdcaf06bc548be4bb0ccc522b348d38f25c50b3a0ea4b581cc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FJMGFIEMUNYIZCNYHIPMMNBF35","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantized Consensus ADMM for Multi-Agent Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Biao Chen, Mingyi Hong, Shengyu Zhu","submitted_at":"2015-10-29T15:26:35Z","abstract_excerpt":"Multi-agent distributed optimization over a network minimizes a global objective formed by a sum of local convex functions using only local computation and communication. We develop and analyze a quantized distributed algorithm based on the alternating direction method of multipliers (ADMM) when inter-agent communications are subject to finite capacity and other practical constraints. While existing quantized ADMM approaches only work for quadratic local objectives, the proposed algorithm can deal with more general objective functions (possibly non-smooth) including the LASSO. Under certain co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08736","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:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PZjkIfdFkdkq2TSPPN4yQL2awZYx3pZuQlO89dKCKOU72OdHwQDm7GI3MOeI9+3mt9llHGDxFxJwgzPGyEk7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:22:08.387608Z"},"content_sha256":"131313822d01f0c4828b0363c0efea1fbc1201db6893c646f39fb1d29f0511a9","schema_version":"1.0","event_id":"sha256:131313822d01f0c4828b0363c0efea1fbc1201db6893c646f39fb1d29f0511a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJMGFIEMUNYIZCNYHIPMMNBF35/bundle.json","state_url":"https://pith.science/pith/FJMGFIEMUNYIZCNYHIPMMNBF35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJMGFIEMUNYIZCNYHIPMMNBF35/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-09T16:22:08Z","links":{"resolver":"https://pith.science/pith/FJMGFIEMUNYIZCNYHIPMMNBF35","bundle":"https://pith.science/pith/FJMGFIEMUNYIZCNYHIPMMNBF35/bundle.json","state":"https://pith.science/pith/FJMGFIEMUNYIZCNYHIPMMNBF35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJMGFIEMUNYIZCNYHIPMMNBF35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FJMGFIEMUNYIZCNYHIPMMNBF35","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":"d85326f33de4a5111e47087eac944603d3cfb3f2d2f66f32adc292dd09299faa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-29T15:26:35Z","title_canon_sha256":"5e6f3a7d6f00f567b1789aee2052da4a9ed372249bd03cbb1ce5124f5b4ee2f5"},"schema_version":"1.0","source":{"id":"1510.08736","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08736","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08736v1","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08736","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"FJMGFIEMUNYI","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FJMGFIEMUNYIZCNY","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FJMGFIEM","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:131313822d01f0c4828b0363c0efea1fbc1201db6893c646f39fb1d29f0511a9","target":"graph","created_at":"2026-05-18T00:58:34Z","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":"Multi-agent distributed optimization over a network minimizes a global objective formed by a sum of local convex functions using only local computation and communication. We develop and analyze a quantized distributed algorithm based on the alternating direction method of multipliers (ADMM) when inter-agent communications are subject to finite capacity and other practical constraints. While existing quantized ADMM approaches only work for quadratic local objectives, the proposed algorithm can deal with more general objective functions (possibly non-smooth) including the LASSO. Under certain co","authors_text":"Biao Chen, Mingyi Hong, Shengyu Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-29T15:26:35Z","title":"Quantized Consensus ADMM for Multi-Agent Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08736","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:b59f5855ce56ffdcaf06bc548be4bb0ccc522b348d38f25c50b3a0ea4b581cc3","target":"record","created_at":"2026-05-18T00:58:34Z","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":"d85326f33de4a5111e47087eac944603d3cfb3f2d2f66f32adc292dd09299faa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-29T15:26:35Z","title_canon_sha256":"5e6f3a7d6f00f567b1789aee2052da4a9ed372249bd03cbb1ce5124f5b4ee2f5"},"schema_version":"1.0","source":{"id":"1510.08736","kind":"arxiv","version":1}},"canonical_sha256":"2a5862a08ca3708c89b83a1ec63425df4a11b43c299fb47d1bd6fbbc99b39a1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a5862a08ca3708c89b83a1ec63425df4a11b43c299fb47d1bd6fbbc99b39a1d","first_computed_at":"2026-05-18T00:58:34.678996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:34.678996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vr4r6JtdCIS621q2JV8mMwUNfEAWknc2/DvvnRP8v8+M5tsHFQOU0UHlHgUx7yxkVjTeFbHogTRHzEU9aCcDBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:34.679695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.08736","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b59f5855ce56ffdcaf06bc548be4bb0ccc522b348d38f25c50b3a0ea4b581cc3","sha256:131313822d01f0c4828b0363c0efea1fbc1201db6893c646f39fb1d29f0511a9"],"state_sha256":"1480abb2f99f9cfe1cf3fed6dd926db0eb29ca59cece6fd6c6ca755310fb2309"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZVzB31ZGQu2rZF14ZORxYSBLI9sM3w39HQErlXLmgyPbUKuN7MCCL/1nzeP9dmbTH9nt+iKtjqaIFP5qEh5ABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:22:08.389570Z","bundle_sha256":"75b4fdb83856dad916568dee565ed88a23d02463a33e3b196bb15223e3df4296"}}