{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:6USCNYDQ73KR55YRX5WYLZAPBA","short_pith_number":"pith:6USCNYDQ","canonical_record":{"source":{"id":"2310.10082","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-10-16T05:26:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"34ecad5843238baf8aacda0118d80cf467bba99a7c4cd54281d8119ffeb90567","abstract_canon_sha256":"e8b91479f6943f9333c662a2edc179aae2ebbe72dfbaeda53885defadbbb0cdf"},"schema_version":"1.0"},"canonical_sha256":"f52426e070fed51ef711bf6d85e40f0805bcbfad666a0111eae97de67fd748d3","source":{"kind":"arxiv","id":"2310.10082","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.10082","created_at":"2026-07-05T08:56:14Z"},{"alias_kind":"arxiv_version","alias_value":"2310.10082v3","created_at":"2026-07-05T08:56:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.10082","created_at":"2026-07-05T08:56:14Z"},{"alias_kind":"pith_short_12","alias_value":"6USCNYDQ73KR","created_at":"2026-07-05T08:56:14Z"},{"alias_kind":"pith_short_16","alias_value":"6USCNYDQ73KR55YR","created_at":"2026-07-05T08:56:14Z"},{"alias_kind":"pith_short_8","alias_value":"6USCNYDQ","created_at":"2026-07-05T08:56:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:6USCNYDQ73KR55YRX5WYLZAPBA","target":"record","payload":{"canonical_record":{"source":{"id":"2310.10082","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-10-16T05:26:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"34ecad5843238baf8aacda0118d80cf467bba99a7c4cd54281d8119ffeb90567","abstract_canon_sha256":"e8b91479f6943f9333c662a2edc179aae2ebbe72dfbaeda53885defadbbb0cdf"},"schema_version":"1.0"},"canonical_sha256":"f52426e070fed51ef711bf6d85e40f0805bcbfad666a0111eae97de67fd748d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:56:14.651157Z","signature_b64":"5TFAyWmRIHX2588dImDzCSHgO9o6OtdIgQSGpRDuvG6QB9tFY5oUXfCvshHwdoGRGH8l5pNfE7Q+17EWgyFuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f52426e070fed51ef711bf6d85e40f0805bcbfad666a0111eae97de67fd748d3","last_reissued_at":"2026-07-05T08:56:14.650750Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:56:14.650750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.10082","source_version":3,"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-05T08:56:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ims9k1ZhJpUQrcicpyUn1FrLJofy6dojbbf2kQCKgV7YnLgFg7ZeunT346diL+ZObFK6R+2/QiXzvGpFnvLfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:11:39.126505Z"},"content_sha256":"7fadc3731dd4cdca258b461d64f24da608ca63494f4206e2297566ccb399a7f6","schema_version":"1.0","event_id":"sha256:7fadc3731dd4cdca258b461d64f24da608ca63494f4206e2297566ccb399a7f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:6USCNYDQ73KR55YRX5WYLZAPBA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A simple uniformly optimal method without line search for convex optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Guanghui Lan, Tianjiao Li","submitted_at":"2023-10-16T05:26:03Z","abstract_excerpt":"Line search (or backtracking) procedures have been widely employed into first-order methods for solving convex optimization problems, especially those with unknown problem parameters (e.g., Lipschitz constant). In this paper, we show that line search is superfluous in attaining the optimal rate of convergence for solving a convex optimization problem whose parameters are not given a priori. In particular, we present a novel accelerated gradient descent type algorithm called auto-conditioned fast gradient method (AC-FGM) that can achieve an optimal $\\mathcal{O}(1/k^2)$ rate of convergence for s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.10082","kind":"arxiv","version":3},"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/2310.10082/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-05T08:56:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zvv7mggzAXidlRc8LGJ79AHgIfmGq4HFsCbJRJB2uBbC17H51b2xlwOt4hdIYGbI3xjHmHCU7oblY5JpJIMhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:11:39.127000Z"},"content_sha256":"978ba0c8253eb4859e5465592c72c7f68dc97835eaceeee8ac45e7273fa7f8b6","schema_version":"1.0","event_id":"sha256:978ba0c8253eb4859e5465592c72c7f68dc97835eaceeee8ac45e7273fa7f8b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6USCNYDQ73KR55YRX5WYLZAPBA/bundle.json","state_url":"https://pith.science/pith/6USCNYDQ73KR55YRX5WYLZAPBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6USCNYDQ73KR55YRX5WYLZAPBA/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-08-08T20:11:39Z","links":{"resolver":"https://pith.science/pith/6USCNYDQ73KR55YRX5WYLZAPBA","bundle":"https://pith.science/pith/6USCNYDQ73KR55YRX5WYLZAPBA/bundle.json","state":"https://pith.science/pith/6USCNYDQ73KR55YRX5WYLZAPBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6USCNYDQ73KR55YRX5WYLZAPBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:6USCNYDQ73KR55YRX5WYLZAPBA","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":"e8b91479f6943f9333c662a2edc179aae2ebbe72dfbaeda53885defadbbb0cdf","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-10-16T05:26:03Z","title_canon_sha256":"34ecad5843238baf8aacda0118d80cf467bba99a7c4cd54281d8119ffeb90567"},"schema_version":"1.0","source":{"id":"2310.10082","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.10082","created_at":"2026-07-05T08:56:14Z"},{"alias_kind":"arxiv_version","alias_value":"2310.10082v3","created_at":"2026-07-05T08:56:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.10082","created_at":"2026-07-05T08:56:14Z"},{"alias_kind":"pith_short_12","alias_value":"6USCNYDQ73KR","created_at":"2026-07-05T08:56:14Z"},{"alias_kind":"pith_short_16","alias_value":"6USCNYDQ73KR55YR","created_at":"2026-07-05T08:56:14Z"},{"alias_kind":"pith_short_8","alias_value":"6USCNYDQ","created_at":"2026-07-05T08:56:14Z"}],"graph_snapshots":[{"event_id":"sha256:978ba0c8253eb4859e5465592c72c7f68dc97835eaceeee8ac45e7273fa7f8b6","target":"graph","created_at":"2026-07-05T08:56:14Z","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.10082/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Line search (or backtracking) procedures have been widely employed into first-order methods for solving convex optimization problems, especially those with unknown problem parameters (e.g., Lipschitz constant). In this paper, we show that line search is superfluous in attaining the optimal rate of convergence for solving a convex optimization problem whose parameters are not given a priori. In particular, we present a novel accelerated gradient descent type algorithm called auto-conditioned fast gradient method (AC-FGM) that can achieve an optimal $\\mathcal{O}(1/k^2)$ rate of convergence for s","authors_text":"Guanghui Lan, Tianjiao Li","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-10-16T05:26:03Z","title":"A simple uniformly optimal method without line search for convex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.10082","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:7fadc3731dd4cdca258b461d64f24da608ca63494f4206e2297566ccb399a7f6","target":"record","created_at":"2026-07-05T08:56:14Z","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":"e8b91479f6943f9333c662a2edc179aae2ebbe72dfbaeda53885defadbbb0cdf","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-10-16T05:26:03Z","title_canon_sha256":"34ecad5843238baf8aacda0118d80cf467bba99a7c4cd54281d8119ffeb90567"},"schema_version":"1.0","source":{"id":"2310.10082","kind":"arxiv","version":3}},"canonical_sha256":"f52426e070fed51ef711bf6d85e40f0805bcbfad666a0111eae97de67fd748d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f52426e070fed51ef711bf6d85e40f0805bcbfad666a0111eae97de67fd748d3","first_computed_at":"2026-07-05T08:56:14.650750Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:56:14.650750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5TFAyWmRIHX2588dImDzCSHgO9o6OtdIgQSGpRDuvG6QB9tFY5oUXfCvshHwdoGRGH8l5pNfE7Q+17EWgyFuCA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:56:14.651157Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.10082","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fadc3731dd4cdca258b461d64f24da608ca63494f4206e2297566ccb399a7f6","sha256:978ba0c8253eb4859e5465592c72c7f68dc97835eaceeee8ac45e7273fa7f8b6"],"state_sha256":"5d81c75f0c827e1026c2781ddaa87e76621139a39c9238d1ed3edcbc58104775"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9q2MbwfQCCyakbVJVIdyJXOEdgF4BT90SSMA7KfcZuajHgkIWbEWZe4dbLn2t9/uDJk6NeLztaNH5q6oYktgDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:11:39.131943Z","bundle_sha256":"178fa682a335eb11c54ae6b5e20aa037e1c893c38d52ea3d018cbdc3569526bd"}}