{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XU3ZPFF67WQMOODKQLI2J5ILMJ","short_pith_number":"pith:XU3ZPFF6","schema_version":"1.0","canonical_sha256":"bd379794befda0c7386a82d1a4f50b624c27d14a043daea3d1d3c0b25c0e21de","source":{"kind":"arxiv","id":"2606.26077","version":1},"attestation_state":"computed","paper":{"title":"Toward a Systematic Understanding and Interactive Search of Lyapunov-Style Proofs in Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bicheng Ying, Edward Duc Hien Nguyen, Jaewook J. Suh, Shiqian Ma, TaeHo Yoon","submitted_at":"2026-06-24T17:52:54Z","abstract_excerpt":"Lyapunov-style convergence proofs, which establish a nonincreasing sequence to provide a quantitative convergence rate for an algorithm, are popular and often considered desirable in first-order optimization. However, existing approaches to finding such Lyapunov functions rely on hand-designed templates or prior insight on the proof structure, and do not certify that the resulting Lyapunov-style analysis provides the sharpest convergence bound. In this work, we introduce a systematic framework for converting a tight, analytic convergence proof of an optimization algorithm, often found via comp"},"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":"2606.26077","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-24T17:52:54Z","cross_cats_sorted":[],"title_canon_sha256":"60d058cfb2459c5ecb6f48c2b9b7a0ac75c2db06f9dd0ed1fb218db0d81c5771","abstract_canon_sha256":"4a2030d47a1d757535d3553fbb03d773370f1433fa0f913fb3313208367d4979"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:18:47.937922Z","signature_b64":"2Lj0Z/N7im3RsQbDXnoIt1cuT7aV443ijRPHiEQK/G/mVQdseVwALm31hi8W907XsrWvy6ZqF7oDKyoxB0BKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd379794befda0c7386a82d1a4f50b624c27d14a043daea3d1d3c0b25c0e21de","last_reissued_at":"2026-06-25T01:18:47.937530Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:18:47.937530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward a Systematic Understanding and Interactive Search of Lyapunov-Style Proofs in Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bicheng Ying, Edward Duc Hien Nguyen, Jaewook J. Suh, Shiqian Ma, TaeHo Yoon","submitted_at":"2026-06-24T17:52:54Z","abstract_excerpt":"Lyapunov-style convergence proofs, which establish a nonincreasing sequence to provide a quantitative convergence rate for an algorithm, are popular and often considered desirable in first-order optimization. However, existing approaches to finding such Lyapunov functions rely on hand-designed templates or prior insight on the proof structure, and do not certify that the resulting Lyapunov-style analysis provides the sharpest convergence bound. In this work, we introduce a systematic framework for converting a tight, analytic convergence proof of an optimization algorithm, often found via comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26077","kind":"arxiv","version":1},"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/2606.26077/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.26077","created_at":"2026-06-25T01:18:47.937592+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.26077v1","created_at":"2026-06-25T01:18:47.937592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26077","created_at":"2026-06-25T01:18:47.937592+00:00"},{"alias_kind":"pith_short_12","alias_value":"XU3ZPFF67WQM","created_at":"2026-06-25T01:18:47.937592+00:00"},{"alias_kind":"pith_short_16","alias_value":"XU3ZPFF67WQMOODK","created_at":"2026-06-25T01:18:47.937592+00:00"},{"alias_kind":"pith_short_8","alias_value":"XU3ZPFF6","created_at":"2026-06-25T01:18:47.937592+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/XU3ZPFF67WQMOODKQLI2J5ILMJ","json":"https://pith.science/pith/XU3ZPFF67WQMOODKQLI2J5ILMJ.json","graph_json":"https://pith.science/api/pith-number/XU3ZPFF67WQMOODKQLI2J5ILMJ/graph.json","events_json":"https://pith.science/api/pith-number/XU3ZPFF67WQMOODKQLI2J5ILMJ/events.json","paper":"https://pith.science/paper/XU3ZPFF6"},"agent_actions":{"view_html":"https://pith.science/pith/XU3ZPFF67WQMOODKQLI2J5ILMJ","download_json":"https://pith.science/pith/XU3ZPFF67WQMOODKQLI2J5ILMJ.json","view_paper":"https://pith.science/paper/XU3ZPFF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.26077&json=true","fetch_graph":"https://pith.science/api/pith-number/XU3ZPFF67WQMOODKQLI2J5ILMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/XU3ZPFF67WQMOODKQLI2J5ILMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XU3ZPFF67WQMOODKQLI2J5ILMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XU3ZPFF67WQMOODKQLI2J5ILMJ/action/storage_attestation","attest_author":"https://pith.science/pith/XU3ZPFF67WQMOODKQLI2J5ILMJ/action/author_attestation","sign_citation":"https://pith.science/pith/XU3ZPFF67WQMOODKQLI2J5ILMJ/action/citation_signature","submit_replication":"https://pith.science/pith/XU3ZPFF67WQMOODKQLI2J5ILMJ/action/replication_record"}},"created_at":"2026-06-25T01:18:47.937592+00:00","updated_at":"2026-06-25T01:18:47.937592+00:00"}