{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:F44GCPJM5OIJD2QUSJFMU743T2","short_pith_number":"pith:F44GCPJM","canonical_record":{"source":{"id":"1609.05877","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-19T19:22:10Z","cross_cats_sorted":["cs.SY","stat.ML"],"title_canon_sha256":"309530913075f8eef053d2539e3597aa2ac1125049874b553485a46f3daf314f","abstract_canon_sha256":"aa463b0a58c325033f99e6e12f332c9e04b67fdb66a312183027d443fcd106e4"},"schema_version":"1.0"},"canonical_sha256":"2f38613d2ceb9091ea14924aca7f9b9e95b5be97cc7ca14edf78b11c5e7fcf34","source":{"kind":"arxiv","id":"1609.05877","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05877","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05877v1","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05877","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"F44GCPJM5OIJ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F44GCPJM5OIJD2QU","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F44GCPJM","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:F44GCPJM5OIJD2QUSJFMU743T2","target":"record","payload":{"canonical_record":{"source":{"id":"1609.05877","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-19T19:22:10Z","cross_cats_sorted":["cs.SY","stat.ML"],"title_canon_sha256":"309530913075f8eef053d2539e3597aa2ac1125049874b553485a46f3daf314f","abstract_canon_sha256":"aa463b0a58c325033f99e6e12f332c9e04b67fdb66a312183027d443fcd106e4"},"schema_version":"1.0"},"canonical_sha256":"2f38613d2ceb9091ea14924aca7f9b9e95b5be97cc7ca14edf78b11c5e7fcf34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:25.082079Z","signature_b64":"HXtY6Qqx4Wn/OtXckBUvea0/OMOYV0eKlU38gTTDes86ydigTNFnR+KDmrLXKoDO4lmCo2W9sv7nB8UhSq1pBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f38613d2ceb9091ea14924aca7f9b9e95b5be97cc7ca14edf78b11c5e7fcf34","last_reissued_at":"2026-05-18T01:04:25.081447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:25.081447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.05877","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:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wLj2FYl+DYv+J4i350uEpjnHjgdZeClb2HZ7RvPXF3hGxh+gTV+P/TS/+lcHAqBtHPN64FzGF9CwSh6bmTqlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:53:08.408931Z"},"content_sha256":"aa99ecd48bb2cf268b021c3a402e02cd0746d43809d09729c50e7f833eb7211b","schema_version":"1.0","event_id":"sha256:aa99ecd48bb2cf268b021c3a402e02cd0746d43809d09729c50e7f833eb7211b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:F44GCPJM5OIJD2QUSJFMU743T2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometrically Convergent Distributed Optimization with Uncoordinated Step-Sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","stat.ML"],"primary_cat":"math.OC","authors_text":"Alex Olshevsky, Angelia Nedi\\'c, C\\'esar A. Uribe, Wei Shi","submitted_at":"2016-09-19T19:22:10Z","abstract_excerpt":"A recent algorithmic family for distributed optimization, DIGing's, have been shown to have geometric convergence over time-varying undirected/directed graphs. Nevertheless, an identical step-size for all agents is needed. In this paper, we study the convergence rates of the Adapt-Then-Combine (ATC) variation of the DIGing algorithm under uncoordinated step-sizes. We show that the ATC variation of DIGing algorithm converges geometrically fast even if the step-sizes are different among the agents. In addition, our analysis implies that the ATC structure can accelerate convergence compared to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05877","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:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v1q7Uo18UtdmWzEXezxe/YII1KhXcjGEF0IBJygNcs/QZ4bJUTUDelmtIifwk8haxnPgYcIQ2SyjSCuVYcSqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:53:08.409327Z"},"content_sha256":"fc2e729ddd81f83e9b7e59e1ffec6c7d202152ec270fd26d72cf1eb794e68819","schema_version":"1.0","event_id":"sha256:fc2e729ddd81f83e9b7e59e1ffec6c7d202152ec270fd26d72cf1eb794e68819"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F44GCPJM5OIJD2QUSJFMU743T2/bundle.json","state_url":"https://pith.science/pith/F44GCPJM5OIJD2QUSJFMU743T2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F44GCPJM5OIJD2QUSJFMU743T2/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-28T07:53:08Z","links":{"resolver":"https://pith.science/pith/F44GCPJM5OIJD2QUSJFMU743T2","bundle":"https://pith.science/pith/F44GCPJM5OIJD2QUSJFMU743T2/bundle.json","state":"https://pith.science/pith/F44GCPJM5OIJD2QUSJFMU743T2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F44GCPJM5OIJD2QUSJFMU743T2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:F44GCPJM5OIJD2QUSJFMU743T2","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":"aa463b0a58c325033f99e6e12f332c9e04b67fdb66a312183027d443fcd106e4","cross_cats_sorted":["cs.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-19T19:22:10Z","title_canon_sha256":"309530913075f8eef053d2539e3597aa2ac1125049874b553485a46f3daf314f"},"schema_version":"1.0","source":{"id":"1609.05877","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05877","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05877v1","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05877","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"F44GCPJM5OIJ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F44GCPJM5OIJD2QU","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F44GCPJM","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:fc2e729ddd81f83e9b7e59e1ffec6c7d202152ec270fd26d72cf1eb794e68819","target":"graph","created_at":"2026-05-18T01:04:25Z","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":"A recent algorithmic family for distributed optimization, DIGing's, have been shown to have geometric convergence over time-varying undirected/directed graphs. Nevertheless, an identical step-size for all agents is needed. In this paper, we study the convergence rates of the Adapt-Then-Combine (ATC) variation of the DIGing algorithm under uncoordinated step-sizes. We show that the ATC variation of DIGing algorithm converges geometrically fast even if the step-sizes are different among the agents. In addition, our analysis implies that the ATC structure can accelerate convergence compared to th","authors_text":"Alex Olshevsky, Angelia Nedi\\'c, C\\'esar A. Uribe, Wei Shi","cross_cats":["cs.SY","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-19T19:22:10Z","title":"Geometrically Convergent Distributed Optimization with Uncoordinated Step-Sizes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05877","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:aa99ecd48bb2cf268b021c3a402e02cd0746d43809d09729c50e7f833eb7211b","target":"record","created_at":"2026-05-18T01:04:25Z","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":"aa463b0a58c325033f99e6e12f332c9e04b67fdb66a312183027d443fcd106e4","cross_cats_sorted":["cs.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-19T19:22:10Z","title_canon_sha256":"309530913075f8eef053d2539e3597aa2ac1125049874b553485a46f3daf314f"},"schema_version":"1.0","source":{"id":"1609.05877","kind":"arxiv","version":1}},"canonical_sha256":"2f38613d2ceb9091ea14924aca7f9b9e95b5be97cc7ca14edf78b11c5e7fcf34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f38613d2ceb9091ea14924aca7f9b9e95b5be97cc7ca14edf78b11c5e7fcf34","first_computed_at":"2026-05-18T01:04:25.081447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:25.081447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HXtY6Qqx4Wn/OtXckBUvea0/OMOYV0eKlU38gTTDes86ydigTNFnR+KDmrLXKoDO4lmCo2W9sv7nB8UhSq1pBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:25.082079Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.05877","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa99ecd48bb2cf268b021c3a402e02cd0746d43809d09729c50e7f833eb7211b","sha256:fc2e729ddd81f83e9b7e59e1ffec6c7d202152ec270fd26d72cf1eb794e68819"],"state_sha256":"77dd6fd3eb207ddfca09a566a830d5fab6e9bea599d56e5612e87c4eb10ecc4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rA7oqfnCmwMLN3OCVR8loOU7OaUB58qJODlNfvxuFyF8DRkak+1Luj0z5awTQAygL2GaDAYKLuLwC7aV0icwDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:53:08.411526Z","bundle_sha256":"2fb3a41175f9b539a9e7c59d5004f37e79d62ff39b015c4bca426e1ced120bb4"}}