{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:C3LI7EC66KVQ7ZKYWAOM4KDDMU","short_pith_number":"pith:C3LI7EC6","schema_version":"1.0","canonical_sha256":"16d68f905ef2ab0fe558b01cce28636530a23a05af815e1b3296c95087505603","source":{"kind":"arxiv","id":"2101.09583","version":2},"attestation_state":"computed","paper":{"title":"Communication-Efficient Variance-Reduced Decentralized Stochastic Optimization over Time-Varying Directed Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Abolfazl Hashemi, Haris Vikalo, Yiyue Chen","submitted_at":"2021-01-23T20:53:35Z","abstract_excerpt":"We consider the problem of decentralized optimization over time-varying directed networks. The network nodes can access only their local objectives, and aim to collaboratively minimize a global function by exchanging messages with their neighbors. Leveraging sparsification, gradient tracking and variance-reduction, we propose a novel communication-efficient decentralized optimization scheme that is suitable for resource-constrained time-varying directed networks. We prove that in the case of smooth and strongly-convex objective functions, the proposed scheme achieves an accelerated linear conv"},"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":"2101.09583","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2021-01-23T20:53:35Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"51779d16092e85f6cd2384c3b6b77f4a8dd2bd69a31ea3c4eb09b40578c9cb13","abstract_canon_sha256":"8201af8e566659872fd45ea144068060bb80c23836ddd82a905ce677e524a617"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:36:52.793932Z","signature_b64":"zq3hiBIwUSMfp1RWsMCSmEuViUjfHTMcmui/F6f5cpUsp+BwOAHr/c2abqPvqCkzCo9DHOGzdHRRZ0OU9XUPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16d68f905ef2ab0fe558b01cce28636530a23a05af815e1b3296c95087505603","last_reissued_at":"2026-07-05T03:36:52.793363Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:36:52.793363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication-Efficient Variance-Reduced Decentralized Stochastic Optimization over Time-Varying Directed Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Abolfazl Hashemi, Haris Vikalo, Yiyue Chen","submitted_at":"2021-01-23T20:53:35Z","abstract_excerpt":"We consider the problem of decentralized optimization over time-varying directed networks. The network nodes can access only their local objectives, and aim to collaboratively minimize a global function by exchanging messages with their neighbors. Leveraging sparsification, gradient tracking and variance-reduction, we propose a novel communication-efficient decentralized optimization scheme that is suitable for resource-constrained time-varying directed networks. We prove that in the case of smooth and strongly-convex objective functions, the proposed scheme achieves an accelerated linear conv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.09583","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.09583/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2101.09583","created_at":"2026-07-05T03:36:52.793423+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.09583v2","created_at":"2026-07-05T03:36:52.793423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.09583","created_at":"2026-07-05T03:36:52.793423+00:00"},{"alias_kind":"pith_short_12","alias_value":"C3LI7EC66KVQ","created_at":"2026-07-05T03:36:52.793423+00:00"},{"alias_kind":"pith_short_16","alias_value":"C3LI7EC66KVQ7ZKY","created_at":"2026-07-05T03:36:52.793423+00:00"},{"alias_kind":"pith_short_8","alias_value":"C3LI7EC6","created_at":"2026-07-05T03:36:52.793423+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/C3LI7EC66KVQ7ZKYWAOM4KDDMU","json":"https://pith.science/pith/C3LI7EC66KVQ7ZKYWAOM4KDDMU.json","graph_json":"https://pith.science/api/pith-number/C3LI7EC66KVQ7ZKYWAOM4KDDMU/graph.json","events_json":"https://pith.science/api/pith-number/C3LI7EC66KVQ7ZKYWAOM4KDDMU/events.json","paper":"https://pith.science/paper/C3LI7EC6"},"agent_actions":{"view_html":"https://pith.science/pith/C3LI7EC66KVQ7ZKYWAOM4KDDMU","download_json":"https://pith.science/pith/C3LI7EC66KVQ7ZKYWAOM4KDDMU.json","view_paper":"https://pith.science/paper/C3LI7EC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.09583&json=true","fetch_graph":"https://pith.science/api/pith-number/C3LI7EC66KVQ7ZKYWAOM4KDDMU/graph.json","fetch_events":"https://pith.science/api/pith-number/C3LI7EC66KVQ7ZKYWAOM4KDDMU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C3LI7EC66KVQ7ZKYWAOM4KDDMU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C3LI7EC66KVQ7ZKYWAOM4KDDMU/action/storage_attestation","attest_author":"https://pith.science/pith/C3LI7EC66KVQ7ZKYWAOM4KDDMU/action/author_attestation","sign_citation":"https://pith.science/pith/C3LI7EC66KVQ7ZKYWAOM4KDDMU/action/citation_signature","submit_replication":"https://pith.science/pith/C3LI7EC66KVQ7ZKYWAOM4KDDMU/action/replication_record"}},"created_at":"2026-07-05T03:36:52.793423+00:00","updated_at":"2026-07-05T03:36:52.793423+00:00"}