{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XU3ZPFF67WQMOODKQLI2J5ILMJ","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":"4a2030d47a1d757535d3553fbb03d773370f1433fa0f913fb3313208367d4979","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-24T17:52:54Z","title_canon_sha256":"60d058cfb2459c5ecb6f48c2b9b7a0ac75c2db06f9dd0ed1fb218db0d81c5771"},"schema_version":"1.0","source":{"id":"2606.26077","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.26077","created_at":"2026-06-25T01:18:47Z"},{"alias_kind":"arxiv_version","alias_value":"2606.26077v1","created_at":"2026-06-25T01:18:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26077","created_at":"2026-06-25T01:18:47Z"},{"alias_kind":"pith_short_12","alias_value":"XU3ZPFF67WQM","created_at":"2026-06-25T01:18:47Z"},{"alias_kind":"pith_short_16","alias_value":"XU3ZPFF67WQMOODK","created_at":"2026-06-25T01:18:47Z"},{"alias_kind":"pith_short_8","alias_value":"XU3ZPFF6","created_at":"2026-06-25T01:18:47Z"}],"graph_snapshots":[{"event_id":"sha256:9d9f6fd6f4a6f7d002f22332821b405c179e3cb804643f870843c07c00d0afbf","target":"graph","created_at":"2026-06-25T01:18:47Z","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/2606.26077/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bicheng Ying, Edward Duc Hien Nguyen, Jaewook J. Suh, Shiqian Ma, TaeHo Yoon","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-24T17:52:54Z","title":"Toward a Systematic Understanding and Interactive Search of Lyapunov-Style Proofs in Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26077","kind":"arxiv","version":1},"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:61edbda8ef4d10b6d2884ee3a688038191e303e330db9ea2eca4b1c4eb3adae5","target":"record","created_at":"2026-06-25T01:18:47Z","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":"4a2030d47a1d757535d3553fbb03d773370f1433fa0f913fb3313208367d4979","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-24T17:52:54Z","title_canon_sha256":"60d058cfb2459c5ecb6f48c2b9b7a0ac75c2db06f9dd0ed1fb218db0d81c5771"},"schema_version":"1.0","source":{"id":"2606.26077","kind":"arxiv","version":1}},"canonical_sha256":"bd379794befda0c7386a82d1a4f50b624c27d14a043daea3d1d3c0b25c0e21de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd379794befda0c7386a82d1a4f50b624c27d14a043daea3d1d3c0b25c0e21de","first_computed_at":"2026-06-25T01:18:47.937530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T01:18:47.937530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Lj0Z/N7im3RsQbDXnoIt1cuT7aV443ijRPHiEQK/G/mVQdseVwALm31hi8W907XsrWvy6ZqF7oDKyoxB0BKBw==","signature_status":"signed_v1","signed_at":"2026-06-25T01:18:47.937922Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.26077","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61edbda8ef4d10b6d2884ee3a688038191e303e330db9ea2eca4b1c4eb3adae5","sha256:9d9f6fd6f4a6f7d002f22332821b405c179e3cb804643f870843c07c00d0afbf"],"state_sha256":"8fa4e004eb8cb434454bc0510659ffbca21f460b03d2b8a1e7818312759aece7"}