{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:65Q55CFTWRZVZRT5KOGGK2744U","short_pith_number":"pith:65Q55CFT","schema_version":"1.0","canonical_sha256":"f761de88b3b4735cc67d538c656bfce50a8bde8be29025162cffa0a9a937235f","source":{"kind":"arxiv","id":"2606.30050","version":1},"attestation_state":"computed","paper":{"title":"A Restart-Free Accelerated Algorithm for Non-Convex Minimization: Continuous and Discrete Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kansei Ushiyama, Shun Sato","submitted_at":"2026-06-29T09:44:01Z","abstract_excerpt":"We propose two novel first-order methods for minimizing nonconvex functions with Lipschitz-continuous gradients and Hessians. These algorithms attain an $\\varepsilon$-approximate first-order stationary point in $\\mathrm{O}(\\varepsilon^{-7/4})$ function and gradient evaluations, without using $\\varepsilon$ as an input parameter. While existing methods rely on restart mechanisms to achieve this complexity, our methods do not. Consequently, the first algorithm enjoys a simple implementation, making its last iterate differentiable with respect to the initial point. By estimating the Lipschitz cons"},"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":"2606.30050","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-29T09:44:01Z","cross_cats_sorted":[],"title_canon_sha256":"fd37c37908a6b2b20e264b44dad46e0c13669f1c182c17a5e4975d30d32773d7","abstract_canon_sha256":"354978a744acd082c8c2280c48f43486f8cf43e1dc7e99e40d3ed9919e9ab097"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:17:47.495202Z","signature_b64":"/8jMCKJDy7bF5pKBR5f38MrhQp9lntUgbul26KWRM3ymLwycswIx5vfgXhCkj+n8vsoSsQNIwsA3SYxzuLlNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f761de88b3b4735cc67d538c656bfce50a8bde8be29025162cffa0a9a937235f","last_reissued_at":"2026-06-30T02:17:47.494689Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:17:47.494689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Restart-Free Accelerated Algorithm for Non-Convex Minimization: Continuous and Discrete Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kansei Ushiyama, Shun Sato","submitted_at":"2026-06-29T09:44:01Z","abstract_excerpt":"We propose two novel first-order methods for minimizing nonconvex functions with Lipschitz-continuous gradients and Hessians. These algorithms attain an $\\varepsilon$-approximate first-order stationary point in $\\mathrm{O}(\\varepsilon^{-7/4})$ function and gradient evaluations, without using $\\varepsilon$ as an input parameter. While existing methods rely on restart mechanisms to achieve this complexity, our methods do not. Consequently, the first algorithm enjoys a simple implementation, making its last iterate differentiable with respect to the initial point. By estimating the Lipschitz cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30050","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/2606.30050/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":"2606.30050","created_at":"2026-06-30T02:17:47.494755+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.30050v1","created_at":"2026-06-30T02:17:47.494755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30050","created_at":"2026-06-30T02:17:47.494755+00:00"},{"alias_kind":"pith_short_12","alias_value":"65Q55CFTWRZV","created_at":"2026-06-30T02:17:47.494755+00:00"},{"alias_kind":"pith_short_16","alias_value":"65Q55CFTWRZVZRT5","created_at":"2026-06-30T02:17:47.494755+00:00"},{"alias_kind":"pith_short_8","alias_value":"65Q55CFT","created_at":"2026-06-30T02:17:47.494755+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/65Q55CFTWRZVZRT5KOGGK2744U","json":"https://pith.science/pith/65Q55CFTWRZVZRT5KOGGK2744U.json","graph_json":"https://pith.science/api/pith-number/65Q55CFTWRZVZRT5KOGGK2744U/graph.json","events_json":"https://pith.science/api/pith-number/65Q55CFTWRZVZRT5KOGGK2744U/events.json","paper":"https://pith.science/paper/65Q55CFT"},"agent_actions":{"view_html":"https://pith.science/pith/65Q55CFTWRZVZRT5KOGGK2744U","download_json":"https://pith.science/pith/65Q55CFTWRZVZRT5KOGGK2744U.json","view_paper":"https://pith.science/paper/65Q55CFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.30050&json=true","fetch_graph":"https://pith.science/api/pith-number/65Q55CFTWRZVZRT5KOGGK2744U/graph.json","fetch_events":"https://pith.science/api/pith-number/65Q55CFTWRZVZRT5KOGGK2744U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65Q55CFTWRZVZRT5KOGGK2744U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65Q55CFTWRZVZRT5KOGGK2744U/action/storage_attestation","attest_author":"https://pith.science/pith/65Q55CFTWRZVZRT5KOGGK2744U/action/author_attestation","sign_citation":"https://pith.science/pith/65Q55CFTWRZVZRT5KOGGK2744U/action/citation_signature","submit_replication":"https://pith.science/pith/65Q55CFTWRZVZRT5KOGGK2744U/action/replication_record"}},"created_at":"2026-06-30T02:17:47.494755+00:00","updated_at":"2026-06-30T02:17:47.494755+00:00"}