{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VPO3OYGFYMF2NYNIBFYRVHZXND","short_pith_number":"pith:VPO3OYGF","canonical_record":{"source":{"id":"1809.10505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-27T13:23:35Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"f6c2668a0d38bf0f7a0c75f64b0efb80f0d5f78b4eae1bc0ba594ed5e726184b","abstract_canon_sha256":"989847ca7c4477f43ebeae2a86ea6d7e8531887042b79b0baac0ff735bc319af"},"schema_version":"1.0"},"canonical_sha256":"abddb760c5c30ba6e1a809711a9f3768d6d64f1a13afe2ec23df7d868f558bbe","source":{"kind":"arxiv","id":"1809.10505","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10505","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10505v1","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10505","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"VPO3OYGFYMF2","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VPO3OYGFYMF2NYNI","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VPO3OYGF","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VPO3OYGFYMF2NYNIBFYRVHZXND","target":"record","payload":{"canonical_record":{"source":{"id":"1809.10505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-27T13:23:35Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"f6c2668a0d38bf0f7a0c75f64b0efb80f0d5f78b4eae1bc0ba594ed5e726184b","abstract_canon_sha256":"989847ca7c4477f43ebeae2a86ea6d7e8531887042b79b0baac0ff735bc319af"},"schema_version":"1.0"},"canonical_sha256":"abddb760c5c30ba6e1a809711a9f3768d6d64f1a13afe2ec23df7d868f558bbe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:38.204142Z","signature_b64":"Gpd0/DOh+n9qZW4e7qP5MxRBWZquPb96TZ2f2A/6kb2dnsGkck+OygEF6yHueV2hk8EWM9Sq1I3Qgw+DIhrwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abddb760c5c30ba6e1a809711a9f3768d6d64f1a13afe2ec23df7d868f558bbe","last_reissued_at":"2026-05-18T00:04:38.203530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:38.203530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.10505","source_version":1,"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:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qk1CUodg+VHqOqc1nUYr3qNLQpccLNIECnWBHT0w/dJDTp57VFPy2xMjKw2WR13QB55ry8sR2sDuFmb6DUhvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:32:59.337084Z"},"content_sha256":"d9b6f3d63a500880fc82ecf6ccbe714571253c762d74a91bee08e92568866197","schema_version":"1.0","event_id":"sha256:d9b6f3d63a500880fc82ecf6ccbe714571253c762d74a91bee08e92568866197"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VPO3OYGFYMF2NYNIBFYRVHZXND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Convergence of Sparsified Gradient Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"C\\'edric Renggli, Dan Alistarh, Mikael Johansson, Nikola Konstantinov, Sarit Khirirat, Torsten Hoefler","submitted_at":"2018-09-27T13:23:35Z","abstract_excerpt":"Distributed training of massive machine learning models, in particular deep neural networks, via Stochastic Gradient Descent (SGD) is becoming commonplace. Several families of communication-reduction methods, such as quantization, large-batch methods, and gradient sparsification, have been proposed. To date, gradient sparsification methods - where each node sorts gradients by magnitude, and only communicates a subset of the components, accumulating the rest locally - are known to yield some of the largest practical gains. Such methods can reduce the amount of communication per step by up to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10505","kind":"arxiv","version":1},"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:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VlvrdsKq3XHl5HNTYEyhzKF1VBzC/1oP9eTeE+bZAST27rHZ71ztwIiyldhLISEHCl3S2Vf9ZFSqTOf44tocCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:32:59.337456Z"},"content_sha256":"cf97262e90d9b90de74da94f2f9954f003c753d681faf115883d14db32dafc76","schema_version":"1.0","event_id":"sha256:cf97262e90d9b90de74da94f2f9954f003c753d681faf115883d14db32dafc76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPO3OYGFYMF2NYNIBFYRVHZXND/bundle.json","state_url":"https://pith.science/pith/VPO3OYGFYMF2NYNIBFYRVHZXND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPO3OYGFYMF2NYNIBFYRVHZXND/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-28T13:32:59Z","links":{"resolver":"https://pith.science/pith/VPO3OYGFYMF2NYNIBFYRVHZXND","bundle":"https://pith.science/pith/VPO3OYGFYMF2NYNIBFYRVHZXND/bundle.json","state":"https://pith.science/pith/VPO3OYGFYMF2NYNIBFYRVHZXND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPO3OYGFYMF2NYNIBFYRVHZXND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VPO3OYGFYMF2NYNIBFYRVHZXND","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":"989847ca7c4477f43ebeae2a86ea6d7e8531887042b79b0baac0ff735bc319af","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-27T13:23:35Z","title_canon_sha256":"f6c2668a0d38bf0f7a0c75f64b0efb80f0d5f78b4eae1bc0ba594ed5e726184b"},"schema_version":"1.0","source":{"id":"1809.10505","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10505","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10505v1","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10505","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"VPO3OYGFYMF2","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VPO3OYGFYMF2NYNI","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VPO3OYGF","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:cf97262e90d9b90de74da94f2f9954f003c753d681faf115883d14db32dafc76","target":"graph","created_at":"2026-05-18T00:04:38Z","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":"Distributed training of massive machine learning models, in particular deep neural networks, via Stochastic Gradient Descent (SGD) is becoming commonplace. Several families of communication-reduction methods, such as quantization, large-batch methods, and gradient sparsification, have been proposed. To date, gradient sparsification methods - where each node sorts gradients by magnitude, and only communicates a subset of the components, accumulating the rest locally - are known to yield some of the largest practical gains. Such methods can reduce the amount of communication per step by up to th","authors_text":"C\\'edric Renggli, Dan Alistarh, Mikael Johansson, Nikola Konstantinov, Sarit Khirirat, Torsten Hoefler","cross_cats":["cs.DC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-27T13:23:35Z","title":"The Convergence of Sparsified Gradient Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10505","kind":"arxiv","version":1},"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:d9b6f3d63a500880fc82ecf6ccbe714571253c762d74a91bee08e92568866197","target":"record","created_at":"2026-05-18T00:04:38Z","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":"989847ca7c4477f43ebeae2a86ea6d7e8531887042b79b0baac0ff735bc319af","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-27T13:23:35Z","title_canon_sha256":"f6c2668a0d38bf0f7a0c75f64b0efb80f0d5f78b4eae1bc0ba594ed5e726184b"},"schema_version":"1.0","source":{"id":"1809.10505","kind":"arxiv","version":1}},"canonical_sha256":"abddb760c5c30ba6e1a809711a9f3768d6d64f1a13afe2ec23df7d868f558bbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abddb760c5c30ba6e1a809711a9f3768d6d64f1a13afe2ec23df7d868f558bbe","first_computed_at":"2026-05-18T00:04:38.203530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:38.203530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gpd0/DOh+n9qZW4e7qP5MxRBWZquPb96TZ2f2A/6kb2dnsGkck+OygEF6yHueV2hk8EWM9Sq1I3Qgw+DIhrwCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:38.204142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.10505","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9b6f3d63a500880fc82ecf6ccbe714571253c762d74a91bee08e92568866197","sha256:cf97262e90d9b90de74da94f2f9954f003c753d681faf115883d14db32dafc76"],"state_sha256":"e5afddc7f0e43e2925542ca43d8d8b8ba30aaf313293c52f35abaa9ca18b9b5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1jYAckpP5v++bfoDnCPYsy5VY8FQtw1buqI5fSpL06lQC9XDgyIQB1NgUqf6M7EHPfwb4eCBIaDHzomVQyXUCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:32:59.339311Z","bundle_sha256":"8d10544b2cc335f02336852b53b6e85944c8ad5009153adfa2e82bbc16cec32f"}}