{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VLPSTQB3EZ4HYPTLFBKRNJC3XQ","short_pith_number":"pith:VLPSTQB3","schema_version":"1.0","canonical_sha256":"aadf29c03b26787c3e6b285516a45bbc2b8c7f4a97e8b20f6e3c38d6adc29752","source":{"kind":"arxiv","id":"1607.03218","version":3},"attestation_state":"computed","paper":{"title":"Achieving Geometric Convergence for Distributed Optimization over Time-Varying Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alex Olshevsky, Angelia Nedich, Wei Shi","submitted_at":"2016-07-12T02:41:35Z","abstract_excerpt":"This paper considers the problem of distributed optimization over time-varying graphs. For the case of undirected graphs, we introduce a distributed algorithm, referred to as DIGing, based on a combination of a distributed inexact gradient method and a gradient tracking technique. The DIGing algorithm uses doubly stochastic mixing matrices and employs fixed step-sizes and, yet, drives all the agents' iterates to a global and consensual minimizer. When the graphs are directed, in which case the implementation of doubly stochastic mixing matrices is unrealistic, we construct an algorithm that in"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1607.03218","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-12T02:41:35Z","cross_cats_sorted":[],"title_canon_sha256":"3fb8161f6ca0a31560d0fc212304bb2fa008ceaa5cb37e35359c8787b089ff53","abstract_canon_sha256":"c981c39cec4d1fde5379004a640f86d57165098123b3cd0494755b6c26f0afd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:28.165878Z","signature_b64":"wd4rH2DlcAi6jZpjY+AvCtD3PnVVXilHqrl7rZuaKBdJGxVq91rckZA4fS9r23kpFTkyM0REvsA6YOpLtAVSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aadf29c03b26787c3e6b285516a45bbc2b8c7f4a97e8b20f6e3c38d6adc29752","last_reissued_at":"2026-05-18T00:48:28.165269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:28.165269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achieving Geometric Convergence for Distributed Optimization over Time-Varying Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alex Olshevsky, Angelia Nedich, Wei Shi","submitted_at":"2016-07-12T02:41:35Z","abstract_excerpt":"This paper considers the problem of distributed optimization over time-varying graphs. For the case of undirected graphs, we introduce a distributed algorithm, referred to as DIGing, based on a combination of a distributed inexact gradient method and a gradient tracking technique. The DIGing algorithm uses doubly stochastic mixing matrices and employs fixed step-sizes and, yet, drives all the agents' iterates to a global and consensual minimizer. When the graphs are directed, in which case the implementation of doubly stochastic mixing matrices is unrealistic, we construct an algorithm that in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03218","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.03218","created_at":"2026-05-18T00:48:28.165355+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03218v3","created_at":"2026-05-18T00:48:28.165355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03218","created_at":"2026-05-18T00:48:28.165355+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLPSTQB3EZ4H","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLPSTQB3EZ4HYPTL","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLPSTQB3","created_at":"2026-05-18T12:30:48.956258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VLPSTQB3EZ4HYPTLFBKRNJC3XQ","json":"https://pith.science/pith/VLPSTQB3EZ4HYPTLFBKRNJC3XQ.json","graph_json":"https://pith.science/api/pith-number/VLPSTQB3EZ4HYPTLFBKRNJC3XQ/graph.json","events_json":"https://pith.science/api/pith-number/VLPSTQB3EZ4HYPTLFBKRNJC3XQ/events.json","paper":"https://pith.science/paper/VLPSTQB3"},"agent_actions":{"view_html":"https://pith.science/pith/VLPSTQB3EZ4HYPTLFBKRNJC3XQ","download_json":"https://pith.science/pith/VLPSTQB3EZ4HYPTLFBKRNJC3XQ.json","view_paper":"https://pith.science/paper/VLPSTQB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03218&json=true","fetch_graph":"https://pith.science/api/pith-number/VLPSTQB3EZ4HYPTLFBKRNJC3XQ/graph.json","fetch_events":"https://pith.science/api/pith-number/VLPSTQB3EZ4HYPTLFBKRNJC3XQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLPSTQB3EZ4HYPTLFBKRNJC3XQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLPSTQB3EZ4HYPTLFBKRNJC3XQ/action/storage_attestation","attest_author":"https://pith.science/pith/VLPSTQB3EZ4HYPTLFBKRNJC3XQ/action/author_attestation","sign_citation":"https://pith.science/pith/VLPSTQB3EZ4HYPTLFBKRNJC3XQ/action/citation_signature","submit_replication":"https://pith.science/pith/VLPSTQB3EZ4HYPTLFBKRNJC3XQ/action/replication_record"}},"created_at":"2026-05-18T00:48:28.165355+00:00","updated_at":"2026-05-18T00:48:28.165355+00:00"}