{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:NICHBE5TCFVWHTSM64PHL3B3CL","short_pith_number":"pith:NICHBE5T","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"},"canonical_sha256":"6a047093b3116b63ce4cf71e75ec3b12c8005d843195af1d8a2f5521012d2149","source":{"kind":"arxiv","id":"2505.09045","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.09045","created_at":"2026-07-05T11:02:49Z"},{"alias_kind":"arxiv_version","alias_value":"2505.09045v1","created_at":"2026-07-05T11:02:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09045","created_at":"2026-07-05T11:02:49Z"},{"alias_kind":"pith_short_12","alias_value":"NICHBE5TCFVW","created_at":"2026-07-05T11:02:49Z"},{"alias_kind":"pith_short_16","alias_value":"NICHBE5TCFVWHTSM","created_at":"2026-07-05T11:02:49Z"},{"alias_kind":"pith_short_8","alias_value":"NICHBE5T","created_at":"2026-07-05T11:02:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:NICHBE5TCFVWHTSM64PHL3B3CL","target":"record","payload":{"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"},"canonical_sha256":"6a047093b3116b63ce4cf71e75ec3b12c8005d843195af1d8a2f5521012d2149","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"},"source_kind":"arxiv","source_id":"2505.09045","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-07-05T11:02:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uVukUULWnPTK3LTYIW+xtNqO0vsE/BKdEJpwjBqWWelmXzwC12Q7RUki+Uv+C5JIiU6gTho912adQ0t/ssVUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:58:36.430739Z"},"content_sha256":"f1370d062d617ddc8edb44acadb047f31d43d0f68b4b7b2b93fa292f11106ff3","schema_version":"1.0","event_id":"sha256:f1370d062d617ddc8edb44acadb047f31d43d0f68b4b7b2b93fa292f11106ff3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:NICHBE5TCFVWHTSM64PHL3B3CL","target":"graph","payload":{"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"},"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-05T11:02:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tw2o1iea3I4fAn3D+k+w+Kjyz6auFyeKO4C3iOJ4PppTzVWNoXNUFvUdCCEt9wR06mx0wAWFCnHevXdIwKl5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:58:36.431117Z"},"content_sha256":"532f94298e7ea6feda6561115a71268dbef84cbb15ddee71fcd7b5fcfcb375ce","schema_version":"1.0","event_id":"sha256:532f94298e7ea6feda6561115a71268dbef84cbb15ddee71fcd7b5fcfcb375ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NICHBE5TCFVWHTSM64PHL3B3CL/bundle.json","state_url":"https://pith.science/pith/NICHBE5TCFVWHTSM64PHL3B3CL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NICHBE5TCFVWHTSM64PHL3B3CL/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-07-06T16:58:36Z","links":{"resolver":"https://pith.science/pith/NICHBE5TCFVWHTSM64PHL3B3CL","bundle":"https://pith.science/pith/NICHBE5TCFVWHTSM64PHL3B3CL/bundle.json","state":"https://pith.science/pith/NICHBE5TCFVWHTSM64PHL3B3CL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NICHBE5TCFVWHTSM64PHL3B3CL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NICHBE5TCFVWHTSM64PHL3B3CL","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":"5bfb477faf33ce4e6d7a9310efd7cb0bb259ce5249ef451f512d9a75046564d1","cross_cats_sorted":["cs.CC","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-14T00:54:49Z","title_canon_sha256":"9fa913f4df008eadefb71327cbfd86396aa21357bee0ceb85194ae12f2fadf9d"},"schema_version":"1.0","source":{"id":"2505.09045","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.09045","created_at":"2026-07-05T11:02:49Z"},{"alias_kind":"arxiv_version","alias_value":"2505.09045v1","created_at":"2026-07-05T11:02:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09045","created_at":"2026-07-05T11:02:49Z"},{"alias_kind":"pith_short_12","alias_value":"NICHBE5TCFVW","created_at":"2026-07-05T11:02:49Z"},{"alias_kind":"pith_short_16","alias_value":"NICHBE5TCFVWHTSM","created_at":"2026-07-05T11:02:49Z"},{"alias_kind":"pith_short_8","alias_value":"NICHBE5T","created_at":"2026-07-05T11:02:49Z"}],"graph_snapshots":[{"event_id":"sha256:532f94298e7ea6feda6561115a71268dbef84cbb15ddee71fcd7b5fcfcb375ce","target":"graph","created_at":"2026-07-05T11:02:49Z","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/2505.09045/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Akiko Takeda, Andi Han, Huanjian Zhou, Masashi Sugiyama","cross_cats":["cs.CC","cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-14T00:54:49Z","title":"The Adaptive Complexity of Finding a Stationary Point"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.09045","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:f1370d062d617ddc8edb44acadb047f31d43d0f68b4b7b2b93fa292f11106ff3","target":"record","created_at":"2026-07-05T11:02:49Z","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":"5bfb477faf33ce4e6d7a9310efd7cb0bb259ce5249ef451f512d9a75046564d1","cross_cats_sorted":["cs.CC","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-14T00:54:49Z","title_canon_sha256":"9fa913f4df008eadefb71327cbfd86396aa21357bee0ceb85194ae12f2fadf9d"},"schema_version":"1.0","source":{"id":"2505.09045","kind":"arxiv","version":1}},"canonical_sha256":"6a047093b3116b63ce4cf71e75ec3b12c8005d843195af1d8a2f5521012d2149","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a047093b3116b63ce4cf71e75ec3b12c8005d843195af1d8a2f5521012d2149","first_computed_at":"2026-07-05T11:02:49.435405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:02:49.435405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ih6ZkbCpYWM1IubZqjPq9gvY+nvNR30pdBn8RAGQWPAMMxreG6USMLccj2kVUtsfNCCaYxVw55mgPmkEkfowCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:02:49.435857Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.09045","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1370d062d617ddc8edb44acadb047f31d43d0f68b4b7b2b93fa292f11106ff3","sha256:532f94298e7ea6feda6561115a71268dbef84cbb15ddee71fcd7b5fcfcb375ce"],"state_sha256":"4aece923609783d1bc897ea906c1d227ac40e7e2dc43c7f9b2cbcaf884d04299"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CnXOyFuftnm+YCu/hJPGBhN/DFA3xZFr7UFMVcH4ECqKBxM7hRPQOWfr8dAeEaEkN7ClQGh69Y9tJbC+HcfXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T16:58:36.433123Z","bundle_sha256":"48d6555e19af5767a82203f9895db9bfe8c5a3b25168cb8f90e8b5fe99922782"}}