{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:D6YHADPK7T3SKGECUUJGPLMII2","short_pith_number":"pith:D6YHADPK","schema_version":"1.0","canonical_sha256":"1fb0700deafcf7251882a51267ad884693b93c2b61b18596558fcebae8affa82","source":{"kind":"arxiv","id":"2605.22929","version":1},"attestation_state":"computed","paper":{"title":"An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrien B. Taylor, Aymeric Dieuleveut, Daniel Berg Thomsen, Manu Upadhyaya","submitted_at":"2026-05-21T18:06:17Z","abstract_excerpt":"We introduce Prox-ITEM, an optimal proximal gradient method for minimizing $f+g$, where $f$ is smooth and strongly convex, and $g$ is convex, proper, and lower semicontinuous. In the smooth case $g=0$, Prox-ITEM reduces to the information-theoretic exact method (ITEM). We prove an exact distance-to-solution bound for Prox-ITEM with the same distance-convergence rate as ITEM, and show that this rate is minimax optimal among span-based first-order methods using the same number of gradient-oracle calls for $f$ and an arbitrary number of proximal-oracle calls for $g$. We also identify the stationa"},"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":"2605.22929","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-21T18:06:17Z","cross_cats_sorted":[],"title_canon_sha256":"9bc86b29c587dd96815be868eca8e9ca76a6acc2d4ce064a0ff069c46bd9c255","abstract_canon_sha256":"67f444ed962de9e212a865efb6bf32f079fce86372b6113fec168487a6c32cab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:30.727828Z","signature_b64":"qmTAy9ftKZvOJyQvQUFakE9EFMKVdxT7FS7UtTyAVMmrz95+hN6wl4TyI7XPKu/WelG7MMbWfDsOsQnsoN9QBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fb0700deafcf7251882a51267ad884693b93c2b61b18596558fcebae8affa82","last_reissued_at":"2026-05-25T02:01:30.727262Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:30.727262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrien B. Taylor, Aymeric Dieuleveut, Daniel Berg Thomsen, Manu Upadhyaya","submitted_at":"2026-05-21T18:06:17Z","abstract_excerpt":"We introduce Prox-ITEM, an optimal proximal gradient method for minimizing $f+g$, where $f$ is smooth and strongly convex, and $g$ is convex, proper, and lower semicontinuous. In the smooth case $g=0$, Prox-ITEM reduces to the information-theoretic exact method (ITEM). We prove an exact distance-to-solution bound for Prox-ITEM with the same distance-convergence rate as ITEM, and show that this rate is minimax optimal among span-based first-order methods using the same number of gradient-oracle calls for $f$ and an arbitrary number of proximal-oracle calls for $g$. We also identify the stationa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22929","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/2605.22929/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":"2605.22929","created_at":"2026-05-25T02:01:30.727365+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.22929v1","created_at":"2026-05-25T02:01:30.727365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22929","created_at":"2026-05-25T02:01:30.727365+00:00"},{"alias_kind":"pith_short_12","alias_value":"D6YHADPK7T3S","created_at":"2026-05-25T02:01:30.727365+00:00"},{"alias_kind":"pith_short_16","alias_value":"D6YHADPK7T3SKGEC","created_at":"2026-05-25T02:01:30.727365+00:00"},{"alias_kind":"pith_short_8","alias_value":"D6YHADPK","created_at":"2026-05-25T02:01:30.727365+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/D6YHADPK7T3SKGECUUJGPLMII2","json":"https://pith.science/pith/D6YHADPK7T3SKGECUUJGPLMII2.json","graph_json":"https://pith.science/api/pith-number/D6YHADPK7T3SKGECUUJGPLMII2/graph.json","events_json":"https://pith.science/api/pith-number/D6YHADPK7T3SKGECUUJGPLMII2/events.json","paper":"https://pith.science/paper/D6YHADPK"},"agent_actions":{"view_html":"https://pith.science/pith/D6YHADPK7T3SKGECUUJGPLMII2","download_json":"https://pith.science/pith/D6YHADPK7T3SKGECUUJGPLMII2.json","view_paper":"https://pith.science/paper/D6YHADPK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.22929&json=true","fetch_graph":"https://pith.science/api/pith-number/D6YHADPK7T3SKGECUUJGPLMII2/graph.json","fetch_events":"https://pith.science/api/pith-number/D6YHADPK7T3SKGECUUJGPLMII2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D6YHADPK7T3SKGECUUJGPLMII2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D6YHADPK7T3SKGECUUJGPLMII2/action/storage_attestation","attest_author":"https://pith.science/pith/D6YHADPK7T3SKGECUUJGPLMII2/action/author_attestation","sign_citation":"https://pith.science/pith/D6YHADPK7T3SKGECUUJGPLMII2/action/citation_signature","submit_replication":"https://pith.science/pith/D6YHADPK7T3SKGECUUJGPLMII2/action/replication_record"}},"created_at":"2026-05-25T02:01:30.727365+00:00","updated_at":"2026-05-25T02:01:30.727365+00:00"}