{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XU3ZPFF67WQMOODKQLI2J5ILMJ","short_pith_number":"pith:XU3ZPFF6","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"},"canonical_sha256":"bd379794befda0c7386a82d1a4f50b624c27d14a043daea3d1d3c0b25c0e21de","source":{"kind":"arxiv","id":"2606.26077","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XU3ZPFF67WQMOODKQLI2J5ILMJ","target":"record","payload":{"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"},"canonical_sha256":"bd379794befda0c7386a82d1a4f50b624c27d14a043daea3d1d3c0b25c0e21de","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"},"source_kind":"arxiv","source_id":"2606.26077","source_version":1,"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-06-25T01:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3oBPtZ/m7NDy0LL0H+bbQ7MHb4twsIYukdd2KrNbyNV81KsqXldUmqQTYUDo2KeRi0uzoDEko2fXY57x8MZYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T03:08:50.470499Z"},"content_sha256":"61edbda8ef4d10b6d2884ee3a688038191e303e330db9ea2eca4b1c4eb3adae5","schema_version":"1.0","event_id":"sha256:61edbda8ef4d10b6d2884ee3a688038191e303e330db9ea2eca4b1c4eb3adae5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XU3ZPFF67WQMOODKQLI2J5ILMJ","target":"graph","payload":{"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"},"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-06-25T01:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GOQDlHCsyUnhxkmVsJs746FvcrFxRzaYABIvoydElj95q/ztAyNxhWVW3+Ogx4aDhkHoXWSI5FfTbkKJdmP1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T03:08:50.470869Z"},"content_sha256":"9d9f6fd6f4a6f7d002f22332821b405c179e3cb804643f870843c07c00d0afbf","schema_version":"1.0","event_id":"sha256:9d9f6fd6f4a6f7d002f22332821b405c179e3cb804643f870843c07c00d0afbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XU3ZPFF67WQMOODKQLI2J5ILMJ/bundle.json","state_url":"https://pith.science/pith/XU3ZPFF67WQMOODKQLI2J5ILMJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XU3ZPFF67WQMOODKQLI2J5ILMJ/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-28T03:08:50Z","links":{"resolver":"https://pith.science/pith/XU3ZPFF67WQMOODKQLI2J5ILMJ","bundle":"https://pith.science/pith/XU3ZPFF67WQMOODKQLI2J5ILMJ/bundle.json","state":"https://pith.science/pith/XU3ZPFF67WQMOODKQLI2J5ILMJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XU3ZPFF67WQMOODKQLI2J5ILMJ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tSNjEjHQmRDF73aYzZ+/Earri29GgOjV5jrL5jFqQzlLM6HlIW8H37JlcF23QVyvru6KOjp+22XKSarOlJjeBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T03:08:50.472795Z","bundle_sha256":"e111d4f7048c35dc118cd4dd7e06529c3dc49851301c18b57807167d5db5cac5"}}