{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BAG56X6LV37RJWLNZT72DL5HDF","short_pith_number":"pith:BAG56X6L","canonical_record":{"source":{"id":"1601.00194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-02T17:37:58Z","cross_cats_sorted":[],"title_canon_sha256":"5f9167284e209aa5bf81538317cad2238fc8f8548bcd893e27b010c3c50eeeab","abstract_canon_sha256":"4c37228609b9db5a8e9b7fb10ab7d7c0315f73f6c13e0a34496c90f05dccc4e6"},"schema_version":"1.0"},"canonical_sha256":"080ddf5fcbaeff14d96dccffa1afa71946fb6b67a8971cdfaaaa72a39c7e177d","source":{"kind":"arxiv","id":"1601.00194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00194","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00194v1","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00194","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"pith_short_12","alias_value":"BAG56X6LV37R","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BAG56X6LV37RJWLN","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BAG56X6L","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BAG56X6LV37RJWLNZT72DL5HDF","target":"record","payload":{"canonical_record":{"source":{"id":"1601.00194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-02T17:37:58Z","cross_cats_sorted":[],"title_canon_sha256":"5f9167284e209aa5bf81538317cad2238fc8f8548bcd893e27b010c3c50eeeab","abstract_canon_sha256":"4c37228609b9db5a8e9b7fb10ab7d7c0315f73f6c13e0a34496c90f05dccc4e6"},"schema_version":"1.0"},"canonical_sha256":"080ddf5fcbaeff14d96dccffa1afa71946fb6b67a8971cdfaaaa72a39c7e177d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:28.254090Z","signature_b64":"L6z39DfdDE8XZvHW1PCcB7BNC9FsRgoCUTsurBnFbA0KCP+S9ocj253ZRu9+K5XLBZ7BzyZ2IIF8myVKmUshDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"080ddf5fcbaeff14d96dccffa1afa71946fb6b67a8971cdfaaaa72a39c7e177d","last_reissued_at":"2026-05-18T01:23:28.253341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:28.253341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.00194","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:23:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l72X20czBPBxN/UnGC9Bo9enDqPA1Fwu0mibq8QNcfwMGZcFolZkVjvP8wrASIDyL6/x0ej6eUQOKxY5kWCbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:09:32.612500Z"},"content_sha256":"4bf387325d48ae2057742a7fbe6f21d5306f3a359cbc5176b6e7aa3ee9ba523d","schema_version":"1.0","event_id":"sha256:4bf387325d48ae2057742a7fbe6f21d5306f3a359cbc5176b6e7aa3ee9ba523d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BAG56X6LV37RJWLNZT72DL5HDF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence Rate of Distributed ADMM over Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Makhdoumi, Asuman Ozdaglar","submitted_at":"2016-01-02T17:37:58Z","abstract_excerpt":"We propose a distributed algorithm based on Alternating Direction Method of Multipliers (ADMM) to minimize the sum of locally known convex functions using communication over a network. This optimization problem emerges in many applications in distributed machine learning and statistical estimation. We show that when functions are convex, both the objective function values and the feasibility violation converge with rate $O(\\frac{1}{T})$, where $T$ is the number of iterations. We then show that if the functions are strongly convex and have Lipschitz continuous gradients, the sequence generated "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00194","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:23:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FPEftEXVTk+ZA/mbhSzp5oRkPbvuEM+LwfrVqFU/p8ZxkNfgl9xP1G9QEXJpMgsUWYVVo4Ex/EjTSOlHToH9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:09:32.613161Z"},"content_sha256":"1d2b180fc32921d29f5622a4735ad1af408dfae122338b1c37c7aadea51a0901","schema_version":"1.0","event_id":"sha256:1d2b180fc32921d29f5622a4735ad1af408dfae122338b1c37c7aadea51a0901"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BAG56X6LV37RJWLNZT72DL5HDF/bundle.json","state_url":"https://pith.science/pith/BAG56X6LV37RJWLNZT72DL5HDF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BAG56X6LV37RJWLNZT72DL5HDF/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-08T19:09:32Z","links":{"resolver":"https://pith.science/pith/BAG56X6LV37RJWLNZT72DL5HDF","bundle":"https://pith.science/pith/BAG56X6LV37RJWLNZT72DL5HDF/bundle.json","state":"https://pith.science/pith/BAG56X6LV37RJWLNZT72DL5HDF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BAG56X6LV37RJWLNZT72DL5HDF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BAG56X6LV37RJWLNZT72DL5HDF","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":"4c37228609b9db5a8e9b7fb10ab7d7c0315f73f6c13e0a34496c90f05dccc4e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-02T17:37:58Z","title_canon_sha256":"5f9167284e209aa5bf81538317cad2238fc8f8548bcd893e27b010c3c50eeeab"},"schema_version":"1.0","source":{"id":"1601.00194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00194","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00194v1","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00194","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"pith_short_12","alias_value":"BAG56X6LV37R","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BAG56X6LV37RJWLN","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BAG56X6L","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:1d2b180fc32921d29f5622a4735ad1af408dfae122338b1c37c7aadea51a0901","target":"graph","created_at":"2026-05-18T01:23:28Z","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 based on Alternating Direction Method of Multipliers (ADMM) to minimize the sum of locally known convex functions using communication over a network. This optimization problem emerges in many applications in distributed machine learning and statistical estimation. We show that when functions are convex, both the objective function values and the feasibility violation converge with rate $O(\\frac{1}{T})$, where $T$ is the number of iterations. We then show that if the functions are strongly convex and have Lipschitz continuous gradients, the sequence generated ","authors_text":"Ali Makhdoumi, Asuman Ozdaglar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-02T17:37:58Z","title":"Convergence Rate of Distributed ADMM over Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00194","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:4bf387325d48ae2057742a7fbe6f21d5306f3a359cbc5176b6e7aa3ee9ba523d","target":"record","created_at":"2026-05-18T01:23:28Z","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":"4c37228609b9db5a8e9b7fb10ab7d7c0315f73f6c13e0a34496c90f05dccc4e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-02T17:37:58Z","title_canon_sha256":"5f9167284e209aa5bf81538317cad2238fc8f8548bcd893e27b010c3c50eeeab"},"schema_version":"1.0","source":{"id":"1601.00194","kind":"arxiv","version":1}},"canonical_sha256":"080ddf5fcbaeff14d96dccffa1afa71946fb6b67a8971cdfaaaa72a39c7e177d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"080ddf5fcbaeff14d96dccffa1afa71946fb6b67a8971cdfaaaa72a39c7e177d","first_computed_at":"2026-05-18T01:23:28.253341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:28.253341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L6z39DfdDE8XZvHW1PCcB7BNC9FsRgoCUTsurBnFbA0KCP+S9ocj253ZRu9+K5XLBZ7BzyZ2IIF8myVKmUshDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:28.254090Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.00194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4bf387325d48ae2057742a7fbe6f21d5306f3a359cbc5176b6e7aa3ee9ba523d","sha256:1d2b180fc32921d29f5622a4735ad1af408dfae122338b1c37c7aadea51a0901"],"state_sha256":"88e3ac79dbcee79a1c191f10d5a92827f4ae534ae6e276f7a0cae34c6144ba21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ejHOnG2/WGQmYZqTb3fvB0MTQujpk2yzVpGDMS4LVKFVvgDQiszwrRgFyXuwWVDaaSSjMqOU3M0Ri6e0zAWzDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:09:32.617138Z","bundle_sha256":"a48f9d4ed0b466f50c41948d2090f472abdebf5ed04a1ed62da13fee496fb7f6"}}