{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YXVEYW6NXHZVN72C3VB54OCU7A","short_pith_number":"pith:YXVEYW6N","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"},"canonical_sha256":"c5ea4c5bcdb9f356ff42dd43de3854f82dbc81f4c8eb7d8e8955df72420d0471","source":{"kind":"arxiv","id":"1803.05676","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05676","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05676v3","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05676","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"YXVEYW6NXHZV","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YXVEYW6NXHZVN72C","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YXVEYW6N","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YXVEYW6NXHZVN72C3VB54OCU7A","target":"record","payload":{"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"},"canonical_sha256":"c5ea4c5bcdb9f356ff42dd43de3854f82dbc81f4c8eb7d8e8955df72420d0471","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"},"source_kind":"arxiv","source_id":"1803.05676","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-05-17T23:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mue50qRgWSEqwU3rZLJ45z/gPGor2DHwovNt1LE4BzLyNdR91WdgREUpdnX//N6dfUuxKEW5n+CnHaigyYclBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:01:27.249564Z"},"content_sha256":"35f2ceb6bab1227f6e7fb863aec37177791f284adab0d7c25e23b4499e8c6564","schema_version":"1.0","event_id":"sha256:35f2ceb6bab1227f6e7fb863aec37177791f284adab0d7c25e23b4499e8c6564"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YXVEYW6NXHZVN72C3VB54OCU7A","target":"graph","payload":{"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"},"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:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ig0msMjQImtGtG2R5FYzTUf6Gb8EjIOXDBd6Qtry8bAerZNw6LkQ0ET1gcAcrReBxQAJwOZpNb/J2TnXGvlfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:01:27.249922Z"},"content_sha256":"2c6997642017a69ef931d42850a41713487c4c87714cf85a91e8efd584144659","schema_version":"1.0","event_id":"sha256:2c6997642017a69ef931d42850a41713487c4c87714cf85a91e8efd584144659"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YXVEYW6NXHZVN72C3VB54OCU7A/bundle.json","state_url":"https://pith.science/pith/YXVEYW6NXHZVN72C3VB54OCU7A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YXVEYW6NXHZVN72C3VB54OCU7A/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-12T05:01:27Z","links":{"resolver":"https://pith.science/pith/YXVEYW6NXHZVN72C3VB54OCU7A","bundle":"https://pith.science/pith/YXVEYW6NXHZVN72C3VB54OCU7A/bundle.json","state":"https://pith.science/pith/YXVEYW6NXHZVN72C3VB54OCU7A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YXVEYW6NXHZVN72C3VB54OCU7A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YXVEYW6NXHZVN72C3VB54OCU7A","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":"a87f0160a5b41d32176036d2704646a18e0e5bcae98da8debebc1d8483434f8a","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-15T10:25:22Z","title_canon_sha256":"8ff0507fe7e0751c86a565ee412e9dc2ed2501092cee2d0c8a472193a6e4652b"},"schema_version":"1.0","source":{"id":"1803.05676","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05676","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05676v3","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05676","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"YXVEYW6NXHZV","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YXVEYW6NXHZVN72C","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YXVEYW6N","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:2c6997642017a69ef931d42850a41713487c4c87714cf85a91e8efd584144659","target":"graph","created_at":"2026-05-17T23:42: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"},"paper":{"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","authors_text":"Adrien B. Taylor, Yoel Drori","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-15T10:25:22Z","title":"Efficient First-order Methods for Convex Minimization: a Constructive Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05676","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:35f2ceb6bab1227f6e7fb863aec37177791f284adab0d7c25e23b4499e8c6564","target":"record","created_at":"2026-05-17T23:42: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":"a87f0160a5b41d32176036d2704646a18e0e5bcae98da8debebc1d8483434f8a","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-15T10:25:22Z","title_canon_sha256":"8ff0507fe7e0751c86a565ee412e9dc2ed2501092cee2d0c8a472193a6e4652b"},"schema_version":"1.0","source":{"id":"1803.05676","kind":"arxiv","version":3}},"canonical_sha256":"c5ea4c5bcdb9f356ff42dd43de3854f82dbc81f4c8eb7d8e8955df72420d0471","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5ea4c5bcdb9f356ff42dd43de3854f82dbc81f4c8eb7d8e8955df72420d0471","first_computed_at":"2026-05-17T23:42:14.230699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:14.230699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1dWZvN9JLdKoGLJFnuHWG8jO10E+FYkfxBUEZXOkj8wRufMRtR/ya1qucuF+XIuxqHZWYNdh6O9dkl++Z+JpAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:14.231657Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05676","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35f2ceb6bab1227f6e7fb863aec37177791f284adab0d7c25e23b4499e8c6564","sha256:2c6997642017a69ef931d42850a41713487c4c87714cf85a91e8efd584144659"],"state_sha256":"7b37a1d9a737de510c59548ac9933929cb82988dd0f6e119b1e8ce5ed7c1f794"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JdlR+/w9MXMkDVLaGBYxRZQ97Lh1muBtEpvz7JdSZ0X1znOAOtUIBub2SmuiKJgl64zuPA4lfd01bR2tyV9zBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T05:01:27.251902Z","bundle_sha256":"78770c2f1bbbb9f3260a00c3d57283291f04f1cff7e4eb1da9f69daea6fbdc7b"}}