{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VLPSTQB3EZ4HYPTLFBKRNJC3XQ","short_pith_number":"pith:VLPSTQB3","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"},"canonical_sha256":"aadf29c03b26787c3e6b285516a45bbc2b8c7f4a97e8b20f6e3c38d6adc29752","source":{"kind":"arxiv","id":"1607.03218","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03218","created_at":"2026-05-18T00:48:28Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03218v3","created_at":"2026-05-18T00:48:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03218","created_at":"2026-05-18T00:48:28Z"},{"alias_kind":"pith_short_12","alias_value":"VLPSTQB3EZ4H","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VLPSTQB3EZ4HYPTL","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VLPSTQB3","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VLPSTQB3EZ4HYPTLFBKRNJC3XQ","target":"record","payload":{"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"},"canonical_sha256":"aadf29c03b26787c3e6b285516a45bbc2b8c7f4a97e8b20f6e3c38d6adc29752","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"},"source_kind":"arxiv","source_id":"1607.03218","source_version":3,"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:48:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a64tt3SY2Wo77ihRY7cHv57WnKwoWiRAcazQiQK0/250zmn+O28D/agSLB6MrxR9/0pIFpw+lbU614G3uGS1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:16:42.677088Z"},"content_sha256":"7b8d83d400197d058f836d288a9c3e5bf1bed59ceaddcd5b82beaab4c694075d","schema_version":"1.0","event_id":"sha256:7b8d83d400197d058f836d288a9c3e5bf1bed59ceaddcd5b82beaab4c694075d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VLPSTQB3EZ4HYPTLFBKRNJC3XQ","target":"graph","payload":{"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"},"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:48:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q9sm10T9PKAtgb9wOQjrNFBwX3WcmPNgBBXLF7S4EPQDoihPYD6Krwfaw96ijAEO6iQ4cl/RmY7SpguwFU6NDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:16:42.677815Z"},"content_sha256":"78cf6094cde406772a9d21dea6d3d68c4ef4eac169b0b093311bee453556e105","schema_version":"1.0","event_id":"sha256:78cf6094cde406772a9d21dea6d3d68c4ef4eac169b0b093311bee453556e105"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLPSTQB3EZ4HYPTLFBKRNJC3XQ/bundle.json","state_url":"https://pith.science/pith/VLPSTQB3EZ4HYPTLFBKRNJC3XQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLPSTQB3EZ4HYPTLFBKRNJC3XQ/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-28T16:16:42Z","links":{"resolver":"https://pith.science/pith/VLPSTQB3EZ4HYPTLFBKRNJC3XQ","bundle":"https://pith.science/pith/VLPSTQB3EZ4HYPTLFBKRNJC3XQ/bundle.json","state":"https://pith.science/pith/VLPSTQB3EZ4HYPTLFBKRNJC3XQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLPSTQB3EZ4HYPTLFBKRNJC3XQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VLPSTQB3EZ4HYPTLFBKRNJC3XQ","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":"c981c39cec4d1fde5379004a640f86d57165098123b3cd0494755b6c26f0afd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-12T02:41:35Z","title_canon_sha256":"3fb8161f6ca0a31560d0fc212304bb2fa008ceaa5cb37e35359c8787b089ff53"},"schema_version":"1.0","source":{"id":"1607.03218","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03218","created_at":"2026-05-18T00:48:28Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03218v3","created_at":"2026-05-18T00:48:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03218","created_at":"2026-05-18T00:48:28Z"},{"alias_kind":"pith_short_12","alias_value":"VLPSTQB3EZ4H","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VLPSTQB3EZ4HYPTL","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VLPSTQB3","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:78cf6094cde406772a9d21dea6d3d68c4ef4eac169b0b093311bee453556e105","target":"graph","created_at":"2026-05-18T00:48: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":"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","authors_text":"Alex Olshevsky, Angelia Nedich, Wei Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-12T02:41:35Z","title":"Achieving Geometric Convergence for Distributed Optimization over Time-Varying Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03218","kind":"arxiv","version":3},"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:7b8d83d400197d058f836d288a9c3e5bf1bed59ceaddcd5b82beaab4c694075d","target":"record","created_at":"2026-05-18T00:48: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":"c981c39cec4d1fde5379004a640f86d57165098123b3cd0494755b6c26f0afd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-12T02:41:35Z","title_canon_sha256":"3fb8161f6ca0a31560d0fc212304bb2fa008ceaa5cb37e35359c8787b089ff53"},"schema_version":"1.0","source":{"id":"1607.03218","kind":"arxiv","version":3}},"canonical_sha256":"aadf29c03b26787c3e6b285516a45bbc2b8c7f4a97e8b20f6e3c38d6adc29752","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aadf29c03b26787c3e6b285516a45bbc2b8c7f4a97e8b20f6e3c38d6adc29752","first_computed_at":"2026-05-18T00:48:28.165269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:28.165269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wd4rH2DlcAi6jZpjY+AvCtD3PnVVXilHqrl7rZuaKBdJGxVq91rckZA4fS9r23kpFTkyM0REvsA6YOpLtAVSCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:28.165878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.03218","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b8d83d400197d058f836d288a9c3e5bf1bed59ceaddcd5b82beaab4c694075d","sha256:78cf6094cde406772a9d21dea6d3d68c4ef4eac169b0b093311bee453556e105"],"state_sha256":"62f2fa05d107f8fdcfe1c40ba16e6436c0d9d2e3746b6756580907b984a9fff3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VJsPE10Tsnn8fcOwqtkQNHGWlKArt88VitVMxEHukE78Z2d8n2BhJPU0pFrrPVtoTfSRKr+jwLRmnJgs/OuGDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:16:42.681582Z","bundle_sha256":"607f82bf05991bcd96d0b2ee772d1afaf952284628c11b518dd50b05c527d23d"}}