{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UTOQTLWH2652E2TSR4BZGIZBHR","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":"ca7b3e5a1fa5fb11b67e5cb287d54fc1d4526d0c6a0aa28824699cd16d5f50c5","cross_cats_sorted":["cs.SY","eess.SY","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T02:13:14Z","title_canon_sha256":"f17fa98a5079d998079f56536df16898ad02e527c45f17a066312b1f21d309f3"},"schema_version":"1.0","source":{"id":"1905.09435","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09435","created_at":"2026-06-04T20:14:32Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09435v3","created_at":"2026-06-04T20:14:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09435","created_at":"2026-06-04T20:14:32Z"},{"alias_kind":"pith_short_12","alias_value":"UTOQTLWH2652","created_at":"2026-06-04T20:14:32Z"},{"alias_kind":"pith_short_16","alias_value":"UTOQTLWH2652E2TS","created_at":"2026-06-04T20:14:32Z"},{"alias_kind":"pith_short_8","alias_value":"UTOQTLWH","created_at":"2026-06-04T20:14:32Z"}],"graph_snapshots":[{"event_id":"sha256:b821841fbbe664a279e9730a4f65db7f59c4642dfbab6423a720ad163bad6ef7","target":"graph","created_at":"2026-06-04T20:14:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.09435/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies the problem of error-runtime trade-off, typically encountered in decentralized training based on stochastic gradient descent (SGD) using a given network. While a denser (sparser) network topology results in faster (slower) error convergence in terms of iterations, it incurs more (less) communication time/delay per iteration. In this paper, we propose MATCHA, an algorithm that can achieve a win-win in this error-runtime trade-off for any arbitrary network topology. The main idea of MATCHA is to parallelize inter-node communication by decomposing the topology into matchings. T","authors_text":"Anit Kumar Sahu, Gauri Joshi, Jianyu Wang, Soummya Kar, Zhouyi Yang","cross_cats":["cs.SY","eess.SY","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T02:13:14Z","title":"MATCHA: Speeding Up Decentralized SGD via Matching Decomposition Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09435","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:57a2aad6dbc2959001699ab67aa07b4392293a154800f7d1d362b0165d7d789b","target":"record","created_at":"2026-06-04T20:14:32Z","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":"ca7b3e5a1fa5fb11b67e5cb287d54fc1d4526d0c6a0aa28824699cd16d5f50c5","cross_cats_sorted":["cs.SY","eess.SY","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T02:13:14Z","title_canon_sha256":"f17fa98a5079d998079f56536df16898ad02e527c45f17a066312b1f21d309f3"},"schema_version":"1.0","source":{"id":"1905.09435","kind":"arxiv","version":3}},"canonical_sha256":"a4dd09aec7d7bba26a728f039323213c73c943595ea17627b06678dd34392bb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4dd09aec7d7bba26a728f039323213c73c943595ea17627b06678dd34392bb1","first_computed_at":"2026-06-04T20:14:32.492519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T20:14:32.492519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NnKeR9C1J45rakQ3XBHeP9XU3RzOBn3/Aa9WKJcuRNL3UJrojUaXuu7tN02QbAp4OWPcuJnpa9qBkkyzuRrgCg==","signature_status":"signed_v1","signed_at":"2026-06-04T20:14:32.492992Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09435","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57a2aad6dbc2959001699ab67aa07b4392293a154800f7d1d362b0165d7d789b","sha256:b821841fbbe664a279e9730a4f65db7f59c4642dfbab6423a720ad163bad6ef7"],"state_sha256":"8d60d300a5bd879b0d4f7c18d7de0a81976031e4ab9214e9c2eaec6a3cbeaa79"}