{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CTFGZ5ZLV2N2HLTYYC5PNMRSKF","short_pith_number":"pith:CTFGZ5ZL","canonical_record":{"source":{"id":"2504.16876","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-23T16:53:14Z","cross_cats_sorted":[],"title_canon_sha256":"7c3c27a4482fca03b108dbbbdbb0e2b9c3eb71cb1db940146a9c79dc30c4b6a7","abstract_canon_sha256":"6345656c4d5f6a0881be7df00af13da71390e2d42eec9c026145eba31599c35a"},"schema_version":"1.0"},"canonical_sha256":"14ca6cf72bae9ba3ae78c0baf6b2325170f62c5f52bae78567bb038e61b854b2","source":{"kind":"arxiv","id":"2504.16876","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.16876","created_at":"2026-07-05T10:53:05Z"},{"alias_kind":"arxiv_version","alias_value":"2504.16876v1","created_at":"2026-07-05T10:53:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.16876","created_at":"2026-07-05T10:53:05Z"},{"alias_kind":"pith_short_12","alias_value":"CTFGZ5ZLV2N2","created_at":"2026-07-05T10:53:05Z"},{"alias_kind":"pith_short_16","alias_value":"CTFGZ5ZLV2N2HLTY","created_at":"2026-07-05T10:53:05Z"},{"alias_kind":"pith_short_8","alias_value":"CTFGZ5ZL","created_at":"2026-07-05T10:53:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CTFGZ5ZLV2N2HLTYYC5PNMRSKF","target":"record","payload":{"canonical_record":{"source":{"id":"2504.16876","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-23T16:53:14Z","cross_cats_sorted":[],"title_canon_sha256":"7c3c27a4482fca03b108dbbbdbb0e2b9c3eb71cb1db940146a9c79dc30c4b6a7","abstract_canon_sha256":"6345656c4d5f6a0881be7df00af13da71390e2d42eec9c026145eba31599c35a"},"schema_version":"1.0"},"canonical_sha256":"14ca6cf72bae9ba3ae78c0baf6b2325170f62c5f52bae78567bb038e61b854b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:05.691354Z","signature_b64":"HGKZaHBmQhlB7PudM+U+m0NslHPIHj1SaexoU9+ORnnhEt0B0vdlIhUG8Z75aNTZTt1XgdHyACTbUEs37ov+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14ca6cf72bae9ba3ae78c0baf6b2325170f62c5f52bae78567bb038e61b854b2","last_reissued_at":"2026-07-05T10:53:05.690865Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:05.690865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.16876","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-05T10:53:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+QNBnlq5Ldm5lD5iOEw3HytVA/3blYemCXjirC/5Upy3TfERIeEv1ouIsq/9V6zTpTyKtC7hPipFxJGb9mIrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T10:47:17.067261Z"},"content_sha256":"4ed89c711d9abcaacbe65af24c9c307d789b3c4043c44e2dad03dcb34367a580","schema_version":"1.0","event_id":"sha256:4ed89c711d9abcaacbe65af24c9c307d789b3c4043c44e2dad03dcb34367a580"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CTFGZ5ZLV2N2HLTYYC5PNMRSKF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Primal-Dual Algorithm for Convex Problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Shuning Liu, Zexian Liu","submitted_at":"2025-04-23T16:53:14Z","abstract_excerpt":"Primal-dual algorithm (PDA) is a classic and popular scheme for convex-concave saddle point problems. It is universally acknowledged that the proximal terms in the subproblems about the primal and dual variables are crucial to the convergence theory and numerical performance of primal-dual algorithms. By taking advantage of the information from the current and previous iterative points, we exploit two new proximal terms for the subproblems about the primal and dual variables. Based on two new proximal terms, we present a new primal-dual algorithm for convex-concave saddle point problems with b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.16876","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/2504.16876/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-05T10:53:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bHPkkri+rjBcomJDndmCk9eFGSzPIjkLx3B+qRFDFcqWsAjQpmm0sb6b4/iZ37LnRrUDEzbmI2IixvSDQgjWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T10:47:17.067764Z"},"content_sha256":"f588fc3fcb771feba0d351b37fb75eabe66ab627391779243a2329443ef8fddd","schema_version":"1.0","event_id":"sha256:f588fc3fcb771feba0d351b37fb75eabe66ab627391779243a2329443ef8fddd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CTFGZ5ZLV2N2HLTYYC5PNMRSKF/bundle.json","state_url":"https://pith.science/pith/CTFGZ5ZLV2N2HLTYYC5PNMRSKF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CTFGZ5ZLV2N2HLTYYC5PNMRSKF/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-22T10:47:17Z","links":{"resolver":"https://pith.science/pith/CTFGZ5ZLV2N2HLTYYC5PNMRSKF","bundle":"https://pith.science/pith/CTFGZ5ZLV2N2HLTYYC5PNMRSKF/bundle.json","state":"https://pith.science/pith/CTFGZ5ZLV2N2HLTYYC5PNMRSKF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CTFGZ5ZLV2N2HLTYYC5PNMRSKF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CTFGZ5ZLV2N2HLTYYC5PNMRSKF","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":"6345656c4d5f6a0881be7df00af13da71390e2d42eec9c026145eba31599c35a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-23T16:53:14Z","title_canon_sha256":"7c3c27a4482fca03b108dbbbdbb0e2b9c3eb71cb1db940146a9c79dc30c4b6a7"},"schema_version":"1.0","source":{"id":"2504.16876","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.16876","created_at":"2026-07-05T10:53:05Z"},{"alias_kind":"arxiv_version","alias_value":"2504.16876v1","created_at":"2026-07-05T10:53:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.16876","created_at":"2026-07-05T10:53:05Z"},{"alias_kind":"pith_short_12","alias_value":"CTFGZ5ZLV2N2","created_at":"2026-07-05T10:53:05Z"},{"alias_kind":"pith_short_16","alias_value":"CTFGZ5ZLV2N2HLTY","created_at":"2026-07-05T10:53:05Z"},{"alias_kind":"pith_short_8","alias_value":"CTFGZ5ZL","created_at":"2026-07-05T10:53:05Z"}],"graph_snapshots":[{"event_id":"sha256:f588fc3fcb771feba0d351b37fb75eabe66ab627391779243a2329443ef8fddd","target":"graph","created_at":"2026-07-05T10:53:05Z","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/2504.16876/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Primal-dual algorithm (PDA) is a classic and popular scheme for convex-concave saddle point problems. It is universally acknowledged that the proximal terms in the subproblems about the primal and dual variables are crucial to the convergence theory and numerical performance of primal-dual algorithms. By taking advantage of the information from the current and previous iterative points, we exploit two new proximal terms for the subproblems about the primal and dual variables. Based on two new proximal terms, we present a new primal-dual algorithm for convex-concave saddle point problems with b","authors_text":"Shuning Liu, Zexian Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.16876","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:4ed89c711d9abcaacbe65af24c9c307d789b3c4043c44e2dad03dcb34367a580","target":"record","created_at":"2026-07-05T10:53:05Z","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":"6345656c4d5f6a0881be7df00af13da71390e2d42eec9c026145eba31599c35a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-23T16:53:14Z","title_canon_sha256":"7c3c27a4482fca03b108dbbbdbb0e2b9c3eb71cb1db940146a9c79dc30c4b6a7"},"schema_version":"1.0","source":{"id":"2504.16876","kind":"arxiv","version":1}},"canonical_sha256":"14ca6cf72bae9ba3ae78c0baf6b2325170f62c5f52bae78567bb038e61b854b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14ca6cf72bae9ba3ae78c0baf6b2325170f62c5f52bae78567bb038e61b854b2","first_computed_at":"2026-07-05T10:53:05.690865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:53:05.690865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HGKZaHBmQhlB7PudM+U+m0NslHPIHj1SaexoU9+ORnnhEt0B0vdlIhUG8Z75aNTZTt1XgdHyACTbUEs37ov+CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:53:05.691354Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.16876","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ed89c711d9abcaacbe65af24c9c307d789b3c4043c44e2dad03dcb34367a580","sha256:f588fc3fcb771feba0d351b37fb75eabe66ab627391779243a2329443ef8fddd"],"state_sha256":"af9a5fb23484835f98ff4971a05d013d23c2a65a4beb0dac5dd48914f5fdb73b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K7KUO9h8OcJ1GQ9Ch5lT6h7tCcUwWGt0+B1/QI6BMheKs6ZUGNFTYhMiOQzi114be/LDhpId6HetlR5LQuWjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T10:47:17.071466Z","bundle_sha256":"c28de03348998f5d7f3a062eb0de930efe8ed2181072645665a0f791d116d357"}}