{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SG7BVU4KSDAVP32JCPJGXBXZO4","short_pith_number":"pith:SG7BVU4K","canonical_record":{"source":{"id":"1801.03749","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-11T13:31:33Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5720c195c4e3c4c3e5fb32f051f47dae8f537a9a7987ba6affbcaf9b92e66ace","abstract_canon_sha256":"d61b086194fe09eb1cb8243382760ade078ce56e3863fa6b9fbb9bdc2b68fb07"},"schema_version":"1.0"},"canonical_sha256":"91be1ad38a90c157ef4913d26b86f9770f6b6e74c61f3114bcf3a0705361396a","source":{"kind":"arxiv","id":"1801.03749","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03749","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03749v3","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03749","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"pith_short_12","alias_value":"SG7BVU4KSDAV","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SG7BVU4KSDAVP32J","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SG7BVU4K","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SG7BVU4KSDAVP32JCPJGXBXZO4","target":"record","payload":{"canonical_record":{"source":{"id":"1801.03749","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-11T13:31:33Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5720c195c4e3c4c3e5fb32f051f47dae8f537a9a7987ba6affbcaf9b92e66ace","abstract_canon_sha256":"d61b086194fe09eb1cb8243382760ade078ce56e3863fa6b9fbb9bdc2b68fb07"},"schema_version":"1.0"},"canonical_sha256":"91be1ad38a90c157ef4913d26b86f9770f6b6e74c61f3114bcf3a0705361396a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:34.262734Z","signature_b64":"CWM82POwlnCjrtjzAoEhAJk8dIYvbRWhxWsPJzDxUAqMuDLWnAnE/WxyUtOKkGpoTy18I8+DZnyOOhx4LwCjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91be1ad38a90c157ef4913d26b86f9770f6b6e74c61f3114bcf3a0705361396a","last_reissued_at":"2026-05-17T23:50:34.262117Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:34.262117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.03749","source_version":3,"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-17T23:50:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pnPNHVAKBO1EoJcoNFj2w2jvX88FzxuBQ/E/UNOn6qKeEKr4YG2dpwITVi78x6pvRoLUxRoaTmxhLy3Vx8aaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:17:38.278439Z"},"content_sha256":"13dda6dc01434542fc79bb20072575670df98cce09daaefe02a9498b95938cc6","schema_version":"1.0","event_id":"sha256:13dda6dc01434542fc79bb20072575670df98cce09daaefe02a9498b95938cc6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SG7BVU4KSDAVP32JCPJGXBXZO4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved asynchronous parallel optimization analysis for stochastic incremental methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Fabian Pedregosa, R\\'emi Leblond, Simon Lacoste-Julien","submitted_at":"2018-01-11T13:31:33Z","abstract_excerpt":"As datasets continue to increase in size and multi-core computer architectures are developed, asynchronous parallel optimization algorithms become more and more essential to the field of Machine Learning. Unfortunately, conducting the theoretical analysis asynchronous methods is difficult, notably due to the introduction of delay and inconsistency in inherently sequential algorithms. Handling these issues often requires resorting to simplifying but unrealistic assumptions. Through a novel perspective, we revisit and clarify a subtle but important technical issue present in a large fraction of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03749","kind":"arxiv","version":3},"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-17T23:50:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dFhvRC6TNhkxveM6lv0HsS7Rgz400S/NLsSzyZ3Jz5OlRYpnlaiUiek2lBltRdGiLzW19XFl+csqdDebaL+IBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:17:38.278780Z"},"content_sha256":"21e3fd115240832d98c556add9913ad90d69cae3e68cd0794dc1f9ae5f5ce31f","schema_version":"1.0","event_id":"sha256:21e3fd115240832d98c556add9913ad90d69cae3e68cd0794dc1f9ae5f5ce31f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SG7BVU4KSDAVP32JCPJGXBXZO4/bundle.json","state_url":"https://pith.science/pith/SG7BVU4KSDAVP32JCPJGXBXZO4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SG7BVU4KSDAVP32JCPJGXBXZO4/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-03T16:17:38Z","links":{"resolver":"https://pith.science/pith/SG7BVU4KSDAVP32JCPJGXBXZO4","bundle":"https://pith.science/pith/SG7BVU4KSDAVP32JCPJGXBXZO4/bundle.json","state":"https://pith.science/pith/SG7BVU4KSDAVP32JCPJGXBXZO4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SG7BVU4KSDAVP32JCPJGXBXZO4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SG7BVU4KSDAVP32JCPJGXBXZO4","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":"d61b086194fe09eb1cb8243382760ade078ce56e3863fa6b9fbb9bdc2b68fb07","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-11T13:31:33Z","title_canon_sha256":"5720c195c4e3c4c3e5fb32f051f47dae8f537a9a7987ba6affbcaf9b92e66ace"},"schema_version":"1.0","source":{"id":"1801.03749","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03749","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03749v3","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03749","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"pith_short_12","alias_value":"SG7BVU4KSDAV","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SG7BVU4KSDAVP32J","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SG7BVU4K","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:21e3fd115240832d98c556add9913ad90d69cae3e68cd0794dc1f9ae5f5ce31f","target":"graph","created_at":"2026-05-17T23:50:34Z","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":"As datasets continue to increase in size and multi-core computer architectures are developed, asynchronous parallel optimization algorithms become more and more essential to the field of Machine Learning. Unfortunately, conducting the theoretical analysis asynchronous methods is difficult, notably due to the introduction of delay and inconsistency in inherently sequential algorithms. Handling these issues often requires resorting to simplifying but unrealistic assumptions. Through a novel perspective, we revisit and clarify a subtle but important technical issue present in a large fraction of ","authors_text":"Fabian Pedregosa, R\\'emi Leblond, Simon Lacoste-Julien","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-11T13:31:33Z","title":"Improved asynchronous parallel optimization analysis for stochastic incremental methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03749","kind":"arxiv","version":3},"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:13dda6dc01434542fc79bb20072575670df98cce09daaefe02a9498b95938cc6","target":"record","created_at":"2026-05-17T23:50:34Z","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":"d61b086194fe09eb1cb8243382760ade078ce56e3863fa6b9fbb9bdc2b68fb07","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-11T13:31:33Z","title_canon_sha256":"5720c195c4e3c4c3e5fb32f051f47dae8f537a9a7987ba6affbcaf9b92e66ace"},"schema_version":"1.0","source":{"id":"1801.03749","kind":"arxiv","version":3}},"canonical_sha256":"91be1ad38a90c157ef4913d26b86f9770f6b6e74c61f3114bcf3a0705361396a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91be1ad38a90c157ef4913d26b86f9770f6b6e74c61f3114bcf3a0705361396a","first_computed_at":"2026-05-17T23:50:34.262117Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:34.262117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CWM82POwlnCjrtjzAoEhAJk8dIYvbRWhxWsPJzDxUAqMuDLWnAnE/WxyUtOKkGpoTy18I8+DZnyOOhx4LwCjDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:34.262734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.03749","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13dda6dc01434542fc79bb20072575670df98cce09daaefe02a9498b95938cc6","sha256:21e3fd115240832d98c556add9913ad90d69cae3e68cd0794dc1f9ae5f5ce31f"],"state_sha256":"a7de0d0cc01be096e6fa86aefb31ab690f71f45ff15f67fc70dfd161fdace7df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w9X0XVg+dZC/OJLMa575H72zqpc90UUcPELSg7fr9B5euSGR6SeCrpb91SSgHFj/siYgqXNYWzGvxGYuQ8ReBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:17:38.280653Z","bundle_sha256":"1eac0c08a5113c7900df7151f46c5d06303c47df1d26eb9720e8d6dee97fd379"}}