{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4GSVG7ILX2G34MI7NADAE3LYCP","short_pith_number":"pith:4GSVG7IL","schema_version":"1.0","canonical_sha256":"e1a5537d0bbe8dbe311f6806026d7813d7f8287995e3183ad2cdc0ba69c585d1","source":{"kind":"arxiv","id":"1710.11606","version":3},"attestation_state":"computed","paper":{"title":"Lower Bounds for Finding Stationary Points I","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-10-31T17:37:07Z","abstract_excerpt":"We prove lower bounds on the complexity of finding $\\epsilon$-stationary points (points $x$ such that $\\|\\nabla f(x)\\| \\le \\epsilon$) of smooth, high-dimensional, and potentially non-convex functions $f$. We consider oracle-based complexity measures, where an algorithm is given access to the value and all derivatives of $f$ at a query point $x$. We show that for any (potentially randomized) algorithm $\\mathsf{A}$, there exists a function $f$ with Lipschitz $p$th order derivatives such that $\\mathsf{A}$ requires at least $\\epsilon^{-(p+1)/p}$ queries to find an $\\epsilon$-stationary point. Our "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1710.11606","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-31T17:37:07Z","cross_cats_sorted":[],"title_canon_sha256":"b47aedcbd095a074cf6f649fb03cb9bb74a551b04757c654fc907e09f5594212","abstract_canon_sha256":"8ad0b350b6a730755ffb2acc2a17b4ca1360d2c0cd76f498cf671ae681c475e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:56:46.086337Z","signature_b64":"chZXGHcbiJTMsFyUeax+nCAXqoN63A9pgoch02/Y1CZF1fh5A2tQio+JsbTaVYNwlo2po0P3rSy9SaST4imzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1a5537d0bbe8dbe311f6806026d7813d7f8287995e3183ad2cdc0ba69c585d1","last_reissued_at":"2026-07-04T23:56:46.085807Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:56:46.085807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Finding Stationary Points I","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-10-31T17:37:07Z","abstract_excerpt":"We prove lower bounds on the complexity of finding $\\epsilon$-stationary points (points $x$ such that $\\|\\nabla f(x)\\| \\le \\epsilon$) of smooth, high-dimensional, and potentially non-convex functions $f$. We consider oracle-based complexity measures, where an algorithm is given access to the value and all derivatives of $f$ at a query point $x$. We show that for any (potentially randomized) algorithm $\\mathsf{A}$, there exists a function $f$ with Lipschitz $p$th order derivatives such that $\\mathsf{A}$ requires at least $\\epsilon^{-(p+1)/p}$ queries to find an $\\epsilon$-stationary point. Our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11606","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1710.11606/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.11606","created_at":"2026-07-04T23:56:46.085874+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.11606v3","created_at":"2026-07-04T23:56:46.085874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11606","created_at":"2026-07-04T23:56:46.085874+00:00"},{"alias_kind":"pith_short_12","alias_value":"4GSVG7ILX2G3","created_at":"2026-07-04T23:56:46.085874+00:00"},{"alias_kind":"pith_short_16","alias_value":"4GSVG7ILX2G34MI7","created_at":"2026-07-04T23:56:46.085874+00:00"},{"alias_kind":"pith_short_8","alias_value":"4GSVG7IL","created_at":"2026-07-04T23:56:46.085874+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27082","citing_title":"Finding Stationary Points by Comparisons","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2003.00295","citing_title":"Adaptive Federated Optimization","ref_index":169,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4GSVG7ILX2G34MI7NADAE3LYCP","json":"https://pith.science/pith/4GSVG7ILX2G34MI7NADAE3LYCP.json","graph_json":"https://pith.science/api/pith-number/4GSVG7ILX2G34MI7NADAE3LYCP/graph.json","events_json":"https://pith.science/api/pith-number/4GSVG7ILX2G34MI7NADAE3LYCP/events.json","paper":"https://pith.science/paper/4GSVG7IL"},"agent_actions":{"view_html":"https://pith.science/pith/4GSVG7ILX2G34MI7NADAE3LYCP","download_json":"https://pith.science/pith/4GSVG7ILX2G34MI7NADAE3LYCP.json","view_paper":"https://pith.science/paper/4GSVG7IL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.11606&json=true","fetch_graph":"https://pith.science/api/pith-number/4GSVG7ILX2G34MI7NADAE3LYCP/graph.json","fetch_events":"https://pith.science/api/pith-number/4GSVG7ILX2G34MI7NADAE3LYCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4GSVG7ILX2G34MI7NADAE3LYCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4GSVG7ILX2G34MI7NADAE3LYCP/action/storage_attestation","attest_author":"https://pith.science/pith/4GSVG7ILX2G34MI7NADAE3LYCP/action/author_attestation","sign_citation":"https://pith.science/pith/4GSVG7ILX2G34MI7NADAE3LYCP/action/citation_signature","submit_replication":"https://pith.science/pith/4GSVG7ILX2G34MI7NADAE3LYCP/action/replication_record"}},"created_at":"2026-07-04T23:56:46.085874+00:00","updated_at":"2026-07-04T23:56:46.085874+00:00"}