{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DXSFVE5CZTY7VNJ3SMZ3DPXYRX","short_pith_number":"pith:DXSFVE5C","canonical_record":{"source":{"id":"1606.09365","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-30T06:51:10Z","cross_cats_sorted":[],"title_canon_sha256":"5ceb9e2d44b6ab252825e1c39947ab55d96397c1bd1978d85853beab83964f81","abstract_canon_sha256":"472ed109800a49f558cd602a3331947302786c6ae85f21d23c71454b1299403e"},"schema_version":"1.0"},"canonical_sha256":"1de45a93a2ccf1fab53b9333b1bef88deb0a6746a39858798cf41245f5afbb22","source":{"kind":"arxiv","id":"1606.09365","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.09365","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"1606.09365v2","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09365","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"DXSFVE5CZTY7","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DXSFVE5CZTY7VNJ3","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DXSFVE5C","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DXSFVE5CZTY7VNJ3SMZ3DPXYRX","target":"record","payload":{"canonical_record":{"source":{"id":"1606.09365","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-30T06:51:10Z","cross_cats_sorted":[],"title_canon_sha256":"5ceb9e2d44b6ab252825e1c39947ab55d96397c1bd1978d85853beab83964f81","abstract_canon_sha256":"472ed109800a49f558cd602a3331947302786c6ae85f21d23c71454b1299403e"},"schema_version":"1.0"},"canonical_sha256":"1de45a93a2ccf1fab53b9333b1bef88deb0a6746a39858798cf41245f5afbb22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:37.150001Z","signature_b64":"MrrSt49lLB/UpjrP3Psiby92fW/l7Ly17wS2NlzCM1Rr/nvkGRBoVMNSmdHL/8DuOd4Vy5A53eFbQ5mA6yuUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1de45a93a2ccf1fab53b9333b1bef88deb0a6746a39858798cf41245f5afbb22","last_reissued_at":"2026-05-18T01:04:37.149307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:37.149307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.09365","source_version":2,"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-18T01:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L3UkD+vCsi6xYhCdOlsfJ0cnQslIi5p+S+PWnCAMVG8iFACLYbC6N5aCAbaXxhPKkLWqExCuox1xh/KF9oXCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:56:56.538810Z"},"content_sha256":"11b1ea55316a314df67916394b6975c6dc119be7ee20e9efeb60f442b65509c9","schema_version":"1.0","event_id":"sha256:11b1ea55316a314df67916394b6975c6dc119be7ee20e9efeb60f442b65509c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DXSFVE5CZTY7VNJ3SMZ3DPXYRX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrien B. Taylor, Etienne de Klerk, Fran\\c{c}ois Glineur","submitted_at":"2016-06-30T06:51:10Z","abstract_excerpt":"We consider the gradient (or steepest) descent method with exact line search applied to a strongly convex function with Lipschitz continuous gradient. We establish the exact worst-case rate of convergence of this scheme, and show that this worst-case behavior is exhibited by a certain convex quadratic function. We also give the tight worst-case complexity bound for a noisy variant of gradient descent method, where exact line-search is performed in a search direction that differs from negative gradient by at most a prescribed relative tolerance.\n  The proofs are computer-assisted, and rely on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09365","kind":"arxiv","version":2},"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-18T01:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2xDqgWVzVJPaLC5efix7z3ARmuBBYNFqmGKIEZlUAZBjaZg92WXaDvm/FO34KhYyH9yoRJKumIcN3/EVBVL0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:56:56.539589Z"},"content_sha256":"3922fa831d753e5a8919dc46dd509feb1913df68ad5f8971cb7dd792abb2a713","schema_version":"1.0","event_id":"sha256:3922fa831d753e5a8919dc46dd509feb1913df68ad5f8971cb7dd792abb2a713"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXSFVE5CZTY7VNJ3SMZ3DPXYRX/bundle.json","state_url":"https://pith.science/pith/DXSFVE5CZTY7VNJ3SMZ3DPXYRX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXSFVE5CZTY7VNJ3SMZ3DPXYRX/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-12T00:56:56Z","links":{"resolver":"https://pith.science/pith/DXSFVE5CZTY7VNJ3SMZ3DPXYRX","bundle":"https://pith.science/pith/DXSFVE5CZTY7VNJ3SMZ3DPXYRX/bundle.json","state":"https://pith.science/pith/DXSFVE5CZTY7VNJ3SMZ3DPXYRX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXSFVE5CZTY7VNJ3SMZ3DPXYRX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DXSFVE5CZTY7VNJ3SMZ3DPXYRX","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":"472ed109800a49f558cd602a3331947302786c6ae85f21d23c71454b1299403e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-30T06:51:10Z","title_canon_sha256":"5ceb9e2d44b6ab252825e1c39947ab55d96397c1bd1978d85853beab83964f81"},"schema_version":"1.0","source":{"id":"1606.09365","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.09365","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"1606.09365v2","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09365","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"DXSFVE5CZTY7","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DXSFVE5CZTY7VNJ3","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DXSFVE5C","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:3922fa831d753e5a8919dc46dd509feb1913df68ad5f8971cb7dd792abb2a713","target":"graph","created_at":"2026-05-18T01:04:37Z","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 consider the gradient (or steepest) descent method with exact line search applied to a strongly convex function with Lipschitz continuous gradient. We establish the exact worst-case rate of convergence of this scheme, and show that this worst-case behavior is exhibited by a certain convex quadratic function. We also give the tight worst-case complexity bound for a noisy variant of gradient descent method, where exact line-search is performed in a search direction that differs from negative gradient by at most a prescribed relative tolerance.\n  The proofs are computer-assisted, and rely on t","authors_text":"Adrien B. Taylor, Etienne de Klerk, Fran\\c{c}ois Glineur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-30T06:51:10Z","title":"On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09365","kind":"arxiv","version":2},"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:11b1ea55316a314df67916394b6975c6dc119be7ee20e9efeb60f442b65509c9","target":"record","created_at":"2026-05-18T01:04:37Z","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":"472ed109800a49f558cd602a3331947302786c6ae85f21d23c71454b1299403e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-30T06:51:10Z","title_canon_sha256":"5ceb9e2d44b6ab252825e1c39947ab55d96397c1bd1978d85853beab83964f81"},"schema_version":"1.0","source":{"id":"1606.09365","kind":"arxiv","version":2}},"canonical_sha256":"1de45a93a2ccf1fab53b9333b1bef88deb0a6746a39858798cf41245f5afbb22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1de45a93a2ccf1fab53b9333b1bef88deb0a6746a39858798cf41245f5afbb22","first_computed_at":"2026-05-18T01:04:37.149307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:37.149307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MrrSt49lLB/UpjrP3Psiby92fW/l7Ly17wS2NlzCM1Rr/nvkGRBoVMNSmdHL/8DuOd4Vy5A53eFbQ5mA6yuUCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:37.150001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.09365","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11b1ea55316a314df67916394b6975c6dc119be7ee20e9efeb60f442b65509c9","sha256:3922fa831d753e5a8919dc46dd509feb1913df68ad5f8971cb7dd792abb2a713"],"state_sha256":"47bc97df29b744b0ad34d6716403393b6cd6c4954a7e2b1cdc46024dac404c6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nzfg/KQp83lr9CRpl8kfu/F4p6ekiCAgjwfZ5Z6Sl2xMnzreoSFWDq9UnGm3QDOWiB3lvyd5BaufUgEKOTNpDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:56:56.543945Z","bundle_sha256":"31d07e4c1a450d6717373b63c242679864d1fb081d391001d37d7fc821013bcc"}}