{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:H4VRRKJYN4H7SMINLGDLRBG55I","short_pith_number":"pith:H4VRRKJY","canonical_record":{"source":{"id":"1912.02365","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-05T03:37:44Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"b16ea3a7c39e95de6c0ca558094ffd9e74e779868da6eb8574f6d041d877b09a","abstract_canon_sha256":"b5ef3fd0e7ac9d9b3f8d0a42c78bf08edcf9d0c3a33c2d9d4246b8b8373cc0a7"},"schema_version":"1.0"},"canonical_sha256":"3f2b18a9386f0ff9310d5986b884ddea2c82548c4921a52860a78224f88a2509","source":{"kind":"arxiv","id":"1912.02365","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.02365","created_at":"2026-07-05T04:00:10Z"},{"alias_kind":"arxiv_version","alias_value":"1912.02365v2","created_at":"2026-07-05T04:00:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.02365","created_at":"2026-07-05T04:00:10Z"},{"alias_kind":"pith_short_12","alias_value":"H4VRRKJYN4H7","created_at":"2026-07-05T04:00:10Z"},{"alias_kind":"pith_short_16","alias_value":"H4VRRKJYN4H7SMIN","created_at":"2026-07-05T04:00:10Z"},{"alias_kind":"pith_short_8","alias_value":"H4VRRKJY","created_at":"2026-07-05T04:00:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:H4VRRKJYN4H7SMINLGDLRBG55I","target":"record","payload":{"canonical_record":{"source":{"id":"1912.02365","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-05T03:37:44Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"b16ea3a7c39e95de6c0ca558094ffd9e74e779868da6eb8574f6d041d877b09a","abstract_canon_sha256":"b5ef3fd0e7ac9d9b3f8d0a42c78bf08edcf9d0c3a33c2d9d4246b8b8373cc0a7"},"schema_version":"1.0"},"canonical_sha256":"3f2b18a9386f0ff9310d5986b884ddea2c82548c4921a52860a78224f88a2509","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:00:10.989840Z","signature_b64":"hLLlxQVpl7U//D34YjhDXydDMNSLEvQzmcZftZyavX0lRg6BPWOZAD/jIbkMCdT2O5PekI+pgUZl5D/R9pgUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f2b18a9386f0ff9310d5986b884ddea2c82548c4921a52860a78224f88a2509","last_reissued_at":"2026-07-05T04:00:10.989386Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:00:10.989386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1912.02365","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-07-05T04:00:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JxD88hNuRFE1l6i3ct9+cWxFu2N0FxQNQcHwe9yGKG6+1Cwnj2a1nuIMFCtaZ5RiG+CBjRbAqBjeJ3DDSlpUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T06:19:59.325202Z"},"content_sha256":"dc36302bdbbeffabece777c4ff64c8929d5e82a818d9cdaedb7ce6980570572b","schema_version":"1.0","event_id":"sha256:dc36302bdbbeffabece777c4ff64c8929d5e82a818d9cdaedb7ce6980570572b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:H4VRRKJYN4H7SMINLGDLRBG55I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Non-Convex Stochastic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML"],"primary_cat":"math.OC","authors_text":"Blake Woodworth, Dylan J. Foster, John C. Duchi, Nathan Srebro, Yair Carmon, Yossi Arjevani","submitted_at":"2019-12-05T03:37:44Z","abstract_excerpt":"We lower bound the complexity of finding $\\epsilon$-stationary points (with gradient norm at most $\\epsilon$) using stochastic first-order methods. In a well-studied model where algorithms access smooth, potentially non-convex functions through queries to an unbiased stochastic gradient oracle with bounded variance, we prove that (in the worst case) any algorithm requires at least $\\epsilon^{-4}$ queries to find an $\\epsilon$ stationary point. The lower bound is tight, and establishes that stochastic gradient descent is minimax optimal in this model. In a more restrictive model where the noisy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.02365","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.02365/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:00:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h9yxx2kFfHpJjBjctW1GEl+4Mw7iu0S2OZn0UyVlp9zkBeNAZ41PaGADGDyxoW5yGxRfNMe7SL8580glhrcPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T06:19:59.326018Z"},"content_sha256":"34e970c4da5d4320d66b29b46f7d9a609b5615f67fe5c4aeb97e08a453590286","schema_version":"1.0","event_id":"sha256:34e970c4da5d4320d66b29b46f7d9a609b5615f67fe5c4aeb97e08a453590286"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H4VRRKJYN4H7SMINLGDLRBG55I/bundle.json","state_url":"https://pith.science/pith/H4VRRKJYN4H7SMINLGDLRBG55I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H4VRRKJYN4H7SMINLGDLRBG55I/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-08-08T06:19:59Z","links":{"resolver":"https://pith.science/pith/H4VRRKJYN4H7SMINLGDLRBG55I","bundle":"https://pith.science/pith/H4VRRKJYN4H7SMINLGDLRBG55I/bundle.json","state":"https://pith.science/pith/H4VRRKJYN4H7SMINLGDLRBG55I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H4VRRKJYN4H7SMINLGDLRBG55I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:H4VRRKJYN4H7SMINLGDLRBG55I","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":"b5ef3fd0e7ac9d9b3f8d0a42c78bf08edcf9d0c3a33c2d9d4246b8b8373cc0a7","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-05T03:37:44Z","title_canon_sha256":"b16ea3a7c39e95de6c0ca558094ffd9e74e779868da6eb8574f6d041d877b09a"},"schema_version":"1.0","source":{"id":"1912.02365","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.02365","created_at":"2026-07-05T04:00:10Z"},{"alias_kind":"arxiv_version","alias_value":"1912.02365v2","created_at":"2026-07-05T04:00:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.02365","created_at":"2026-07-05T04:00:10Z"},{"alias_kind":"pith_short_12","alias_value":"H4VRRKJYN4H7","created_at":"2026-07-05T04:00:10Z"},{"alias_kind":"pith_short_16","alias_value":"H4VRRKJYN4H7SMIN","created_at":"2026-07-05T04:00:10Z"},{"alias_kind":"pith_short_8","alias_value":"H4VRRKJY","created_at":"2026-07-05T04:00:10Z"}],"graph_snapshots":[{"event_id":"sha256:34e970c4da5d4320d66b29b46f7d9a609b5615f67fe5c4aeb97e08a453590286","target":"graph","created_at":"2026-07-05T04:00:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1912.02365/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We lower bound the complexity of finding $\\epsilon$-stationary points (with gradient norm at most $\\epsilon$) using stochastic first-order methods. In a well-studied model where algorithms access smooth, potentially non-convex functions through queries to an unbiased stochastic gradient oracle with bounded variance, we prove that (in the worst case) any algorithm requires at least $\\epsilon^{-4}$ queries to find an $\\epsilon$ stationary point. The lower bound is tight, and establishes that stochastic gradient descent is minimax optimal in this model. In a more restrictive model where the noisy","authors_text":"Blake Woodworth, Dylan J. Foster, John C. Duchi, Nathan Srebro, Yair Carmon, Yossi Arjevani","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-05T03:37:44Z","title":"Lower Bounds for Non-Convex Stochastic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.02365","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:dc36302bdbbeffabece777c4ff64c8929d5e82a818d9cdaedb7ce6980570572b","target":"record","created_at":"2026-07-05T04:00:10Z","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":"b5ef3fd0e7ac9d9b3f8d0a42c78bf08edcf9d0c3a33c2d9d4246b8b8373cc0a7","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-05T03:37:44Z","title_canon_sha256":"b16ea3a7c39e95de6c0ca558094ffd9e74e779868da6eb8574f6d041d877b09a"},"schema_version":"1.0","source":{"id":"1912.02365","kind":"arxiv","version":2}},"canonical_sha256":"3f2b18a9386f0ff9310d5986b884ddea2c82548c4921a52860a78224f88a2509","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f2b18a9386f0ff9310d5986b884ddea2c82548c4921a52860a78224f88a2509","first_computed_at":"2026-07-05T04:00:10.989386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:00:10.989386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hLLlxQVpl7U//D34YjhDXydDMNSLEvQzmcZftZyavX0lRg6BPWOZAD/jIbkMCdT2O5PekI+pgUZl5D/R9pgUBA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:00:10.989840Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.02365","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc36302bdbbeffabece777c4ff64c8929d5e82a818d9cdaedb7ce6980570572b","sha256:34e970c4da5d4320d66b29b46f7d9a609b5615f67fe5c4aeb97e08a453590286"],"state_sha256":"b229e670c9d040e5f77e97e30f9c63faee4943c00d4379fece14871476992f95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hAzKhuHrudkMLK2sc56cGWWx+QdDw72ts+dlRsOlhMX2m/yGhuZnBaw8igbTN8BRodYWAvUV5xQW6wFaY9cpBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T06:19:59.331433Z","bundle_sha256":"2872d59c4b75f7b61af39d52dbb0c1f1591014566cc62cf681451baf81167ca6"}}