{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WYTEMGKPU4KMNF45Q7QEY6RLVG","short_pith_number":"pith:WYTEMGKP","canonical_record":{"source":{"id":"1508.00882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-04T19:35:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a21f271f9f2c35d0f0b38ab2da7d1b2a991563938fedf83bd03fc7ef4795f5dd","abstract_canon_sha256":"6a7c1a5826f227653fbcef7ba311a6ddd7bc4e33b2dc0111d036468003f018de"},"schema_version":"1.0"},"canonical_sha256":"b62646194fa714c6979d87e04c7a2ba98869982491d17b2e03817d53c99dd99f","source":{"kind":"arxiv","id":"1508.00882","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00882","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00882v1","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00882","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"pith_short_12","alias_value":"WYTEMGKPU4KM","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WYTEMGKPU4KMNF45","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WYTEMGKP","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WYTEMGKPU4KMNF45Q7QEY6RLVG","target":"record","payload":{"canonical_record":{"source":{"id":"1508.00882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-04T19:35:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a21f271f9f2c35d0f0b38ab2da7d1b2a991563938fedf83bd03fc7ef4795f5dd","abstract_canon_sha256":"6a7c1a5826f227653fbcef7ba311a6ddd7bc4e33b2dc0111d036468003f018de"},"schema_version":"1.0"},"canonical_sha256":"b62646194fa714c6979d87e04c7a2ba98869982491d17b2e03817d53c99dd99f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:53.128268Z","signature_b64":"7cPiuJ9pc5Ee+RJhCsF17Kl8wH0pYw2ey1e62Ny5nYW6/HMa/N5YeueyU79iMEdKPpGSsmjGFwsIKJ0ABvLNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b62646194fa714c6979d87e04c7a2ba98869982491d17b2e03817d53c99dd99f","last_reissued_at":"2026-05-18T01:35:53.127504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:53.127504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.00882","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-18T01:35:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KwxDWPvImtYdvaoW5UdbLdBY61Z2+gXtwU+kxNmlcESM+i5JN6tusEeNtVEzKUqW8yvDVyN7iFq3pFbKR2OlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:30:07.940921Z"},"content_sha256":"448eac70d892512edd78dace0f1b9231b0e91fdca47665fd2b25342342ce24a2","schema_version":"1.0","event_id":"sha256:448eac70d892512edd78dace0f1b9231b0e91fdca47665fd2b25342342ce24a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WYTEMGKPU4KMNF45Q7QEY6RLVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous stochastic convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Christopher R\\'e, John C. Duchi, Sorathan Chaturapruek","submitted_at":"2015-08-04T19:35:49Z","abstract_excerpt":"We show that asymptotically, completely asynchronous stochastic gradient procedures achieve optimal (even to constant factors) convergence rates for the solution of convex optimization problems under nearly the same conditions required for asymptotic optimality of standard stochastic gradient procedures. Roughly, the noise inherent to the stochastic approximation scheme dominates any noise from asynchrony. We also give empirical evidence demonstrating the strong performance of asynchronous, parallel stochastic optimization schemes, demonstrating that the robustness inherent to stochastic appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00882","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-18T01:35:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ufA8uuflXtG0J4Y0BayTicPzEESaQJY6hXcHJqCGKdD8FA/0CXZ1+N53UAolwW36LBe5hMXNDqFqn6NjP5LAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:30:07.941264Z"},"content_sha256":"9b4bdcd0a0584603aecd854ff659f6485b0fc66294f5be5899fffe7499a520d9","schema_version":"1.0","event_id":"sha256:9b4bdcd0a0584603aecd854ff659f6485b0fc66294f5be5899fffe7499a520d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WYTEMGKPU4KMNF45Q7QEY6RLVG/bundle.json","state_url":"https://pith.science/pith/WYTEMGKPU4KMNF45Q7QEY6RLVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WYTEMGKPU4KMNF45Q7QEY6RLVG/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-27T08:30:07Z","links":{"resolver":"https://pith.science/pith/WYTEMGKPU4KMNF45Q7QEY6RLVG","bundle":"https://pith.science/pith/WYTEMGKPU4KMNF45Q7QEY6RLVG/bundle.json","state":"https://pith.science/pith/WYTEMGKPU4KMNF45Q7QEY6RLVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WYTEMGKPU4KMNF45Q7QEY6RLVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WYTEMGKPU4KMNF45Q7QEY6RLVG","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":"6a7c1a5826f227653fbcef7ba311a6ddd7bc4e33b2dc0111d036468003f018de","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-04T19:35:49Z","title_canon_sha256":"a21f271f9f2c35d0f0b38ab2da7d1b2a991563938fedf83bd03fc7ef4795f5dd"},"schema_version":"1.0","source":{"id":"1508.00882","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00882","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00882v1","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00882","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"pith_short_12","alias_value":"WYTEMGKPU4KM","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WYTEMGKPU4KMNF45","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WYTEMGKP","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:9b4bdcd0a0584603aecd854ff659f6485b0fc66294f5be5899fffe7499a520d9","target":"graph","created_at":"2026-05-18T01:35:53Z","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":"We show that asymptotically, completely asynchronous stochastic gradient procedures achieve optimal (even to constant factors) convergence rates for the solution of convex optimization problems under nearly the same conditions required for asymptotic optimality of standard stochastic gradient procedures. Roughly, the noise inherent to the stochastic approximation scheme dominates any noise from asynchrony. We also give empirical evidence demonstrating the strong performance of asynchronous, parallel stochastic optimization schemes, demonstrating that the robustness inherent to stochastic appro","authors_text":"Christopher R\\'e, John C. Duchi, Sorathan Chaturapruek","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-04T19:35:49Z","title":"Asynchronous stochastic convex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00882","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:448eac70d892512edd78dace0f1b9231b0e91fdca47665fd2b25342342ce24a2","target":"record","created_at":"2026-05-18T01:35:53Z","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":"6a7c1a5826f227653fbcef7ba311a6ddd7bc4e33b2dc0111d036468003f018de","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-04T19:35:49Z","title_canon_sha256":"a21f271f9f2c35d0f0b38ab2da7d1b2a991563938fedf83bd03fc7ef4795f5dd"},"schema_version":"1.0","source":{"id":"1508.00882","kind":"arxiv","version":1}},"canonical_sha256":"b62646194fa714c6979d87e04c7a2ba98869982491d17b2e03817d53c99dd99f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b62646194fa714c6979d87e04c7a2ba98869982491d17b2e03817d53c99dd99f","first_computed_at":"2026-05-18T01:35:53.127504Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:53.127504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7cPiuJ9pc5Ee+RJhCsF17Kl8wH0pYw2ey1e62Ny5nYW6/HMa/N5YeueyU79iMEdKPpGSsmjGFwsIKJ0ABvLNDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:53.128268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.00882","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:448eac70d892512edd78dace0f1b9231b0e91fdca47665fd2b25342342ce24a2","sha256:9b4bdcd0a0584603aecd854ff659f6485b0fc66294f5be5899fffe7499a520d9"],"state_sha256":"9b6fe3e42aa3c50688ec09815c9af42eaef95fef36a0de794112741bd109b018"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mMEbsPovxK9pw2TNCdGqEPxrucaElrlRXArhwzB6qmv27MtgEaB8vpRDZdL8cnACEq7A7not95y26Ow497ldBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T08:30:07.943130Z","bundle_sha256":"52df0d8d6135919546ba748bb623904e1d2937468b915b4e9f4606a674dced5c"}}