{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YXVEYW6NXHZVN72C3VB54OCU7A","short_pith_number":"pith:YXVEYW6N","schema_version":"1.0","canonical_sha256":"c5ea4c5bcdb9f356ff42dd43de3854f82dbc81f4c8eb7d8e8955df72420d0471","source":{"kind":"arxiv","id":"1803.05676","version":3},"attestation_state":"computed","paper":{"title":"Efficient First-order Methods for Convex Minimization: a Constructive Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Adrien B. Taylor, Yoel Drori","submitted_at":"2018-03-15T10:25:22Z","abstract_excerpt":"We describe a novel constructive technique for devising efficient first-order methods for a wide range of large-scale convex minimization settings, including smooth, non-smooth, and strongly convex minimization. The technique builds upon a certain variant of the conjugate gradient method to construct a family of methods such that a) all methods in the family share the same worst-case guarantee as the base conjugate gradient method, and b) the family includes a fixed-step first-order method. We demonstrate the effectiveness of the approach by deriving optimal methods for the smooth and non-smoo"},"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":"1803.05676","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-15T10:25:22Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"8ff0507fe7e0751c86a565ee412e9dc2ed2501092cee2d0c8a472193a6e4652b","abstract_canon_sha256":"a87f0160a5b41d32176036d2704646a18e0e5bcae98da8debebc1d8483434f8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:14.231657Z","signature_b64":"1dWZvN9JLdKoGLJFnuHWG8jO10E+FYkfxBUEZXOkj8wRufMRtR/ya1qucuF+XIuxqHZWYNdh6O9dkl++Z+JpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5ea4c5bcdb9f356ff42dd43de3854f82dbc81f4c8eb7d8e8955df72420d0471","last_reissued_at":"2026-05-17T23:42:14.230699Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:14.230699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient First-order Methods for Convex Minimization: a Constructive Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Adrien B. Taylor, Yoel Drori","submitted_at":"2018-03-15T10:25:22Z","abstract_excerpt":"We describe a novel constructive technique for devising efficient first-order methods for a wide range of large-scale convex minimization settings, including smooth, non-smooth, and strongly convex minimization. The technique builds upon a certain variant of the conjugate gradient method to construct a family of methods such that a) all methods in the family share the same worst-case guarantee as the base conjugate gradient method, and b) the family includes a fixed-step first-order method. We demonstrate the effectiveness of the approach by deriving optimal methods for the smooth and non-smoo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05676","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":""},"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":"1803.05676","created_at":"2026-05-17T23:42:14.230831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05676v3","created_at":"2026-05-17T23:42:14.230831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05676","created_at":"2026-05-17T23:42:14.230831+00:00"},{"alias_kind":"pith_short_12","alias_value":"YXVEYW6NXHZV","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YXVEYW6NXHZVN72C","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YXVEYW6N","created_at":"2026-05-18T12:33:04.347982+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/YXVEYW6NXHZVN72C3VB54OCU7A","json":"https://pith.science/pith/YXVEYW6NXHZVN72C3VB54OCU7A.json","graph_json":"https://pith.science/api/pith-number/YXVEYW6NXHZVN72C3VB54OCU7A/graph.json","events_json":"https://pith.science/api/pith-number/YXVEYW6NXHZVN72C3VB54OCU7A/events.json","paper":"https://pith.science/paper/YXVEYW6N"},"agent_actions":{"view_html":"https://pith.science/pith/YXVEYW6NXHZVN72C3VB54OCU7A","download_json":"https://pith.science/pith/YXVEYW6NXHZVN72C3VB54OCU7A.json","view_paper":"https://pith.science/paper/YXVEYW6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05676&json=true","fetch_graph":"https://pith.science/api/pith-number/YXVEYW6NXHZVN72C3VB54OCU7A/graph.json","fetch_events":"https://pith.science/api/pith-number/YXVEYW6NXHZVN72C3VB54OCU7A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YXVEYW6NXHZVN72C3VB54OCU7A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YXVEYW6NXHZVN72C3VB54OCU7A/action/storage_attestation","attest_author":"https://pith.science/pith/YXVEYW6NXHZVN72C3VB54OCU7A/action/author_attestation","sign_citation":"https://pith.science/pith/YXVEYW6NXHZVN72C3VB54OCU7A/action/citation_signature","submit_replication":"https://pith.science/pith/YXVEYW6NXHZVN72C3VB54OCU7A/action/replication_record"}},"created_at":"2026-05-17T23:42:14.230831+00:00","updated_at":"2026-05-17T23:42:14.230831+00:00"}