{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZXICEO2NUUPKMKXKY3VII5WPQS","short_pith_number":"pith:ZXICEO2N","canonical_record":{"source":{"id":"1106.5730","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-06-28T17:23:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"eb7c141fa33c31ba276cb388539fe68b0994446864de7f20429cc5df569d025b","abstract_canon_sha256":"d73ccb752d61d5b0d811a7ce9110625e1578233697d11835c06722c383ea11c6"},"schema_version":"1.0"},"canonical_sha256":"cdd0223b4da51ea62aeac6ea8476cf849128c687907f9f03c1f08dc176733ca6","source":{"kind":"arxiv","id":"1106.5730","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5730","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5730v2","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5730","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZXICEO2NUUPK","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZXICEO2NUUPKMKXK","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZXICEO2N","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZXICEO2NUUPKMKXKY3VII5WPQS","target":"record","payload":{"canonical_record":{"source":{"id":"1106.5730","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-06-28T17:23:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"eb7c141fa33c31ba276cb388539fe68b0994446864de7f20429cc5df569d025b","abstract_canon_sha256":"d73ccb752d61d5b0d811a7ce9110625e1578233697d11835c06722c383ea11c6"},"schema_version":"1.0"},"canonical_sha256":"cdd0223b4da51ea62aeac6ea8476cf849128c687907f9f03c1f08dc176733ca6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:33.461269Z","signature_b64":"N2hiEF5FUj2QZ5jwu0GB34lvWXjBZl99vpLlFsMIBcY0lG1LUAbKShyWnRJFC2a01Q1XAPCi0EpT7UmWpy4BCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdd0223b4da51ea62aeac6ea8476cf849128c687907f9f03c1f08dc176733ca6","last_reissued_at":"2026-05-18T04:08:33.460526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:33.460526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.5730","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-18T04:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/WyeVjkc9mYKm3/l5z9njepFGjqg+qqvNzb9XbbOLKxqnp25ifbnorHA/RxJA0IV43i8XyNpDz/FCYiXctZwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:56:22.176439Z"},"content_sha256":"0a856915d41dd77f1603373052a5e234b1b4d7403384640877e16602714d7a77","schema_version":"1.0","event_id":"sha256:0a856915d41dd77f1603373052a5e234b1b4d7403384640877e16602714d7a77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZXICEO2NUUPKMKXKY3VII5WPQS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HOGWILD!: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Benjamin Recht, Christopher Re, Feng Niu, Stephen J. Wright","submitted_at":"2011-06-28T17:23:42Z","abstract_excerpt":"Stochastic Gradient Descent (SGD) is a popular algorithm that can achieve state-of-the-art performance on a variety of machine learning tasks. Several researchers have recently proposed schemes to parallelize SGD, but all require performance-destroying memory locking and synchronization. This work aims to show using novel theoretical analysis, algorithms, and implementation that SGD can be implemented without any locking. We present an update scheme called HOGWILD! which allows processors access to shared memory with the possibility of overwriting each other's work. We show that when the assoc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5730","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-18T04:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MNA3AZxuJ/4SMBmyAZtMseHEubTmUYwrMIAaNO8aEllky2cJR7sZVShXJ6/aySsqJD8Nc2qKTEbt1tYW923RCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:56:22.177020Z"},"content_sha256":"42d84998903cd28e9b148f98daf80b2566f55546ebdcf6f68574c6d98b6c2a5b","schema_version":"1.0","event_id":"sha256:42d84998903cd28e9b148f98daf80b2566f55546ebdcf6f68574c6d98b6c2a5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXICEO2NUUPKMKXKY3VII5WPQS/bundle.json","state_url":"https://pith.science/pith/ZXICEO2NUUPKMKXKY3VII5WPQS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXICEO2NUUPKMKXKY3VII5WPQS/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-30T03:56:22Z","links":{"resolver":"https://pith.science/pith/ZXICEO2NUUPKMKXKY3VII5WPQS","bundle":"https://pith.science/pith/ZXICEO2NUUPKMKXKY3VII5WPQS/bundle.json","state":"https://pith.science/pith/ZXICEO2NUUPKMKXKY3VII5WPQS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXICEO2NUUPKMKXKY3VII5WPQS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZXICEO2NUUPKMKXKY3VII5WPQS","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":"d73ccb752d61d5b0d811a7ce9110625e1578233697d11835c06722c383ea11c6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-06-28T17:23:42Z","title_canon_sha256":"eb7c141fa33c31ba276cb388539fe68b0994446864de7f20429cc5df569d025b"},"schema_version":"1.0","source":{"id":"1106.5730","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5730","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5730v2","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5730","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZXICEO2NUUPK","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZXICEO2NUUPKMKXK","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZXICEO2N","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:42d84998903cd28e9b148f98daf80b2566f55546ebdcf6f68574c6d98b6c2a5b","target":"graph","created_at":"2026-05-18T04:08:33Z","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 popular algorithm that can achieve state-of-the-art performance on a variety of machine learning tasks. Several researchers have recently proposed schemes to parallelize SGD, but all require performance-destroying memory locking and synchronization. This work aims to show using novel theoretical analysis, algorithms, and implementation that SGD can be implemented without any locking. We present an update scheme called HOGWILD! which allows processors access to shared memory with the possibility of overwriting each other's work. We show that when the assoc","authors_text":"Benjamin Recht, Christopher Re, Feng Niu, Stephen J. Wright","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-06-28T17:23:42Z","title":"HOGWILD!: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5730","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:0a856915d41dd77f1603373052a5e234b1b4d7403384640877e16602714d7a77","target":"record","created_at":"2026-05-18T04:08:33Z","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":"d73ccb752d61d5b0d811a7ce9110625e1578233697d11835c06722c383ea11c6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-06-28T17:23:42Z","title_canon_sha256":"eb7c141fa33c31ba276cb388539fe68b0994446864de7f20429cc5df569d025b"},"schema_version":"1.0","source":{"id":"1106.5730","kind":"arxiv","version":2}},"canonical_sha256":"cdd0223b4da51ea62aeac6ea8476cf849128c687907f9f03c1f08dc176733ca6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdd0223b4da51ea62aeac6ea8476cf849128c687907f9f03c1f08dc176733ca6","first_computed_at":"2026-05-18T04:08:33.460526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:33.460526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N2hiEF5FUj2QZ5jwu0GB34lvWXjBZl99vpLlFsMIBcY0lG1LUAbKShyWnRJFC2a01Q1XAPCi0EpT7UmWpy4BCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:33.461269Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.5730","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a856915d41dd77f1603373052a5e234b1b4d7403384640877e16602714d7a77","sha256:42d84998903cd28e9b148f98daf80b2566f55546ebdcf6f68574c6d98b6c2a5b"],"state_sha256":"402c1379e6c4228c3f09fbfc961f7a353d440552ffda892fa9629589a36ea9c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kXgQUx/dsJFOxUEhDwThRbsvHfNzAHPBcNgOmlg+fsKEqjOjdxV9iWIpFtVQjO1bTq6Spnr4KzVeskRUFqgBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:56:22.180170Z","bundle_sha256":"6b62895c8d38046b60881ee7bb16f4e2f0eda1f111f23e2036fd2e1f26b461e8"}}