{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KV377XHUGEVJ4B76ACNBUBGXCJ","short_pith_number":"pith:KV377XHU","schema_version":"1.0","canonical_sha256":"5577ffdcf4312a9e07fe009a1a04d712707b4ccd76fdb963cb403b05cf077bf1","source":{"kind":"arxiv","id":"1406.5468","version":4},"attestation_state":"computed","paper":{"title":"Optimized first-order methods for smooth convex minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Donghwan Kim, Jeffrey A. Fessler","submitted_at":"2014-06-20T17:30:16Z","abstract_excerpt":"We introduce new optimized first-order methods for smooth unconstrained convex minimization. Drori and Teboulle recently described a numerical method for computing the $N$-iteration optimal step coefficients in a class of first-order algorithms that includes gradient methods, heavy-ball methods, and Nesterov's fast gradient methods. However, Drori and Teboulle's numerical method is computationally expensive for large $N$, and the corresponding numerically optimized first-order algorithm requires impractical memory and computation for large-scale optimization problems. In this paper, we propose"},"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":"1406.5468","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-20T17:30:16Z","cross_cats_sorted":[],"title_canon_sha256":"48927b01d9adadbc210638735957b5428e3525480f77b73aab0812ede694151f","abstract_canon_sha256":"c324cc61764c96dcc840815392a4643ff2c00a0ddb9eb6596f9b69220b8270ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:28.887083Z","signature_b64":"g/0A+Sd5ROS8/C2UO7qzw1NIk0tmALUKYFGzIvLzF7UL+wGgFtuxb4Byq/yqD4g+u6Sf5bbo3bqeKj0Kn8DWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5577ffdcf4312a9e07fe009a1a04d712707b4ccd76fdb963cb403b05cf077bf1","last_reissued_at":"2026-05-17T23:43:28.886380Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:28.886380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimized first-order methods for smooth convex minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Donghwan Kim, Jeffrey A. Fessler","submitted_at":"2014-06-20T17:30:16Z","abstract_excerpt":"We introduce new optimized first-order methods for smooth unconstrained convex minimization. Drori and Teboulle recently described a numerical method for computing the $N$-iteration optimal step coefficients in a class of first-order algorithms that includes gradient methods, heavy-ball methods, and Nesterov's fast gradient methods. However, Drori and Teboulle's numerical method is computationally expensive for large $N$, and the corresponding numerically optimized first-order algorithm requires impractical memory and computation for large-scale optimization problems. In this paper, we propose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5468","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1406.5468","created_at":"2026-05-17T23:43:28.886493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.5468v4","created_at":"2026-05-17T23:43:28.886493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5468","created_at":"2026-05-17T23:43:28.886493+00:00"},{"alias_kind":"pith_short_12","alias_value":"KV377XHUGEVJ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KV377XHUGEVJ4B76","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KV377XHU","created_at":"2026-05-18T12:28:35.611951+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/KV377XHUGEVJ4B76ACNBUBGXCJ","json":"https://pith.science/pith/KV377XHUGEVJ4B76ACNBUBGXCJ.json","graph_json":"https://pith.science/api/pith-number/KV377XHUGEVJ4B76ACNBUBGXCJ/graph.json","events_json":"https://pith.science/api/pith-number/KV377XHUGEVJ4B76ACNBUBGXCJ/events.json","paper":"https://pith.science/paper/KV377XHU"},"agent_actions":{"view_html":"https://pith.science/pith/KV377XHUGEVJ4B76ACNBUBGXCJ","download_json":"https://pith.science/pith/KV377XHUGEVJ4B76ACNBUBGXCJ.json","view_paper":"https://pith.science/paper/KV377XHU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.5468&json=true","fetch_graph":"https://pith.science/api/pith-number/KV377XHUGEVJ4B76ACNBUBGXCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KV377XHUGEVJ4B76ACNBUBGXCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KV377XHUGEVJ4B76ACNBUBGXCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KV377XHUGEVJ4B76ACNBUBGXCJ/action/storage_attestation","attest_author":"https://pith.science/pith/KV377XHUGEVJ4B76ACNBUBGXCJ/action/author_attestation","sign_citation":"https://pith.science/pith/KV377XHUGEVJ4B76ACNBUBGXCJ/action/citation_signature","submit_replication":"https://pith.science/pith/KV377XHUGEVJ4B76ACNBUBGXCJ/action/replication_record"}},"created_at":"2026-05-17T23:43:28.886493+00:00","updated_at":"2026-05-17T23:43:28.886493+00:00"}