{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:CEKRN452CFAJ3AHKBQV24URFH6","short_pith_number":"pith:CEKRN452","canonical_record":{"source":{"id":"2304.02459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-04-05T14:37:21Z","cross_cats_sorted":[],"title_canon_sha256":"5309f5dd80e4b5b8763b53e74b64e82f9b62f3c58ce39c0bbb2a26070ec5040b","abstract_canon_sha256":"4fb6b290050a78dd433750fe9b43ed9f3283a5e934095e55bdd68d504479ea9a"},"schema_version":"1.0"},"canonical_sha256":"111516f3ba11409d80ea0c2bae52253fbdcdf5112755c3c04b68bcb4cbbc9b0c","source":{"kind":"arxiv","id":"2304.02459","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.02459","created_at":"2026-07-05T05:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"2304.02459v1","created_at":"2026-07-05T05:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.02459","created_at":"2026-07-05T05:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"CEKRN452CFAJ","created_at":"2026-07-05T05:58:25Z"},{"alias_kind":"pith_short_16","alias_value":"CEKRN452CFAJ3AHK","created_at":"2026-07-05T05:58:25Z"},{"alias_kind":"pith_short_8","alias_value":"CEKRN452","created_at":"2026-07-05T05:58:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:CEKRN452CFAJ3AHKBQV24URFH6","target":"record","payload":{"canonical_record":{"source":{"id":"2304.02459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-04-05T14:37:21Z","cross_cats_sorted":[],"title_canon_sha256":"5309f5dd80e4b5b8763b53e74b64e82f9b62f3c58ce39c0bbb2a26070ec5040b","abstract_canon_sha256":"4fb6b290050a78dd433750fe9b43ed9f3283a5e934095e55bdd68d504479ea9a"},"schema_version":"1.0"},"canonical_sha256":"111516f3ba11409d80ea0c2bae52253fbdcdf5112755c3c04b68bcb4cbbc9b0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:58:25.781640Z","signature_b64":"108jZty8kWX7J0+nx5BUtDPxKIaYADCOjwGkUM713+zpNF2XmVNrrqBbN+Su46SBWc9zl39CIk4HPXJSx1BYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"111516f3ba11409d80ea0c2bae52253fbdcdf5112755c3c04b68bcb4cbbc9b0c","last_reissued_at":"2026-07-05T05:58:25.781282Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:58:25.781282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2304.02459","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-07-05T05:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ii1RgO2FqOtj41seXE+ZdEFMVuVVJ4bvmsesoYqBR+YcNJwXANzZMFRQlfhhGvnz2YPsBq7MmXwYxZPU2ON4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:22:20.585059Z"},"content_sha256":"f6a90663608153cc02dfa8f665211ba9de199f60f57c27979c4254391d409186","schema_version":"1.0","event_id":"sha256:f6a90663608153cc02dfa8f665211ba9de199f60f57c27979c4254391d409186"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:CEKRN452CFAJ3AHKBQV24URFH6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lagrangian-based methods in convex optimization: prediction-correction frameworks with non-ergodic convergence rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Shiru Li, Tao Zhang, Yong Xia","submitted_at":"2023-04-05T14:37:21Z","abstract_excerpt":"Lagrangian-based methods are classical methods for solving convex optimization problems with equality constraints. We present novel prediction-correction frameworks for such methods and their variants, which can achieve $O(1/k)$ non-ergodic convergence rates for general convex optimization and $O(1/k^2)$ non-ergodic convergence rates under the assumption that the objective function is strongly convex or gradient Lipschitz continuous. We give two approaches ($updating~multiplier~once$ $or~twice$) to design algorithms satisfying the presented prediction-correction frameworks. As applications, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.02459","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/2304.02459/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-05T05:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ERdjJBqoqs5IDm7O3ad768hlpQR6sFaqBe6J+c8EeGp4l1QCvQPnpE9NiT3DU1l71TrP/1jNy6rW7dVdfDwSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:22:20.585557Z"},"content_sha256":"e3165f571ff960b02f9b2f7eeb5ae36ffdceb2f4bbd043e6f6d11f64273ea910","schema_version":"1.0","event_id":"sha256:e3165f571ff960b02f9b2f7eeb5ae36ffdceb2f4bbd043e6f6d11f64273ea910"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEKRN452CFAJ3AHKBQV24URFH6/bundle.json","state_url":"https://pith.science/pith/CEKRN452CFAJ3AHKBQV24URFH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEKRN452CFAJ3AHKBQV24URFH6/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-09T15:22:20Z","links":{"resolver":"https://pith.science/pith/CEKRN452CFAJ3AHKBQV24URFH6","bundle":"https://pith.science/pith/CEKRN452CFAJ3AHKBQV24URFH6/bundle.json","state":"https://pith.science/pith/CEKRN452CFAJ3AHKBQV24URFH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEKRN452CFAJ3AHKBQV24URFH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:CEKRN452CFAJ3AHKBQV24URFH6","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":"4fb6b290050a78dd433750fe9b43ed9f3283a5e934095e55bdd68d504479ea9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-04-05T14:37:21Z","title_canon_sha256":"5309f5dd80e4b5b8763b53e74b64e82f9b62f3c58ce39c0bbb2a26070ec5040b"},"schema_version":"1.0","source":{"id":"2304.02459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.02459","created_at":"2026-07-05T05:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"2304.02459v1","created_at":"2026-07-05T05:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.02459","created_at":"2026-07-05T05:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"CEKRN452CFAJ","created_at":"2026-07-05T05:58:25Z"},{"alias_kind":"pith_short_16","alias_value":"CEKRN452CFAJ3AHK","created_at":"2026-07-05T05:58:25Z"},{"alias_kind":"pith_short_8","alias_value":"CEKRN452","created_at":"2026-07-05T05:58:25Z"}],"graph_snapshots":[{"event_id":"sha256:e3165f571ff960b02f9b2f7eeb5ae36ffdceb2f4bbd043e6f6d11f64273ea910","target":"graph","created_at":"2026-07-05T05:58:25Z","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/2304.02459/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Lagrangian-based methods are classical methods for solving convex optimization problems with equality constraints. We present novel prediction-correction frameworks for such methods and their variants, which can achieve $O(1/k)$ non-ergodic convergence rates for general convex optimization and $O(1/k^2)$ non-ergodic convergence rates under the assumption that the objective function is strongly convex or gradient Lipschitz continuous. We give two approaches ($updating~multiplier~once$ $or~twice$) to design algorithms satisfying the presented prediction-correction frameworks. As applications, we","authors_text":"Shiru Li, Tao Zhang, Yong Xia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-04-05T14:37:21Z","title":"Lagrangian-based methods in convex optimization: prediction-correction frameworks with non-ergodic convergence rates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.02459","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:f6a90663608153cc02dfa8f665211ba9de199f60f57c27979c4254391d409186","target":"record","created_at":"2026-07-05T05:58:25Z","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":"4fb6b290050a78dd433750fe9b43ed9f3283a5e934095e55bdd68d504479ea9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-04-05T14:37:21Z","title_canon_sha256":"5309f5dd80e4b5b8763b53e74b64e82f9b62f3c58ce39c0bbb2a26070ec5040b"},"schema_version":"1.0","source":{"id":"2304.02459","kind":"arxiv","version":1}},"canonical_sha256":"111516f3ba11409d80ea0c2bae52253fbdcdf5112755c3c04b68bcb4cbbc9b0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"111516f3ba11409d80ea0c2bae52253fbdcdf5112755c3c04b68bcb4cbbc9b0c","first_computed_at":"2026-07-05T05:58:25.781282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:58:25.781282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"108jZty8kWX7J0+nx5BUtDPxKIaYADCOjwGkUM713+zpNF2XmVNrrqBbN+Su46SBWc9zl39CIk4HPXJSx1BYAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:58:25.781640Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.02459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6a90663608153cc02dfa8f665211ba9de199f60f57c27979c4254391d409186","sha256:e3165f571ff960b02f9b2f7eeb5ae36ffdceb2f4bbd043e6f6d11f64273ea910"],"state_sha256":"f4fdc9a5ff3cc96700ff9fba986c36583b68b8ba3fdd78ca20156bb1d2cc3b2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/jgF9e2WxQuDnKNj2LCNGgqznIMV4XBSJkO/Lkfwys/0tmSBCvyyBMYxY3oWbpCgGV1yQkLfHLSZkRZkW6TPDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T15:22:20.588768Z","bundle_sha256":"875b733a291d4a8f3d8a88d6ee9115fb6f45a7c18b0b2b61a8a32725ed6c3de3"}}