{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HMTOIDZ6ERDGDWRQ5JMAKHFXGH","short_pith_number":"pith:HMTOIDZ6","canonical_record":{"source":{"id":"1803.06073","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-16T04:48:06Z","cross_cats_sorted":[],"title_canon_sha256":"6d9eff353d420fc16ac8eae01bf83fd718bd717351a66f4a349236d698baa08a","abstract_canon_sha256":"788ea7c0a6b64d238efbf6f53c96ed12b9b466e1f19e08d683a6fb1bf77bd1b6"},"schema_version":"1.0"},"canonical_sha256":"3b26e40f3e244661da30ea58051cb731f1e48ca067c7fc71cc6bf95bfb331a0c","source":{"kind":"arxiv","id":"1803.06073","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06073","created_at":"2026-05-18T00:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06073v2","created_at":"2026-05-18T00:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06073","created_at":"2026-05-18T00:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"HMTOIDZ6ERDG","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HMTOIDZ6ERDGDWRQ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HMTOIDZ6","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HMTOIDZ6ERDGDWRQ5JMAKHFXGH","target":"record","payload":{"canonical_record":{"source":{"id":"1803.06073","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-16T04:48:06Z","cross_cats_sorted":[],"title_canon_sha256":"6d9eff353d420fc16ac8eae01bf83fd718bd717351a66f4a349236d698baa08a","abstract_canon_sha256":"788ea7c0a6b64d238efbf6f53c96ed12b9b466e1f19e08d683a6fb1bf77bd1b6"},"schema_version":"1.0"},"canonical_sha256":"3b26e40f3e244661da30ea58051cb731f1e48ca067c7fc71cc6bf95bfb331a0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:37.113239Z","signature_b64":"5bA3YSrJbj/ByOGIoVG841KHgoXsZ+jXsN7PXMKu3zLn0bJG6BGAv/Urh9SOrT8e3i4aRwUc8sMz2Vl0JDdGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b26e40f3e244661da30ea58051cb731f1e48ca067c7fc71cc6bf95bfb331a0c","last_reissued_at":"2026-05-18T00:13:37.112605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:37.112605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.06073","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-18T00:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"90kqVwTmDbCCQQptDg5PUKtK11e92K8tr0Ij5W6LWv7HPlLPcO4TB604G2J45Jt7TPJeViz+kmp1K439t/vQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T09:03:22.628525Z"},"content_sha256":"e103f470b55f825302e3b8b41e5b00ccbe2647c8818f2bdfd0944eddae18847a","schema_version":"1.0","event_id":"sha256:e103f470b55f825302e3b8b41e5b00ccbe2647c8818f2bdfd0944eddae18847a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HMTOIDZ6ERDGDWRQ5JMAKHFXGH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lyapunov Functions for First-Order Methods: Tight Automated Convergence Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrien Taylor, Bryan Van Scoy, Laurent Lessard","submitted_at":"2018-03-16T04:48:06Z","abstract_excerpt":"We present a novel way of generating Lyapunov functions for proving linear convergence rates of first-order optimization methods. Our approach provably obtains the fastest linear convergence rate that can be verified by a quadratic Lyapunov function (with given states), and only relies on solving a small-sized semidefinite program. Our approach combines the advantages of performance estimation problems (PEP, due to Drori & Teboulle (2014)) and integral quadratic constraints (IQC, due to Lessard et al. (2016)), and relies on convex interpolation (due to Taylor et al. (2017c;b))."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06073","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-18T00:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X9lYq3OjeOnDp/7i1VRun3X21r8tgUdtfQnWtcDTDvCOhGIL41TxEvQWf4vCc2OPMp9zMZGWMJ45kTmWYkfXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T09:03:22.629211Z"},"content_sha256":"7f900c732370d83efb4a9bc26e6711a1623b1bda69b22e3eeb6bf740ecf50263","schema_version":"1.0","event_id":"sha256:7f900c732370d83efb4a9bc26e6711a1623b1bda69b22e3eeb6bf740ecf50263"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMTOIDZ6ERDGDWRQ5JMAKHFXGH/bundle.json","state_url":"https://pith.science/pith/HMTOIDZ6ERDGDWRQ5JMAKHFXGH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMTOIDZ6ERDGDWRQ5JMAKHFXGH/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-05-24T09:03:22Z","links":{"resolver":"https://pith.science/pith/HMTOIDZ6ERDGDWRQ5JMAKHFXGH","bundle":"https://pith.science/pith/HMTOIDZ6ERDGDWRQ5JMAKHFXGH/bundle.json","state":"https://pith.science/pith/HMTOIDZ6ERDGDWRQ5JMAKHFXGH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMTOIDZ6ERDGDWRQ5JMAKHFXGH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HMTOIDZ6ERDGDWRQ5JMAKHFXGH","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":"788ea7c0a6b64d238efbf6f53c96ed12b9b466e1f19e08d683a6fb1bf77bd1b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-16T04:48:06Z","title_canon_sha256":"6d9eff353d420fc16ac8eae01bf83fd718bd717351a66f4a349236d698baa08a"},"schema_version":"1.0","source":{"id":"1803.06073","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06073","created_at":"2026-05-18T00:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06073v2","created_at":"2026-05-18T00:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06073","created_at":"2026-05-18T00:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"HMTOIDZ6ERDG","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HMTOIDZ6ERDGDWRQ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HMTOIDZ6","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:7f900c732370d83efb4a9bc26e6711a1623b1bda69b22e3eeb6bf740ecf50263","target":"graph","created_at":"2026-05-18T00:13: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 present a novel way of generating Lyapunov functions for proving linear convergence rates of first-order optimization methods. Our approach provably obtains the fastest linear convergence rate that can be verified by a quadratic Lyapunov function (with given states), and only relies on solving a small-sized semidefinite program. Our approach combines the advantages of performance estimation problems (PEP, due to Drori & Teboulle (2014)) and integral quadratic constraints (IQC, due to Lessard et al. (2016)), and relies on convex interpolation (due to Taylor et al. (2017c;b)).","authors_text":"Adrien Taylor, Bryan Van Scoy, Laurent Lessard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-16T04:48:06Z","title":"Lyapunov Functions for First-Order Methods: Tight Automated Convergence Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06073","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:e103f470b55f825302e3b8b41e5b00ccbe2647c8818f2bdfd0944eddae18847a","target":"record","created_at":"2026-05-18T00:13: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":"788ea7c0a6b64d238efbf6f53c96ed12b9b466e1f19e08d683a6fb1bf77bd1b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-16T04:48:06Z","title_canon_sha256":"6d9eff353d420fc16ac8eae01bf83fd718bd717351a66f4a349236d698baa08a"},"schema_version":"1.0","source":{"id":"1803.06073","kind":"arxiv","version":2}},"canonical_sha256":"3b26e40f3e244661da30ea58051cb731f1e48ca067c7fc71cc6bf95bfb331a0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b26e40f3e244661da30ea58051cb731f1e48ca067c7fc71cc6bf95bfb331a0c","first_computed_at":"2026-05-18T00:13:37.112605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:37.112605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5bA3YSrJbj/ByOGIoVG841KHgoXsZ+jXsN7PXMKu3zLn0bJG6BGAv/Urh9SOrT8e3i4aRwUc8sMz2Vl0JDdGDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:37.113239Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06073","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e103f470b55f825302e3b8b41e5b00ccbe2647c8818f2bdfd0944eddae18847a","sha256:7f900c732370d83efb4a9bc26e6711a1623b1bda69b22e3eeb6bf740ecf50263"],"state_sha256":"fd6dfa86428f19ebb127370c15496c3216f1358f618dba0980d7421e471e7234"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"koBBXsLxv4gP7n8H//6Rs/dMTN6/nwdIMt5mai3D629e0f6XA04ImBWbRtcG5GWzJkIgrb+iNZ3PGqS4KgJRDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T09:03:22.633072Z","bundle_sha256":"927fd6f98256e0a3f2c3a3c257feaa2a482f5235f4985e97d04be596d75c1a3e"}}