{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:XCA5YAIRCCAD7OR4TKQM7K2TE7","short_pith_number":"pith:XCA5YAIR","canonical_record":{"source":{"id":"2101.09741","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-01-24T16:20:56Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"9c6c6d0e8d4885f0d67f0d2a0293938809b483ba7f0fd64b656aecbbed2b891b","abstract_canon_sha256":"05e35c023bc01c2e6bf7ac48b7f4e6de7e1a1f03774216139f222ed5f820fd26"},"schema_version":"1.0"},"canonical_sha256":"b881dc011110803fba3c9aa0cfab5327cbb4df720266f0e1140be88b428abb66","source":{"kind":"arxiv","id":"2101.09741","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.09741","created_at":"2026-07-05T04:31:20Z"},{"alias_kind":"arxiv_version","alias_value":"2101.09741v3","created_at":"2026-07-05T04:31:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.09741","created_at":"2026-07-05T04:31:20Z"},{"alias_kind":"pith_short_12","alias_value":"XCA5YAIRCCAD","created_at":"2026-07-05T04:31:20Z"},{"alias_kind":"pith_short_16","alias_value":"XCA5YAIRCCAD7OR4","created_at":"2026-07-05T04:31:20Z"},{"alias_kind":"pith_short_8","alias_value":"XCA5YAIR","created_at":"2026-07-05T04:31:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:XCA5YAIRCCAD7OR4TKQM7K2TE7","target":"record","payload":{"canonical_record":{"source":{"id":"2101.09741","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-01-24T16:20:56Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"9c6c6d0e8d4885f0d67f0d2a0293938809b483ba7f0fd64b656aecbbed2b891b","abstract_canon_sha256":"05e35c023bc01c2e6bf7ac48b7f4e6de7e1a1f03774216139f222ed5f820fd26"},"schema_version":"1.0"},"canonical_sha256":"b881dc011110803fba3c9aa0cfab5327cbb4df720266f0e1140be88b428abb66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:20.450700Z","signature_b64":"M8cQRAmtUfieUUI0UgnIS4VipYnYbc4gPW8yHZm7oW8O7hr9BSbAnQcizTd9sMNcuAHYOHl4sEBwQ3rekctWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b881dc011110803fba3c9aa0cfab5327cbb4df720266f0e1140be88b428abb66","last_reissued_at":"2026-07-05T04:31:20.450273Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:20.450273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.09741","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-07-05T04:31:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wPJFLZM3nPs/4xPGmjhNMisHfvgmrYowF7p0W/6w1dP+iPmqGYBufTOJwSfgSVUz5WgMjXucC+MPVt+N35JICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:53:55.821136Z"},"content_sha256":"f9f1051585fc7ea5c8bc9e366afb1c80ff70b9ff03f1085c90b3b92d439a3079","schema_version":"1.0","event_id":"sha256:f9f1051585fc7ea5c8bc9e366afb1c80ff70b9ff03f1085c90b3b92d439a3079"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:XCA5YAIRCCAD7OR4TKQM7K2TE7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An optimal gradient method for smooth strongly convex minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Adrien Taylor, Yoel Drori","submitted_at":"2021-01-24T16:20:56Z","abstract_excerpt":"We present an optimal gradient method for smooth strongly convex optimization. The method is optimal in the sense that its worst-case bound on the distance to an optimal point exactly matches the lower bound on the oracle complexity for the class of problems, meaning that no black-box first-order method can have a better worst-case guarantee without further assumptions on the class of problems at hand. In addition, we provide a constructive recipe for obtaining the algorithmic parameters of the method and illustrate that it can be used for deriving methods for other optimality criteria as well"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.09741","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.09741/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"},"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-07-05T04:31:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rW8qQSAXWx13sRAHLVAVWw2i0uEA/xzQ9Uafae6FIBbmYOOhabOMQTVG9IQ2fzy83Nv2of06uuxD1aHlSOnjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:53:55.821676Z"},"content_sha256":"701710e0cecdccc2ab762799f6037a4eb23bfdab3c291b822e40b0af6b166efe","schema_version":"1.0","event_id":"sha256:701710e0cecdccc2ab762799f6037a4eb23bfdab3c291b822e40b0af6b166efe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCA5YAIRCCAD7OR4TKQM7K2TE7/bundle.json","state_url":"https://pith.science/pith/XCA5YAIRCCAD7OR4TKQM7K2TE7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCA5YAIRCCAD7OR4TKQM7K2TE7/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-08-03T22:53:55Z","links":{"resolver":"https://pith.science/pith/XCA5YAIRCCAD7OR4TKQM7K2TE7","bundle":"https://pith.science/pith/XCA5YAIRCCAD7OR4TKQM7K2TE7/bundle.json","state":"https://pith.science/pith/XCA5YAIRCCAD7OR4TKQM7K2TE7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCA5YAIRCCAD7OR4TKQM7K2TE7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:XCA5YAIRCCAD7OR4TKQM7K2TE7","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":"05e35c023bc01c2e6bf7ac48b7f4e6de7e1a1f03774216139f222ed5f820fd26","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-01-24T16:20:56Z","title_canon_sha256":"9c6c6d0e8d4885f0d67f0d2a0293938809b483ba7f0fd64b656aecbbed2b891b"},"schema_version":"1.0","source":{"id":"2101.09741","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.09741","created_at":"2026-07-05T04:31:20Z"},{"alias_kind":"arxiv_version","alias_value":"2101.09741v3","created_at":"2026-07-05T04:31:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.09741","created_at":"2026-07-05T04:31:20Z"},{"alias_kind":"pith_short_12","alias_value":"XCA5YAIRCCAD","created_at":"2026-07-05T04:31:20Z"},{"alias_kind":"pith_short_16","alias_value":"XCA5YAIRCCAD7OR4","created_at":"2026-07-05T04:31:20Z"},{"alias_kind":"pith_short_8","alias_value":"XCA5YAIR","created_at":"2026-07-05T04:31:20Z"}],"graph_snapshots":[{"event_id":"sha256:701710e0cecdccc2ab762799f6037a4eb23bfdab3c291b822e40b0af6b166efe","target":"graph","created_at":"2026-07-05T04:31:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2101.09741/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an optimal gradient method for smooth strongly convex optimization. The method is optimal in the sense that its worst-case bound on the distance to an optimal point exactly matches the lower bound on the oracle complexity for the class of problems, meaning that no black-box first-order method can have a better worst-case guarantee without further assumptions on the class of problems at hand. In addition, we provide a constructive recipe for obtaining the algorithmic parameters of the method and illustrate that it can be used for deriving methods for other optimality criteria as well","authors_text":"Adrien 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":"2021-01-24T16:20:56Z","title":"An optimal gradient method for smooth strongly convex minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.09741","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:f9f1051585fc7ea5c8bc9e366afb1c80ff70b9ff03f1085c90b3b92d439a3079","target":"record","created_at":"2026-07-05T04:31:20Z","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":"05e35c023bc01c2e6bf7ac48b7f4e6de7e1a1f03774216139f222ed5f820fd26","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-01-24T16:20:56Z","title_canon_sha256":"9c6c6d0e8d4885f0d67f0d2a0293938809b483ba7f0fd64b656aecbbed2b891b"},"schema_version":"1.0","source":{"id":"2101.09741","kind":"arxiv","version":3}},"canonical_sha256":"b881dc011110803fba3c9aa0cfab5327cbb4df720266f0e1140be88b428abb66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b881dc011110803fba3c9aa0cfab5327cbb4df720266f0e1140be88b428abb66","first_computed_at":"2026-07-05T04:31:20.450273Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:31:20.450273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M8cQRAmtUfieUUI0UgnIS4VipYnYbc4gPW8yHZm7oW8O7hr9BSbAnQcizTd9sMNcuAHYOHl4sEBwQ3rekctWBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:31:20.450700Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.09741","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9f1051585fc7ea5c8bc9e366afb1c80ff70b9ff03f1085c90b3b92d439a3079","sha256:701710e0cecdccc2ab762799f6037a4eb23bfdab3c291b822e40b0af6b166efe"],"state_sha256":"f92bb3e8965891a6b9738b19cd50d12b9925b15044141d528e54dda7eb76fc4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"obAW0XcUXm8q6m0oIe2tMCjXgrbUoBT+K/Tzkdv/TA0qC523N4vcWanTH8N9pmcFM7CQW5hr8MSq8gX3G5BQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T22:53:55.826808Z","bundle_sha256":"78335c9b42ea4c33ce2c6a850eac8a029c10f066e52b6a048e704f328fabb4f4"}}