{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:RZJRGS4BBCCKVP3QNWANTF2AJA","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":"5caefb623543755b15521047c15e7f2e82aa28b95bf95354416a26a3c5820353","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-18T17:50:13Z","title_canon_sha256":"1faa80063274fb8812e0a627e8a85a3053e50f5ec1cacdb1cc069c7ba775bac8"},"schema_version":"1.0","source":{"id":"2310.12139","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.12139","created_at":"2026-07-05T09:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"2310.12139v3","created_at":"2026-07-05T09:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.12139","created_at":"2026-07-05T09:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"RZJRGS4BBCCK","created_at":"2026-07-05T09:35:46Z"},{"alias_kind":"pith_short_16","alias_value":"RZJRGS4BBCCKVP3Q","created_at":"2026-07-05T09:35:46Z"},{"alias_kind":"pith_short_8","alias_value":"RZJRGS4B","created_at":"2026-07-05T09:35:46Z"}],"graph_snapshots":[{"event_id":"sha256:bdf4d07bc94c33a7802e35b401f56dd614ee8274dfb336b39470b07d55722913","target":"graph","created_at":"2026-07-05T09:35: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/2310.12139/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose novel optimal and parameter-free algorithms for computing an approximate solution with small (projected) gradient norm. Specifically, for computing an approximate solution such that the norm of its (projected) gradient does not exceed $\\varepsilon$, we obtain the following results: a) for the convex case, the total number of gradient evaluations is bounded by $O(1)\\sqrt{L\\|x_0 - x^*\\|/\\varepsilon}$, where $L$ is the Lipschitz constant of the gradient and $x^*$ is any optimal solution; b) for the strongly convex case, the total number of gradient evaluations is bounded by $O(1)\\sqrt{","authors_text":"Guanghui Lan, Yuyuan Ouyang, Zhe Zhang","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-18T17:50:13Z","title":"Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.12139","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:e65106ed3fe4869f7fa9f1501c8a35727a9579eb8a773868726acf5d85c5a729","target":"record","created_at":"2026-07-05T09:35: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":"5caefb623543755b15521047c15e7f2e82aa28b95bf95354416a26a3c5820353","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-18T17:50:13Z","title_canon_sha256":"1faa80063274fb8812e0a627e8a85a3053e50f5ec1cacdb1cc069c7ba775bac8"},"schema_version":"1.0","source":{"id":"2310.12139","kind":"arxiv","version":3}},"canonical_sha256":"8e53134b810884aabf706d80d99740483c604f7e5dde79534a2930063cc2697d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e53134b810884aabf706d80d99740483c604f7e5dde79534a2930063cc2697d","first_computed_at":"2026-07-05T09:35:46.513179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:35:46.513179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NnCqssUnRaXvIH7vhQL9RemmgZMkswX9qVDzsCOx3YT5C2OaVsfi/W1nGS7ZHDbK7qZr4SkimFYThktHhfNJAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:35:46.513690Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.12139","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e65106ed3fe4869f7fa9f1501c8a35727a9579eb8a773868726acf5d85c5a729","sha256:bdf4d07bc94c33a7802e35b401f56dd614ee8274dfb336b39470b07d55722913"],"state_sha256":"5d227dfbc3783d22aa4408321a711e07011e5c084aa1117ecbd4e4cf9caed33f"}