{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:65Q55CFTWRZVZRT5KOGGK2744U","short_pith_number":"pith:65Q55CFT","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"},"canonical_sha256":"f761de88b3b4735cc67d538c656bfce50a8bde8be29025162cffa0a9a937235f","source":{"kind":"arxiv","id":"2606.30050","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.30050","created_at":"2026-06-30T02:17:47Z"},{"alias_kind":"arxiv_version","alias_value":"2606.30050v1","created_at":"2026-06-30T02:17:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30050","created_at":"2026-06-30T02:17:47Z"},{"alias_kind":"pith_short_12","alias_value":"65Q55CFTWRZV","created_at":"2026-06-30T02:17:47Z"},{"alias_kind":"pith_short_16","alias_value":"65Q55CFTWRZVZRT5","created_at":"2026-06-30T02:17:47Z"},{"alias_kind":"pith_short_8","alias_value":"65Q55CFT","created_at":"2026-06-30T02:17:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:65Q55CFTWRZVZRT5KOGGK2744U","target":"record","payload":{"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"},"canonical_sha256":"f761de88b3b4735cc67d538c656bfce50a8bde8be29025162cffa0a9a937235f","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"},"source_kind":"arxiv","source_id":"2606.30050","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-06-30T02:17:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6d3Ndp3rs2M9CpmxcqB/lap2N9pPW3hIgB6LeyQFprsMRR5BTdZs7ULky4ON+r8UTkyrsvCIdFafqT865uADDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:05:47.365981Z"},"content_sha256":"8c02c3301a61f596cdc948c5030e50a2f630d281382dcb0fc6628c3d06118ccf","schema_version":"1.0","event_id":"sha256:8c02c3301a61f596cdc948c5030e50a2f630d281382dcb0fc6628c3d06118ccf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:65Q55CFTWRZVZRT5KOGGK2744U","target":"graph","payload":{"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"},"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-06-30T02:17:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJzrZJhXyghVZNMX1xx1q8jW0QUheXLlGLtTTP9xCqYHFHB4vEItN8WRojH5U0YSlGYpQiCHy20IR4MG4mXdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:05:47.366371Z"},"content_sha256":"21611476e97fbf49ea2b5328f720bb301e54a867e8fbe114a33fc2f66ebabbe5","schema_version":"1.0","event_id":"sha256:21611476e97fbf49ea2b5328f720bb301e54a867e8fbe114a33fc2f66ebabbe5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65Q55CFTWRZVZRT5KOGGK2744U/bundle.json","state_url":"https://pith.science/pith/65Q55CFTWRZVZRT5KOGGK2744U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65Q55CFTWRZVZRT5KOGGK2744U/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-01T21:05:47Z","links":{"resolver":"https://pith.science/pith/65Q55CFTWRZVZRT5KOGGK2744U","bundle":"https://pith.science/pith/65Q55CFTWRZVZRT5KOGGK2744U/bundle.json","state":"https://pith.science/pith/65Q55CFTWRZVZRT5KOGGK2744U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65Q55CFTWRZVZRT5KOGGK2744U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:65Q55CFTWRZVZRT5KOGGK2744U","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":"354978a744acd082c8c2280c48f43486f8cf43e1dc7e99e40d3ed9919e9ab097","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-29T09:44:01Z","title_canon_sha256":"fd37c37908a6b2b20e264b44dad46e0c13669f1c182c17a5e4975d30d32773d7"},"schema_version":"1.0","source":{"id":"2606.30050","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.30050","created_at":"2026-06-30T02:17:47Z"},{"alias_kind":"arxiv_version","alias_value":"2606.30050v1","created_at":"2026-06-30T02:17:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30050","created_at":"2026-06-30T02:17:47Z"},{"alias_kind":"pith_short_12","alias_value":"65Q55CFTWRZV","created_at":"2026-06-30T02:17:47Z"},{"alias_kind":"pith_short_16","alias_value":"65Q55CFTWRZVZRT5","created_at":"2026-06-30T02:17:47Z"},{"alias_kind":"pith_short_8","alias_value":"65Q55CFT","created_at":"2026-06-30T02:17:47Z"}],"graph_snapshots":[{"event_id":"sha256:21611476e97fbf49ea2b5328f720bb301e54a867e8fbe114a33fc2f66ebabbe5","target":"graph","created_at":"2026-06-30T02:17:47Z","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/2606.30050/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Kansei Ushiyama, Shun Sato","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-29T09:44:01Z","title":"A Restart-Free Accelerated Algorithm for Non-Convex Minimization: Continuous and Discrete Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30050","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:8c02c3301a61f596cdc948c5030e50a2f630d281382dcb0fc6628c3d06118ccf","target":"record","created_at":"2026-06-30T02:17:47Z","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":"354978a744acd082c8c2280c48f43486f8cf43e1dc7e99e40d3ed9919e9ab097","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-29T09:44:01Z","title_canon_sha256":"fd37c37908a6b2b20e264b44dad46e0c13669f1c182c17a5e4975d30d32773d7"},"schema_version":"1.0","source":{"id":"2606.30050","kind":"arxiv","version":1}},"canonical_sha256":"f761de88b3b4735cc67d538c656bfce50a8bde8be29025162cffa0a9a937235f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f761de88b3b4735cc67d538c656bfce50a8bde8be29025162cffa0a9a937235f","first_computed_at":"2026-06-30T02:17:47.494689Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T02:17:47.494689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/8jMCKJDy7bF5pKBR5f38MrhQp9lntUgbul26KWRM3ymLwycswIx5vfgXhCkj+n8vsoSsQNIwsA3SYxzuLlNBw==","signature_status":"signed_v1","signed_at":"2026-06-30T02:17:47.495202Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.30050","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c02c3301a61f596cdc948c5030e50a2f630d281382dcb0fc6628c3d06118ccf","sha256:21611476e97fbf49ea2b5328f720bb301e54a867e8fbe114a33fc2f66ebabbe5"],"state_sha256":"ddee6e6cb4c0056979f402f006c40a42d35236cc80a36cbce45db7111cc7a29f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0yfRO19cLh73VxEE+/lzVlgaQQOP7ljyy0UQRCiuENtvJyZlARTArwKuShu/cOZFL7w+HnsVQkWh4yMuOWd2Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T21:05:47.368403Z","bundle_sha256":"8ef542584633e187498f761a541fa6aad25bdc336d1bc9ce6ae23cb5dfaca880"}}