{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NICHBE5TCFVWHTSM64PHL3B3CL","short_pith_number":"pith:NICHBE5T","schema_version":"1.0","canonical_sha256":"6a047093b3116b63ce4cf71e75ec3b12c8005d843195af1d8a2f5521012d2149","source":{"kind":"arxiv","id":"2505.09045","version":1},"attestation_state":"computed","paper":{"title":"The Adaptive Complexity of Finding a Stationary Point","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC"],"primary_cat":"math.OC","authors_text":"Akiko Takeda, Andi Han, Huanjian Zhou, Masashi Sugiyama","submitted_at":"2025-05-14T00:54:49Z","abstract_excerpt":"In large-scale applications, such as machine learning, it is desirable to design non-convex optimization algorithms with a high degree of parallelization. In this work, we study the adaptive complexity of finding a stationary point, which is the minimal number of sequential rounds required to achieve stationarity given polynomially many queries executed in parallel at each round.\n  For the high-dimensional case, i.e., $d = \\widetilde{\\Omega}(\\varepsilon^{-(2 + 2p)/p})$, we show that for any (potentially randomized) algorithm, there exists a function with Lipschitz $p$-th order derivatives such"},"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":"2505.09045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-14T00:54:49Z","cross_cats_sorted":["cs.CC","cs.DC"],"title_canon_sha256":"9fa913f4df008eadefb71327cbfd86396aa21357bee0ceb85194ae12f2fadf9d","abstract_canon_sha256":"5bfb477faf33ce4e6d7a9310efd7cb0bb259ce5249ef451f512d9a75046564d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:49.435857Z","signature_b64":"Ih6ZkbCpYWM1IubZqjPq9gvY+nvNR30pdBn8RAGQWPAMMxreG6USMLccj2kVUtsfNCCaYxVw55mgPmkEkfowCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a047093b3116b63ce4cf71e75ec3b12c8005d843195af1d8a2f5521012d2149","last_reissued_at":"2026-07-05T11:02:49.435405Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:49.435405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Adaptive Complexity of Finding a Stationary Point","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC"],"primary_cat":"math.OC","authors_text":"Akiko Takeda, Andi Han, Huanjian Zhou, Masashi Sugiyama","submitted_at":"2025-05-14T00:54:49Z","abstract_excerpt":"In large-scale applications, such as machine learning, it is desirable to design non-convex optimization algorithms with a high degree of parallelization. In this work, we study the adaptive complexity of finding a stationary point, which is the minimal number of sequential rounds required to achieve stationarity given polynomially many queries executed in parallel at each round.\n  For the high-dimensional case, i.e., $d = \\widetilde{\\Omega}(\\varepsilon^{-(2 + 2p)/p})$, we show that for any (potentially randomized) algorithm, there exists a function with Lipschitz $p$-th order derivatives such"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.09045","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.09045/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":"2505.09045","created_at":"2026-07-05T11:02:49.435466+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.09045v1","created_at":"2026-07-05T11:02:49.435466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09045","created_at":"2026-07-05T11:02:49.435466+00:00"},{"alias_kind":"pith_short_12","alias_value":"NICHBE5TCFVW","created_at":"2026-07-05T11:02:49.435466+00:00"},{"alias_kind":"pith_short_16","alias_value":"NICHBE5TCFVWHTSM","created_at":"2026-07-05T11:02:49.435466+00:00"},{"alias_kind":"pith_short_8","alias_value":"NICHBE5T","created_at":"2026-07-05T11:02:49.435466+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NICHBE5TCFVWHTSM64PHL3B3CL","json":"https://pith.science/pith/NICHBE5TCFVWHTSM64PHL3B3CL.json","graph_json":"https://pith.science/api/pith-number/NICHBE5TCFVWHTSM64PHL3B3CL/graph.json","events_json":"https://pith.science/api/pith-number/NICHBE5TCFVWHTSM64PHL3B3CL/events.json","paper":"https://pith.science/paper/NICHBE5T"},"agent_actions":{"view_html":"https://pith.science/pith/NICHBE5TCFVWHTSM64PHL3B3CL","download_json":"https://pith.science/pith/NICHBE5TCFVWHTSM64PHL3B3CL.json","view_paper":"https://pith.science/paper/NICHBE5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.09045&json=true","fetch_graph":"https://pith.science/api/pith-number/NICHBE5TCFVWHTSM64PHL3B3CL/graph.json","fetch_events":"https://pith.science/api/pith-number/NICHBE5TCFVWHTSM64PHL3B3CL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NICHBE5TCFVWHTSM64PHL3B3CL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NICHBE5TCFVWHTSM64PHL3B3CL/action/storage_attestation","attest_author":"https://pith.science/pith/NICHBE5TCFVWHTSM64PHL3B3CL/action/author_attestation","sign_citation":"https://pith.science/pith/NICHBE5TCFVWHTSM64PHL3B3CL/action/citation_signature","submit_replication":"https://pith.science/pith/NICHBE5TCFVWHTSM64PHL3B3CL/action/replication_record"}},"created_at":"2026-07-05T11:02:49.435466+00:00","updated_at":"2026-07-05T11:02:49.435466+00:00"}