{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3FJWYQ4AH6QJTNE3QWBUEYDAMM","short_pith_number":"pith:3FJWYQ4A","canonical_record":{"source":{"id":"1711.00841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-02T17:52:08Z","cross_cats_sorted":[],"title_canon_sha256":"ef8b2ef02fb4dca171e569fa30877289b8fae4d3213e8d1b42e586b56fa17a66","abstract_canon_sha256":"669d5ca4fa82a29af8dea0ebf6149a14705208af5b7e10e69df11055f97c97ab"},"schema_version":"1.0"},"canonical_sha256":"d9536c43803fa099b49b8583426060633fe98ac6dd32d04e93c22ae5ef2a1773","source":{"kind":"arxiv","id":"1711.00841","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00841","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00841v1","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00841","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"pith_short_12","alias_value":"3FJWYQ4AH6QJ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3FJWYQ4AH6QJTNE3","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3FJWYQ4A","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3FJWYQ4AH6QJTNE3QWBUEYDAMM","target":"record","payload":{"canonical_record":{"source":{"id":"1711.00841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-02T17:52:08Z","cross_cats_sorted":[],"title_canon_sha256":"ef8b2ef02fb4dca171e569fa30877289b8fae4d3213e8d1b42e586b56fa17a66","abstract_canon_sha256":"669d5ca4fa82a29af8dea0ebf6149a14705208af5b7e10e69df11055f97c97ab"},"schema_version":"1.0"},"canonical_sha256":"d9536c43803fa099b49b8583426060633fe98ac6dd32d04e93c22ae5ef2a1773","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:29.381627Z","signature_b64":"9ueaPKwbEUp8MVnvKhpk+E9TKr9ina4eDOii3yPZVfX37mlvAO6u2Sm/FbjsIBSnnMcvja5EtxI5qbeeNOe6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9536c43803fa099b49b8583426060633fe98ac6dd32d04e93c22ae5ef2a1773","last_reissued_at":"2026-05-18T00:31:29.380936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:29.380936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.00841","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-18T00:31:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WHFuVLOON8MzLwiDqdfoDAyUixDDAM2nyvzUzGa34tQ8LziP9I7hHfX9aK3fEGfp4LAVbq+XcSDqMuKu9vp9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T19:29:59.427575Z"},"content_sha256":"fbe23a8b3a77dda95b27748f476e0d39cbb9463ece60660e48f84a70ccf73b53","schema_version":"1.0","event_id":"sha256:fbe23a8b3a77dda95b27748f476e0d39cbb9463ece60660e48f84a70ccf73b53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3FJWYQ4AH6QJTNE3QWBUEYDAMM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Finding Stationary Points II: First-Order Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aaron Sidford, John C. Duchi, Oliver Hinder, Yair Carmon","submitted_at":"2017-11-02T17:52:08Z","abstract_excerpt":"We establish lower bounds on the complexity of finding $\\epsilon$-stationary points of smooth, non-convex high-dimensional functions using first-order methods. We prove that deterministic first-order methods, even applied to arbitrarily smooth functions, cannot achieve convergence rates in $\\epsilon$ better than $\\epsilon^{-8/5}$, which is within $\\epsilon^{-1/15}\\log\\frac{1}{\\epsilon}$ of the best known rate for such methods. Moreover, for functions with Lipschitz first and second derivatives, we prove no deterministic first-order method can achieve convergence rates better than $\\epsilon^{-1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00841","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-18T00:31:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"famW1wGGqaf8aaqP3beMcR2i/WRBgxAo34nmZ0yYNnptrUYTjDA5K1+7bc4xRCg460F7+D83Bef0/X6aHiPaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T19:29:59.428049Z"},"content_sha256":"53682e7d96216f18f5268831f347414a52f2c16e4c37f2566fb85156d2480684","schema_version":"1.0","event_id":"sha256:53682e7d96216f18f5268831f347414a52f2c16e4c37f2566fb85156d2480684"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FJWYQ4AH6QJTNE3QWBUEYDAMM/bundle.json","state_url":"https://pith.science/pith/3FJWYQ4AH6QJTNE3QWBUEYDAMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FJWYQ4AH6QJTNE3QWBUEYDAMM/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-16T19:29:59Z","links":{"resolver":"https://pith.science/pith/3FJWYQ4AH6QJTNE3QWBUEYDAMM","bundle":"https://pith.science/pith/3FJWYQ4AH6QJTNE3QWBUEYDAMM/bundle.json","state":"https://pith.science/pith/3FJWYQ4AH6QJTNE3QWBUEYDAMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FJWYQ4AH6QJTNE3QWBUEYDAMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3FJWYQ4AH6QJTNE3QWBUEYDAMM","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":"669d5ca4fa82a29af8dea0ebf6149a14705208af5b7e10e69df11055f97c97ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-02T17:52:08Z","title_canon_sha256":"ef8b2ef02fb4dca171e569fa30877289b8fae4d3213e8d1b42e586b56fa17a66"},"schema_version":"1.0","source":{"id":"1711.00841","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00841","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00841v1","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00841","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"pith_short_12","alias_value":"3FJWYQ4AH6QJ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3FJWYQ4AH6QJTNE3","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3FJWYQ4A","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:53682e7d96216f18f5268831f347414a52f2c16e4c37f2566fb85156d2480684","target":"graph","created_at":"2026-05-18T00:31:29Z","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 establish lower bounds on the complexity of finding $\\epsilon$-stationary points of smooth, non-convex high-dimensional functions using first-order methods. We prove that deterministic first-order methods, even applied to arbitrarily smooth functions, cannot achieve convergence rates in $\\epsilon$ better than $\\epsilon^{-8/5}$, which is within $\\epsilon^{-1/15}\\log\\frac{1}{\\epsilon}$ of the best known rate for such methods. Moreover, for functions with Lipschitz first and second derivatives, we prove no deterministic first-order method can achieve convergence rates better than $\\epsilon^{-1","authors_text":"Aaron Sidford, John C. Duchi, Oliver Hinder, Yair Carmon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-02T17:52:08Z","title":"Lower Bounds for Finding Stationary Points II: First-Order Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00841","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:fbe23a8b3a77dda95b27748f476e0d39cbb9463ece60660e48f84a70ccf73b53","target":"record","created_at":"2026-05-18T00:31:29Z","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":"669d5ca4fa82a29af8dea0ebf6149a14705208af5b7e10e69df11055f97c97ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-02T17:52:08Z","title_canon_sha256":"ef8b2ef02fb4dca171e569fa30877289b8fae4d3213e8d1b42e586b56fa17a66"},"schema_version":"1.0","source":{"id":"1711.00841","kind":"arxiv","version":1}},"canonical_sha256":"d9536c43803fa099b49b8583426060633fe98ac6dd32d04e93c22ae5ef2a1773","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9536c43803fa099b49b8583426060633fe98ac6dd32d04e93c22ae5ef2a1773","first_computed_at":"2026-05-18T00:31:29.380936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:29.380936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9ueaPKwbEUp8MVnvKhpk+E9TKr9ina4eDOii3yPZVfX37mlvAO6u2Sm/FbjsIBSnnMcvja5EtxI5qbeeNOe6CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:29.381627Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00841","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbe23a8b3a77dda95b27748f476e0d39cbb9463ece60660e48f84a70ccf73b53","sha256:53682e7d96216f18f5268831f347414a52f2c16e4c37f2566fb85156d2480684"],"state_sha256":"42504686a8d23552e9c949fc6421a1c1528ec902a87eb69f0752cd9d437eecea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xRVBfai6eWr1EgdYUDIHHX1Pv0Pv9tCBA+9zSrLpA+osiJTTpFSwGaRxQDxI21SCaQzVXTPw0iaS1t8rF7YhDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T19:29:59.431438Z","bundle_sha256":"91fe5eac4032ed28da873fc3dac15070c3b20ba7f1322104f6fb56db186c7409"}}