{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:WCDCJST4TEBPFKBYOOVOSBODOH","short_pith_number":"pith:WCDCJST4","canonical_record":{"source":{"id":"2311.10053","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-11-16T17:48:06Z","cross_cats_sorted":["cs.LG","math.DS"],"title_canon_sha256":"b6a67ccd8c048435c87156c863881713202ada605c4baa5964d2bf2b4d0b7019","abstract_canon_sha256":"e4415fd97915fc22c6da8bf97036c58fc3eab670632a9ad1203cb046fbaac0a7"},"schema_version":"1.0"},"canonical_sha256":"b08624ca7c9902f2a83873aae905c371e24b1995d535a441319459f7a307ebd0","source":{"kind":"arxiv","id":"2311.10053","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.10053","created_at":"2026-07-05T08:07:59Z"},{"alias_kind":"arxiv_version","alias_value":"2311.10053v2","created_at":"2026-07-05T08:07:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.10053","created_at":"2026-07-05T08:07:59Z"},{"alias_kind":"pith_short_12","alias_value":"WCDCJST4TEBP","created_at":"2026-07-05T08:07:59Z"},{"alias_kind":"pith_short_16","alias_value":"WCDCJST4TEBPFKBY","created_at":"2026-07-05T08:07:59Z"},{"alias_kind":"pith_short_8","alias_value":"WCDCJST4","created_at":"2026-07-05T08:07:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:WCDCJST4TEBPFKBYOOVOSBODOH","target":"record","payload":{"canonical_record":{"source":{"id":"2311.10053","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-11-16T17:48:06Z","cross_cats_sorted":["cs.LG","math.DS"],"title_canon_sha256":"b6a67ccd8c048435c87156c863881713202ada605c4baa5964d2bf2b4d0b7019","abstract_canon_sha256":"e4415fd97915fc22c6da8bf97036c58fc3eab670632a9ad1203cb046fbaac0a7"},"schema_version":"1.0"},"canonical_sha256":"b08624ca7c9902f2a83873aae905c371e24b1995d535a441319459f7a307ebd0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:07:59.657696Z","signature_b64":"v9dzSL3GVXWGaiuzHpo6mTaugv3YFRsueQKAyHYyomqptaMmLeiW3D5gOPjxiVLQl+eNkrMFFCjZmTmVujYdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b08624ca7c9902f2a83873aae905c371e24b1995d535a441319459f7a307ebd0","last_reissued_at":"2026-07-05T08:07:59.657236Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:07:59.657236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.10053","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-07-05T08:07:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qhtybPxKosjUqItKAKXyZqs2T50XpZpAD06MWehv8w8OLCIfE7Yf6cPMeZLzMVev86JxIOE/jW97XGzLWMrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T21:10:37.572653Z"},"content_sha256":"47bd5776b49265f08945ec1195eab918cd157ff99e65cd173c7d7ca4b30c86bf","schema_version":"1.0","event_id":"sha256:47bd5776b49265f08945ec1195eab918cd157ff99e65cd173c7d7ca4b30c86bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:WCDCJST4TEBPFKBYOOVOSBODOH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-optimal Closed-loop Method via Lyapunov Damping for Convex Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.DS"],"primary_cat":"math.OC","authors_text":"Camille Castera, Peter Ochs, Severin Maier","submitted_at":"2023-11-16T17:48:06Z","abstract_excerpt":"We introduce an autonomous system with closed-loop damping for first-order convex optimization. While, to this day, optimal rates of convergence are almost exclusively achieved by non-autonomous methods via open-loop damping (e.g., Nesterov's algorithm), we show that our system, featuring a closed-loop damping, exhibits a rate arbitrarily close to the optimal one. We do so by coupling the damping and the speed of convergence of the system via a well-chosen Lyapunov function. By discretizing our system we then derive an algorithm and present numerical experiments supporting our theoretical find"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.10053","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.10053/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-07-05T08:07:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n0JDVsfg4vF+rG83Y/46BlAeUre/I2B37Of2lppJOEtT5L7ne1NxyxXpmMu42+aTisMIIQB94RvQgsy6jYvADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T21:10:37.573214Z"},"content_sha256":"129e05c6212752112859ea22c76147825c64db95a12099264cb53ba8ea0461be","schema_version":"1.0","event_id":"sha256:129e05c6212752112859ea22c76147825c64db95a12099264cb53ba8ea0461be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WCDCJST4TEBPFKBYOOVOSBODOH/bundle.json","state_url":"https://pith.science/pith/WCDCJST4TEBPFKBYOOVOSBODOH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WCDCJST4TEBPFKBYOOVOSBODOH/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-08-16T21:10:37Z","links":{"resolver":"https://pith.science/pith/WCDCJST4TEBPFKBYOOVOSBODOH","bundle":"https://pith.science/pith/WCDCJST4TEBPFKBYOOVOSBODOH/bundle.json","state":"https://pith.science/pith/WCDCJST4TEBPFKBYOOVOSBODOH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WCDCJST4TEBPFKBYOOVOSBODOH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:WCDCJST4TEBPFKBYOOVOSBODOH","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":"e4415fd97915fc22c6da8bf97036c58fc3eab670632a9ad1203cb046fbaac0a7","cross_cats_sorted":["cs.LG","math.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-11-16T17:48:06Z","title_canon_sha256":"b6a67ccd8c048435c87156c863881713202ada605c4baa5964d2bf2b4d0b7019"},"schema_version":"1.0","source":{"id":"2311.10053","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.10053","created_at":"2026-07-05T08:07:59Z"},{"alias_kind":"arxiv_version","alias_value":"2311.10053v2","created_at":"2026-07-05T08:07:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.10053","created_at":"2026-07-05T08:07:59Z"},{"alias_kind":"pith_short_12","alias_value":"WCDCJST4TEBP","created_at":"2026-07-05T08:07:59Z"},{"alias_kind":"pith_short_16","alias_value":"WCDCJST4TEBPFKBY","created_at":"2026-07-05T08:07:59Z"},{"alias_kind":"pith_short_8","alias_value":"WCDCJST4","created_at":"2026-07-05T08:07:59Z"}],"graph_snapshots":[{"event_id":"sha256:129e05c6212752112859ea22c76147825c64db95a12099264cb53ba8ea0461be","target":"graph","created_at":"2026-07-05T08:07:59Z","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/2311.10053/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce an autonomous system with closed-loop damping for first-order convex optimization. While, to this day, optimal rates of convergence are almost exclusively achieved by non-autonomous methods via open-loop damping (e.g., Nesterov's algorithm), we show that our system, featuring a closed-loop damping, exhibits a rate arbitrarily close to the optimal one. We do so by coupling the damping and the speed of convergence of the system via a well-chosen Lyapunov function. By discretizing our system we then derive an algorithm and present numerical experiments supporting our theoretical find","authors_text":"Camille Castera, Peter Ochs, Severin Maier","cross_cats":["cs.LG","math.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-11-16T17:48:06Z","title":"Near-optimal Closed-loop Method via Lyapunov Damping for Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.10053","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:47bd5776b49265f08945ec1195eab918cd157ff99e65cd173c7d7ca4b30c86bf","target":"record","created_at":"2026-07-05T08:07:59Z","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":"e4415fd97915fc22c6da8bf97036c58fc3eab670632a9ad1203cb046fbaac0a7","cross_cats_sorted":["cs.LG","math.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-11-16T17:48:06Z","title_canon_sha256":"b6a67ccd8c048435c87156c863881713202ada605c4baa5964d2bf2b4d0b7019"},"schema_version":"1.0","source":{"id":"2311.10053","kind":"arxiv","version":2}},"canonical_sha256":"b08624ca7c9902f2a83873aae905c371e24b1995d535a441319459f7a307ebd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b08624ca7c9902f2a83873aae905c371e24b1995d535a441319459f7a307ebd0","first_computed_at":"2026-07-05T08:07:59.657236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:07:59.657236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v9dzSL3GVXWGaiuzHpo6mTaugv3YFRsueQKAyHYyomqptaMmLeiW3D5gOPjxiVLQl+eNkrMFFCjZmTmVujYdCg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:07:59.657696Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.10053","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47bd5776b49265f08945ec1195eab918cd157ff99e65cd173c7d7ca4b30c86bf","sha256:129e05c6212752112859ea22c76147825c64db95a12099264cb53ba8ea0461be"],"state_sha256":"16805822e0996843f526e08389837da58b5d3ffbc83ef1d324e0008ea6e61285"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"szPXoVriNshj4+JFk0k4zX9h7c3mdarw9ke8oF3Bq/ToY2pJfcNU9zOBy8iytvGQ/D8N3NjDmpggPgffKP/kCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T21:10:37.637450Z","bundle_sha256":"54a64b071b35883cb9056c536d179bd1f998a6ce61956ea6dca042420bec194e"}}