{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KV377XHUGEVJ4B76ACNBUBGXCJ","short_pith_number":"pith:KV377XHU","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"},"canonical_sha256":"5577ffdcf4312a9e07fe009a1a04d712707b4ccd76fdb963cb403b05cf077bf1","source":{"kind":"arxiv","id":"1406.5468","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5468","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5468v4","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5468","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"pith_short_12","alias_value":"KV377XHUGEVJ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KV377XHUGEVJ4B76","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KV377XHU","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KV377XHUGEVJ4B76ACNBUBGXCJ","target":"record","payload":{"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"},"canonical_sha256":"5577ffdcf4312a9e07fe009a1a04d712707b4ccd76fdb963cb403b05cf077bf1","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"},"source_kind":"arxiv","source_id":"1406.5468","source_version":4,"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-05-17T23:43:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cOxjxgaBt5NiCHn0rnW1Zus0m5KCeLIOx3uG4mIzmPWqcv9jgUoQdJG23KEMa0jvio/99CdEKsCxxkyT7QCfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:44:43.282947Z"},"content_sha256":"eb90006e16545d4ff6ebcab070e73dd39e50cf084b57bd6c7136bf48fbaf8ba2","schema_version":"1.0","event_id":"sha256:eb90006e16545d4ff6ebcab070e73dd39e50cf084b57bd6c7136bf48fbaf8ba2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KV377XHUGEVJ4B76ACNBUBGXCJ","target":"graph","payload":{"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"},"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-05-17T23:43:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hSVIA8YW4S5wYMS1yPiFmNa49IIgmRKVZrT4rXCQIQtnKnKLzv4eR3dEmhDV9QgdlhQ7qI4rSMgW4BJFV4EYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:44:43.283684Z"},"content_sha256":"759686bec7ffd6a493c81e349881a8fb6b67b0586657343b2e04cfcad579c2e1","schema_version":"1.0","event_id":"sha256:759686bec7ffd6a493c81e349881a8fb6b67b0586657343b2e04cfcad579c2e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KV377XHUGEVJ4B76ACNBUBGXCJ/bundle.json","state_url":"https://pith.science/pith/KV377XHUGEVJ4B76ACNBUBGXCJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KV377XHUGEVJ4B76ACNBUBGXCJ/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-06-11T11:44:43Z","links":{"resolver":"https://pith.science/pith/KV377XHUGEVJ4B76ACNBUBGXCJ","bundle":"https://pith.science/pith/KV377XHUGEVJ4B76ACNBUBGXCJ/bundle.json","state":"https://pith.science/pith/KV377XHUGEVJ4B76ACNBUBGXCJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KV377XHUGEVJ4B76ACNBUBGXCJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KV377XHUGEVJ4B76ACNBUBGXCJ","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":"c324cc61764c96dcc840815392a4643ff2c00a0ddb9eb6596f9b69220b8270ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-20T17:30:16Z","title_canon_sha256":"48927b01d9adadbc210638735957b5428e3525480f77b73aab0812ede694151f"},"schema_version":"1.0","source":{"id":"1406.5468","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5468","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5468v4","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5468","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"pith_short_12","alias_value":"KV377XHUGEVJ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KV377XHUGEVJ4B76","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KV377XHU","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:759686bec7ffd6a493c81e349881a8fb6b67b0586657343b2e04cfcad579c2e1","target":"graph","created_at":"2026-05-17T23:43:28Z","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"},"paper":{"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","authors_text":"Donghwan Kim, Jeffrey A. Fessler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-20T17:30:16Z","title":"Optimized first-order methods for smooth convex minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5468","kind":"arxiv","version":4},"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:eb90006e16545d4ff6ebcab070e73dd39e50cf084b57bd6c7136bf48fbaf8ba2","target":"record","created_at":"2026-05-17T23:43:28Z","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":"c324cc61764c96dcc840815392a4643ff2c00a0ddb9eb6596f9b69220b8270ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-20T17:30:16Z","title_canon_sha256":"48927b01d9adadbc210638735957b5428e3525480f77b73aab0812ede694151f"},"schema_version":"1.0","source":{"id":"1406.5468","kind":"arxiv","version":4}},"canonical_sha256":"5577ffdcf4312a9e07fe009a1a04d712707b4ccd76fdb963cb403b05cf077bf1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5577ffdcf4312a9e07fe009a1a04d712707b4ccd76fdb963cb403b05cf077bf1","first_computed_at":"2026-05-17T23:43:28.886380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:28.886380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g/0A+Sd5ROS8/C2UO7qzw1NIk0tmALUKYFGzIvLzF7UL+wGgFtuxb4Byq/yqD4g+u6Sf5bbo3bqeKj0Kn8DWDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:28.887083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.5468","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb90006e16545d4ff6ebcab070e73dd39e50cf084b57bd6c7136bf48fbaf8ba2","sha256:759686bec7ffd6a493c81e349881a8fb6b67b0586657343b2e04cfcad579c2e1"],"state_sha256":"a40de4bf3c229f98f69f0de9eab125df2dbb119faee3036345115392b4752aff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8VGa41ggsZNSAomcPQrpqNT73aa+SIMoRWkJm0YDMmRIFxqziXoipMtX5XWd5y+4gIjv/gx7ZGknWWQ9G9yVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:44:43.287446Z","bundle_sha256":"8f5596c132f031eb47815ea5b308f11200983c12db7ba6429a9c4ec516dbd040"}}