{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4GSVG7ILX2G34MI7NADAE3LYCP","short_pith_number":"pith:4GSVG7IL","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"},"canonical_sha256":"e1a5537d0bbe8dbe311f6806026d7813d7f8287995e3183ad2cdc0ba69c585d1","source":{"kind":"arxiv","id":"1710.11606","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11606","created_at":"2026-07-04T23:56:46Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11606v3","created_at":"2026-07-04T23:56:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11606","created_at":"2026-07-04T23:56:46Z"},{"alias_kind":"pith_short_12","alias_value":"4GSVG7ILX2G3","created_at":"2026-07-04T23:56:46Z"},{"alias_kind":"pith_short_16","alias_value":"4GSVG7ILX2G34MI7","created_at":"2026-07-04T23:56:46Z"},{"alias_kind":"pith_short_8","alias_value":"4GSVG7IL","created_at":"2026-07-04T23:56:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4GSVG7ILX2G34MI7NADAE3LYCP","target":"record","payload":{"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"},"canonical_sha256":"e1a5537d0bbe8dbe311f6806026d7813d7f8287995e3183ad2cdc0ba69c585d1","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"},"source_kind":"arxiv","source_id":"1710.11606","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-07-04T23:56:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"goun4ijOalgl6VK49TxuGiM5dQwY5nxaKuby6pS13LZsaWh2Bae0kC9gvbgcjMqZ8ZcAed6fAcLeJiJAayWhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T05:09:37.958268Z"},"content_sha256":"2d6931b282aba0819701e7f5fb8533e2fb1c8719ae229fcb9f2d72167cd0cb97","schema_version":"1.0","event_id":"sha256:2d6931b282aba0819701e7f5fb8533e2fb1c8719ae229fcb9f2d72167cd0cb97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4GSVG7ILX2G34MI7NADAE3LYCP","target":"graph","payload":{"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"},"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-04T23:56:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"64DM+EiDEGj0EpvEYLZfJyCgImH+KSp1pyyciBsDBocKCnS8Sc/ftzNpLzkCOHQcQoDxa1h9nVI5/HYjeXSxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T05:09:37.958780Z"},"content_sha256":"96cb5b98d7f58d4d0e150122a7efcd5bf7c86c9e88dea8f72a0b6b30870aa80f","schema_version":"1.0","event_id":"sha256:96cb5b98d7f58d4d0e150122a7efcd5bf7c86c9e88dea8f72a0b6b30870aa80f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GSVG7ILX2G34MI7NADAE3LYCP/bundle.json","state_url":"https://pith.science/pith/4GSVG7ILX2G34MI7NADAE3LYCP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GSVG7ILX2G34MI7NADAE3LYCP/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-09T05:09:37Z","links":{"resolver":"https://pith.science/pith/4GSVG7ILX2G34MI7NADAE3LYCP","bundle":"https://pith.science/pith/4GSVG7ILX2G34MI7NADAE3LYCP/bundle.json","state":"https://pith.science/pith/4GSVG7ILX2G34MI7NADAE3LYCP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GSVG7ILX2G34MI7NADAE3LYCP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4GSVG7ILX2G34MI7NADAE3LYCP","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":"8ad0b350b6a730755ffb2acc2a17b4ca1360d2c0cd76f498cf671ae681c475e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-31T17:37:07Z","title_canon_sha256":"b47aedcbd095a074cf6f649fb03cb9bb74a551b04757c654fc907e09f5594212"},"schema_version":"1.0","source":{"id":"1710.11606","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11606","created_at":"2026-07-04T23:56:46Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11606v3","created_at":"2026-07-04T23:56:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11606","created_at":"2026-07-04T23:56:46Z"},{"alias_kind":"pith_short_12","alias_value":"4GSVG7ILX2G3","created_at":"2026-07-04T23:56:46Z"},{"alias_kind":"pith_short_16","alias_value":"4GSVG7ILX2G34MI7","created_at":"2026-07-04T23:56:46Z"},{"alias_kind":"pith_short_8","alias_value":"4GSVG7IL","created_at":"2026-07-04T23:56:46Z"}],"graph_snapshots":[{"event_id":"sha256:96cb5b98d7f58d4d0e150122a7efcd5bf7c86c9e88dea8f72a0b6b30870aa80f","target":"graph","created_at":"2026-07-04T23:56:46Z","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/1710.11606/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","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-10-31T17:37:07Z","title":"Lower Bounds for Finding Stationary Points I"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11606","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:2d6931b282aba0819701e7f5fb8533e2fb1c8719ae229fcb9f2d72167cd0cb97","target":"record","created_at":"2026-07-04T23:56:46Z","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":"8ad0b350b6a730755ffb2acc2a17b4ca1360d2c0cd76f498cf671ae681c475e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-31T17:37:07Z","title_canon_sha256":"b47aedcbd095a074cf6f649fb03cb9bb74a551b04757c654fc907e09f5594212"},"schema_version":"1.0","source":{"id":"1710.11606","kind":"arxiv","version":3}},"canonical_sha256":"e1a5537d0bbe8dbe311f6806026d7813d7f8287995e3183ad2cdc0ba69c585d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1a5537d0bbe8dbe311f6806026d7813d7f8287995e3183ad2cdc0ba69c585d1","first_computed_at":"2026-07-04T23:56:46.085807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:56:46.085807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"chZXGHcbiJTMsFyUeax+nCAXqoN63A9pgoch02/Y1CZF1fh5A2tQio+JsbTaVYNwlo2po0P3rSy9SaST4imzDw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:56:46.086337Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.11606","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d6931b282aba0819701e7f5fb8533e2fb1c8719ae229fcb9f2d72167cd0cb97","sha256:96cb5b98d7f58d4d0e150122a7efcd5bf7c86c9e88dea8f72a0b6b30870aa80f"],"state_sha256":"977b247f09410d1de792a79ef84d6eb8e9b18edd3d0e13b331d41e30e3db608a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KuWNuNCMI6Kem3Ly8tAELEaL7nyx2034BILRtSmOMDViKvvFNxSHoYSbJ1a4wdO/34ytEpJcCmygHAXzZfE8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T05:09:37.962736Z","bundle_sha256":"519326f2f023297653dbd160d918706747fd4fbe7481e19e31bcc72fc87048a3"}}