{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:K6YFICD3QC572TJB2XKO52C2ZT","short_pith_number":"pith:K6YFICD3","canonical_record":{"source":{"id":"1809.01346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-05T06:21:42Z","cross_cats_sorted":[],"title_canon_sha256":"52964c34b8dfbf42b6d5c0a1638dca4404fe70bb5632f0ac09ec23449a0862f9","abstract_canon_sha256":"70fe5e293656f965c74a79171c006745ec58f8582fd5a300c54cfc8e307979e7"},"schema_version":"1.0"},"canonical_sha256":"57b054087b80bbfd4d21d5d4eee85acce4fa4bc1f690d72e1a2c8b1ae1c668a3","source":{"kind":"arxiv","id":"1809.01346","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01346","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01346v1","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01346","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"pith_short_12","alias_value":"K6YFICD3QC57","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K6YFICD3QC572TJB","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K6YFICD3","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:K6YFICD3QC572TJB2XKO52C2ZT","target":"record","payload":{"canonical_record":{"source":{"id":"1809.01346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-05T06:21:42Z","cross_cats_sorted":[],"title_canon_sha256":"52964c34b8dfbf42b6d5c0a1638dca4404fe70bb5632f0ac09ec23449a0862f9","abstract_canon_sha256":"70fe5e293656f965c74a79171c006745ec58f8582fd5a300c54cfc8e307979e7"},"schema_version":"1.0"},"canonical_sha256":"57b054087b80bbfd4d21d5d4eee85acce4fa4bc1f690d72e1a2c8b1ae1c668a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:27.913204Z","signature_b64":"rnclpPeNfIjnFUnOex0BVHmC1mDBJiD2mKp30+sCC2OPYudd//LXToUJ2Ius2mUwUjyZNnWmeBa9rE8dPieFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57b054087b80bbfd4d21d5d4eee85acce4fa4bc1f690d72e1a2c8b1ae1c668a3","last_reissued_at":"2026-05-18T00:06:27.912639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:27.912639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.01346","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:06:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pz2O80nBsk8ojMAzdfaTxV/Zi5UG5ymOFtEjE6z++TrSRVcMluWRiHbe4O82uid3vBESX/tR+t6EcPz2ONZACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:06:44.881519Z"},"content_sha256":"914955c54c3e98fced57fe4d41dec5002da788b3bc97f8edde2679acfb1e0d01","schema_version":"1.0","event_id":"sha256:914955c54c3e98fced57fe4d41dec5002da788b3bc97f8edde2679acfb1e0d01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:K6YFICD3QC572TJB2XKO52C2ZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proximal-Free ADMM for Decentralized Composite Optimization via Graph Simplification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bin Wang, Hongbin Li, Huiping Duan, Jun Fang","submitted_at":"2018-09-05T06:21:42Z","abstract_excerpt":"We consider the problem of decentralized composite optimization over a symmetric connected graph, in which each node holds its own agent-specific private convex functions, and communications are only allowed between nodes with direct links. A variety of algorithms have been proposed to solve such a problem in an alternating direction method of multiplier (ADMM) framework. Many of these algorithms, however, need to include some proximal term in the augmented Lagrangian function such that the resulting algorithm can be implemented in a decentralized manner. The use of the proximal term slows dow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01346","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:06:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"upEx5uasulrsRkt/d8/kDl5szIpWv8SyME63oyjbXIB20AAxPx5PM1+L2qN2VRUhUQCGp/WCzU813+l72WooCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:06:44.881926Z"},"content_sha256":"f72df9c824bc571c3af102581ed8f4bfc317de9cda2ae1c992ffab0d81363d5f","schema_version":"1.0","event_id":"sha256:f72df9c824bc571c3af102581ed8f4bfc317de9cda2ae1c992ffab0d81363d5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K6YFICD3QC572TJB2XKO52C2ZT/bundle.json","state_url":"https://pith.science/pith/K6YFICD3QC572TJB2XKO52C2ZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K6YFICD3QC572TJB2XKO52C2ZT/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-25T08:06:44Z","links":{"resolver":"https://pith.science/pith/K6YFICD3QC572TJB2XKO52C2ZT","bundle":"https://pith.science/pith/K6YFICD3QC572TJB2XKO52C2ZT/bundle.json","state":"https://pith.science/pith/K6YFICD3QC572TJB2XKO52C2ZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K6YFICD3QC572TJB2XKO52C2ZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:K6YFICD3QC572TJB2XKO52C2ZT","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":"70fe5e293656f965c74a79171c006745ec58f8582fd5a300c54cfc8e307979e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-05T06:21:42Z","title_canon_sha256":"52964c34b8dfbf42b6d5c0a1638dca4404fe70bb5632f0ac09ec23449a0862f9"},"schema_version":"1.0","source":{"id":"1809.01346","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01346","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01346v1","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01346","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"pith_short_12","alias_value":"K6YFICD3QC57","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K6YFICD3QC572TJB","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K6YFICD3","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:f72df9c824bc571c3af102581ed8f4bfc317de9cda2ae1c992ffab0d81363d5f","target":"graph","created_at":"2026-05-18T00:06:27Z","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 consider the problem of decentralized composite optimization over a symmetric connected graph, in which each node holds its own agent-specific private convex functions, and communications are only allowed between nodes with direct links. A variety of algorithms have been proposed to solve such a problem in an alternating direction method of multiplier (ADMM) framework. Many of these algorithms, however, need to include some proximal term in the augmented Lagrangian function such that the resulting algorithm can be implemented in a decentralized manner. The use of the proximal term slows dow","authors_text":"Bin Wang, Hongbin Li, Huiping Duan, Jun Fang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-05T06:21:42Z","title":"Proximal-Free ADMM for Decentralized Composite Optimization via Graph Simplification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01346","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:914955c54c3e98fced57fe4d41dec5002da788b3bc97f8edde2679acfb1e0d01","target":"record","created_at":"2026-05-18T00:06:27Z","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":"70fe5e293656f965c74a79171c006745ec58f8582fd5a300c54cfc8e307979e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-05T06:21:42Z","title_canon_sha256":"52964c34b8dfbf42b6d5c0a1638dca4404fe70bb5632f0ac09ec23449a0862f9"},"schema_version":"1.0","source":{"id":"1809.01346","kind":"arxiv","version":1}},"canonical_sha256":"57b054087b80bbfd4d21d5d4eee85acce4fa4bc1f690d72e1a2c8b1ae1c668a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57b054087b80bbfd4d21d5d4eee85acce4fa4bc1f690d72e1a2c8b1ae1c668a3","first_computed_at":"2026-05-18T00:06:27.912639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:27.912639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rnclpPeNfIjnFUnOex0BVHmC1mDBJiD2mKp30+sCC2OPYudd//LXToUJ2Ius2mUwUjyZNnWmeBa9rE8dPieFCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:27.913204Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.01346","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:914955c54c3e98fced57fe4d41dec5002da788b3bc97f8edde2679acfb1e0d01","sha256:f72df9c824bc571c3af102581ed8f4bfc317de9cda2ae1c992ffab0d81363d5f"],"state_sha256":"145744333533f6446f32cf64b6366ce571d77b8b7c55454cb38416b46d1442d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Ej5ekBdtWB0V+1Z90QshgQviZqzvROVuCuYUd9r7J7NoBVuFNHuhmGqVB+zZU8H3J61/TvVUWX1IYyT1qOxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:06:44.884560Z","bundle_sha256":"f3a9789b2305fab01761670eacee4cbe8ceb49bae1ca934bea766e93b34fbefb"}}