{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MBPKHU5BCIULZFUUYQROXVHZHO","short_pith_number":"pith:MBPKHU5B","canonical_record":{"source":{"id":"1803.08841","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-23T15:32:42Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"68abae7ccdef09a3bbac456b2532be16d4363c737370066588e8848f9d38ef21","abstract_canon_sha256":"9a131e3cc6c6ae294224f36d69cd3f2d0d0b614843421f2631e13ccc7c77c36f"},"schema_version":"1.0"},"canonical_sha256":"605ea3d3a11228bc9694c422ebd4f93b87c64828d7dc7d7b49f806ffa67e36e0","source":{"kind":"arxiv","id":"1803.08841","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08841","created_at":"2026-05-18T00:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08841v2","created_at":"2026-05-18T00:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08841","created_at":"2026-05-18T00:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"MBPKHU5BCIUL","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MBPKHU5BCIULZFUU","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MBPKHU5B","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MBPKHU5BCIULZFUUYQROXVHZHO","target":"record","payload":{"canonical_record":{"source":{"id":"1803.08841","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-23T15:32:42Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"68abae7ccdef09a3bbac456b2532be16d4363c737370066588e8848f9d38ef21","abstract_canon_sha256":"9a131e3cc6c6ae294224f36d69cd3f2d0d0b614843421f2631e13ccc7c77c36f"},"schema_version":"1.0"},"canonical_sha256":"605ea3d3a11228bc9694c422ebd4f93b87c64828d7dc7d7b49f806ffa67e36e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:38.091114Z","signature_b64":"VaqRxBBkwMKPE33SMO1x8J+19Rxnlon8l4qDCsKc5Aac1Za5PGIOUEPyRNzKK7U0WtQceU5l0W3wzq4Yc+QDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"605ea3d3a11228bc9694c422ebd4f93b87c64828d7dc7d7b49f806ffa67e36e0","last_reissued_at":"2026-05-18T00:12:38.090387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:38.090387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.08841","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-05-18T00:12:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cpSDrzTBIWOhhWQHXzCHmq2v/IPnqxVt7dI5NTLFKYizSja4TZ1AtG462Y0hx7m2V590LJdI7QU68rqsBEMdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:34:48.260380Z"},"content_sha256":"b019e182e82e0471adc97b5624aa7e4e5007edac5464f8be28913c2b3f2cf7dc","schema_version":"1.0","event_id":"sha256:b019e182e82e0471adc97b5624aa7e4e5007edac5464f8be28913c2b3f2cf7dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MBPKHU5BCIULZFUUYQROXVHZHO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DC","authors_text":"Christopher De Sa, Dan Alistarh, Nikola Konstantinov","submitted_at":"2018-03-23T15:32:42Z","abstract_excerpt":"Stochastic Gradient Descent (SGD) is a fundamental algorithm in machine learning, representing the optimization backbone for training several classic models, from regression to neural networks. Given the recent practical focus on distributed machine learning, significant work has been dedicated to the convergence properties of this algorithm under the inconsistent and noisy updates arising from execution in a distributed environment. However, surprisingly, the convergence properties of this classic algorithm in the standard shared-memory model are still not well-understood.\n  In this work, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08841","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":""},"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:12:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WT71R1coTOM6FNuaAz4gLceO/KWC6bYONuex/mEaJMgYiCAxP/RFBIZAjLkVApYdeo4hPC4/+EGywT1KrHA/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:34:48.261030Z"},"content_sha256":"63de9f3f34316d582f95775383151d6b6aa81d93f9cb4fd6b4e95d20411cffea","schema_version":"1.0","event_id":"sha256:63de9f3f34316d582f95775383151d6b6aa81d93f9cb4fd6b4e95d20411cffea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBPKHU5BCIULZFUUYQROXVHZHO/bundle.json","state_url":"https://pith.science/pith/MBPKHU5BCIULZFUUYQROXVHZHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBPKHU5BCIULZFUUYQROXVHZHO/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-06-08T09:34:48Z","links":{"resolver":"https://pith.science/pith/MBPKHU5BCIULZFUUYQROXVHZHO","bundle":"https://pith.science/pith/MBPKHU5BCIULZFUUYQROXVHZHO/bundle.json","state":"https://pith.science/pith/MBPKHU5BCIULZFUUYQROXVHZHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBPKHU5BCIULZFUUYQROXVHZHO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MBPKHU5BCIULZFUUYQROXVHZHO","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":"9a131e3cc6c6ae294224f36d69cd3f2d0d0b614843421f2631e13ccc7c77c36f","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-23T15:32:42Z","title_canon_sha256":"68abae7ccdef09a3bbac456b2532be16d4363c737370066588e8848f9d38ef21"},"schema_version":"1.0","source":{"id":"1803.08841","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08841","created_at":"2026-05-18T00:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08841v2","created_at":"2026-05-18T00:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08841","created_at":"2026-05-18T00:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"MBPKHU5BCIUL","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MBPKHU5BCIULZFUU","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MBPKHU5B","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:63de9f3f34316d582f95775383151d6b6aa81d93f9cb4fd6b4e95d20411cffea","target":"graph","created_at":"2026-05-18T00:12: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":"Stochastic Gradient Descent (SGD) is a fundamental algorithm in machine learning, representing the optimization backbone for training several classic models, from regression to neural networks. Given the recent practical focus on distributed machine learning, significant work has been dedicated to the convergence properties of this algorithm under the inconsistent and noisy updates arising from execution in a distributed environment. However, surprisingly, the convergence properties of this classic algorithm in the standard shared-memory model are still not well-understood.\n  In this work, we ","authors_text":"Christopher De Sa, Dan Alistarh, Nikola Konstantinov","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-23T15:32:42Z","title":"The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08841","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:b019e182e82e0471adc97b5624aa7e4e5007edac5464f8be28913c2b3f2cf7dc","target":"record","created_at":"2026-05-18T00:12: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":"9a131e3cc6c6ae294224f36d69cd3f2d0d0b614843421f2631e13ccc7c77c36f","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-23T15:32:42Z","title_canon_sha256":"68abae7ccdef09a3bbac456b2532be16d4363c737370066588e8848f9d38ef21"},"schema_version":"1.0","source":{"id":"1803.08841","kind":"arxiv","version":2}},"canonical_sha256":"605ea3d3a11228bc9694c422ebd4f93b87c64828d7dc7d7b49f806ffa67e36e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"605ea3d3a11228bc9694c422ebd4f93b87c64828d7dc7d7b49f806ffa67e36e0","first_computed_at":"2026-05-18T00:12:38.090387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:38.090387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VaqRxBBkwMKPE33SMO1x8J+19Rxnlon8l4qDCsKc5Aac1Za5PGIOUEPyRNzKK7U0WtQceU5l0W3wzq4Yc+QDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:38.091114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.08841","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b019e182e82e0471adc97b5624aa7e4e5007edac5464f8be28913c2b3f2cf7dc","sha256:63de9f3f34316d582f95775383151d6b6aa81d93f9cb4fd6b4e95d20411cffea"],"state_sha256":"59c1355775af4b6f9ea28bbf7ef9c4a401ca657a78c057e5a8647e8d55458ff8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1scKy8qcQgYb8FeMlBzPeEaxLBKAC5mYYDxRLJa05rQBXA8Z1w4LAYYZ2EPuX0P0TGOIFSw0xzkADhSVU9R+Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T09:34:48.264648Z","bundle_sha256":"b47987c80e608bf45fb213493921f7bc6fc6b9fd4cbaaa3ca501243aefea240c"}}