{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:L5ZIP6CZYK34CSKOCJU47OMPTO","short_pith_number":"pith:L5ZIP6CZ","canonical_record":{"source":{"id":"2007.06134","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-07-13T00:04:55Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"e5d6145e202165e09237c0303ae31dd982dfa5db533e4f2e3ac99c7b78341355","abstract_canon_sha256":"2091c5229bc2c9ff154aff1f1d165f36c6fa716babbadb08c2f3ab032b35f3b1"},"schema_version":"1.0"},"canonical_sha256":"5f7287f859c2b7c1494e1269cfb98f9b9f9496d26d14d82c0bd03056426e102b","source":{"kind":"arxiv","id":"2007.06134","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.06134","created_at":"2026-07-05T02:07:47Z"},{"alias_kind":"arxiv_version","alias_value":"2007.06134v2","created_at":"2026-07-05T02:07:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.06134","created_at":"2026-07-05T02:07:47Z"},{"alias_kind":"pith_short_12","alias_value":"L5ZIP6CZYK34","created_at":"2026-07-05T02:07:47Z"},{"alias_kind":"pith_short_16","alias_value":"L5ZIP6CZYK34CSKO","created_at":"2026-07-05T02:07:47Z"},{"alias_kind":"pith_short_8","alias_value":"L5ZIP6CZ","created_at":"2026-07-05T02:07:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:L5ZIP6CZYK34CSKOCJU47OMPTO","target":"record","payload":{"canonical_record":{"source":{"id":"2007.06134","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-07-13T00:04:55Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"e5d6145e202165e09237c0303ae31dd982dfa5db533e4f2e3ac99c7b78341355","abstract_canon_sha256":"2091c5229bc2c9ff154aff1f1d165f36c6fa716babbadb08c2f3ab032b35f3b1"},"schema_version":"1.0"},"canonical_sha256":"5f7287f859c2b7c1494e1269cfb98f9b9f9496d26d14d82c0bd03056426e102b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:07:47.990560Z","signature_b64":"EF2tJqX/Ia/vyw2BJygYxSxO+eQHG8OQD8kBpp+LdZaw7P1VqbH3Mkw5+RkqP9SIelwDUtW6JQT7k1W+alVKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f7287f859c2b7c1494e1269cfb98f9b9f9496d26d14d82c0bd03056426e102b","last_reissued_at":"2026-07-05T02:07:47.990013Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:07:47.990013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.06134","source_version":2,"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-07-05T02:07:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yFv9p1rbcyX8Bp2KKRScGtc1vLYG7XZPD7K9mdAA3v1H9NWNMHOcS+w4LmPITsPubuv7PktWMvaJHJT8qY54Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T04:31:07.400273Z"},"content_sha256":"a87dfc5508c26cc8ce88298ce31daebcc8a616c8fee36e1fb2b9be64395951b1","schema_version":"1.0","event_id":"sha256:a87dfc5508c26cc8ce88298ce31daebcc8a616c8fee36e1fb2b9be64395951b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:L5ZIP6CZYK34CSKOCJU47OMPTO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Periodic Averaging: A Practical Approach to Reducing Communication in Distributed Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gagan Agrawal, Peng Jiang","submitted_at":"2020-07-13T00:04:55Z","abstract_excerpt":"Stochastic Gradient Descent (SGD) is the key learning algorithm for many machine learning tasks. Because of its computational costs, there is a growing interest in accelerating SGD on HPC resources like GPU clusters. However, the performance of parallel SGD is still bottlenecked by the high communication costs even with a fast connection among the machines. A simple approach to alleviating this problem, used in many existing efforts, is to perform communication every few iterations, using a constant averaging period. In this paper, we show that the optimal averaging period in terms of converge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.06134","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/2007.06134/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"},"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-07-05T02:07:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ThZmr5CZ6W/QuO5sqmqMnrbPlqZA83KGYgtqy+snAO4YoUBr6K+cTZWmbSuo4sY5EOwB9/9HncKAkJxT+G7uBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T04:31:07.401029Z"},"content_sha256":"e8182e7d739dd8f0fc062dff99da1ea8dca9839d808c74e257c6e823b5e065dd","schema_version":"1.0","event_id":"sha256:e8182e7d739dd8f0fc062dff99da1ea8dca9839d808c74e257c6e823b5e065dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L5ZIP6CZYK34CSKOCJU47OMPTO/bundle.json","state_url":"https://pith.science/pith/L5ZIP6CZYK34CSKOCJU47OMPTO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L5ZIP6CZYK34CSKOCJU47OMPTO/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-08-07T04:31:07Z","links":{"resolver":"https://pith.science/pith/L5ZIP6CZYK34CSKOCJU47OMPTO","bundle":"https://pith.science/pith/L5ZIP6CZYK34CSKOCJU47OMPTO/bundle.json","state":"https://pith.science/pith/L5ZIP6CZYK34CSKOCJU47OMPTO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L5ZIP6CZYK34CSKOCJU47OMPTO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:L5ZIP6CZYK34CSKOCJU47OMPTO","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":"2091c5229bc2c9ff154aff1f1d165f36c6fa716babbadb08c2f3ab032b35f3b1","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-07-13T00:04:55Z","title_canon_sha256":"e5d6145e202165e09237c0303ae31dd982dfa5db533e4f2e3ac99c7b78341355"},"schema_version":"1.0","source":{"id":"2007.06134","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.06134","created_at":"2026-07-05T02:07:47Z"},{"alias_kind":"arxiv_version","alias_value":"2007.06134v2","created_at":"2026-07-05T02:07:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.06134","created_at":"2026-07-05T02:07:47Z"},{"alias_kind":"pith_short_12","alias_value":"L5ZIP6CZYK34","created_at":"2026-07-05T02:07:47Z"},{"alias_kind":"pith_short_16","alias_value":"L5ZIP6CZYK34CSKO","created_at":"2026-07-05T02:07:47Z"},{"alias_kind":"pith_short_8","alias_value":"L5ZIP6CZ","created_at":"2026-07-05T02:07:47Z"}],"graph_snapshots":[{"event_id":"sha256:e8182e7d739dd8f0fc062dff99da1ea8dca9839d808c74e257c6e823b5e065dd","target":"graph","created_at":"2026-07-05T02:07:47Z","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/2007.06134/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Stochastic Gradient Descent (SGD) is the key learning algorithm for many machine learning tasks. Because of its computational costs, there is a growing interest in accelerating SGD on HPC resources like GPU clusters. However, the performance of parallel SGD is still bottlenecked by the high communication costs even with a fast connection among the machines. A simple approach to alleviating this problem, used in many existing efforts, is to perform communication every few iterations, using a constant averaging period. In this paper, we show that the optimal averaging period in terms of converge","authors_text":"Gagan Agrawal, Peng Jiang","cross_cats":["cs.DC","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-07-13T00:04:55Z","title":"Adaptive Periodic Averaging: A Practical Approach to Reducing Communication in Distributed Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.06134","kind":"arxiv","version":2},"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:a87dfc5508c26cc8ce88298ce31daebcc8a616c8fee36e1fb2b9be64395951b1","target":"record","created_at":"2026-07-05T02:07:47Z","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":"2091c5229bc2c9ff154aff1f1d165f36c6fa716babbadb08c2f3ab032b35f3b1","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-07-13T00:04:55Z","title_canon_sha256":"e5d6145e202165e09237c0303ae31dd982dfa5db533e4f2e3ac99c7b78341355"},"schema_version":"1.0","source":{"id":"2007.06134","kind":"arxiv","version":2}},"canonical_sha256":"5f7287f859c2b7c1494e1269cfb98f9b9f9496d26d14d82c0bd03056426e102b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f7287f859c2b7c1494e1269cfb98f9b9f9496d26d14d82c0bd03056426e102b","first_computed_at":"2026-07-05T02:07:47.990013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:07:47.990013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EF2tJqX/Ia/vyw2BJygYxSxO+eQHG8OQD8kBpp+LdZaw7P1VqbH3Mkw5+RkqP9SIelwDUtW6JQT7k1W+alVKCA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:07:47.990560Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.06134","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a87dfc5508c26cc8ce88298ce31daebcc8a616c8fee36e1fb2b9be64395951b1","sha256:e8182e7d739dd8f0fc062dff99da1ea8dca9839d808c74e257c6e823b5e065dd"],"state_sha256":"1554b193be4b558d2803588bf725d16709371ba83a0fae94dc10256bcfd30844"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"89kXc3+33b4Bhrl/ddPOb4NthfguU7lo41uFTy5IT++8As6+07U5Sz77kxOuiJsF9MrI5SJ9L8gKIIXfRyqeCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T04:31:07.410413Z","bundle_sha256":"3d981556e95f25ad65806eba37114ad12b8d7cba08dc2353cfffdcee56623d44"}}