{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CTFGZ5ZLV2N2HLTYYC5PNMRSKF","short_pith_number":"pith:CTFGZ5ZL","schema_version":"1.0","canonical_sha256":"14ca6cf72bae9ba3ae78c0baf6b2325170f62c5f52bae78567bb038e61b854b2","source":{"kind":"arxiv","id":"2504.16876","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2504.16876","created_at":"2026-07-05T10:53:05.690925+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.16876v1","created_at":"2026-07-05T10:53:05.690925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.16876","created_at":"2026-07-05T10:53:05.690925+00:00"},{"alias_kind":"pith_short_12","alias_value":"CTFGZ5ZLV2N2","created_at":"2026-07-05T10:53:05.690925+00:00"},{"alias_kind":"pith_short_16","alias_value":"CTFGZ5ZLV2N2HLTY","created_at":"2026-07-05T10:53:05.690925+00:00"},{"alias_kind":"pith_short_8","alias_value":"CTFGZ5ZL","created_at":"2026-07-05T10:53:05.690925+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CTFGZ5ZLV2N2HLTYYC5PNMRSKF","json":"https://pith.science/pith/CTFGZ5ZLV2N2HLTYYC5PNMRSKF.json","graph_json":"https://pith.science/api/pith-number/CTFGZ5ZLV2N2HLTYYC5PNMRSKF/graph.json","events_json":"https://pith.science/api/pith-number/CTFGZ5ZLV2N2HLTYYC5PNMRSKF/events.json","paper":"https://pith.science/paper/CTFGZ5ZL"},"agent_actions":{"view_html":"https://pith.science/pith/CTFGZ5ZLV2N2HLTYYC5PNMRSKF","download_json":"https://pith.science/pith/CTFGZ5ZLV2N2HLTYYC5PNMRSKF.json","view_paper":"https://pith.science/paper/CTFGZ5ZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.16876&json=true","fetch_graph":"https://pith.science/api/pith-number/CTFGZ5ZLV2N2HLTYYC5PNMRSKF/graph.json","fetch_events":"https://pith.science/api/pith-number/CTFGZ5ZLV2N2HLTYYC5PNMRSKF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CTFGZ5ZLV2N2HLTYYC5PNMRSKF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CTFGZ5ZLV2N2HLTYYC5PNMRSKF/action/storage_attestation","attest_author":"https://pith.science/pith/CTFGZ5ZLV2N2HLTYYC5PNMRSKF/action/author_attestation","sign_citation":"https://pith.science/pith/CTFGZ5ZLV2N2HLTYYC5PNMRSKF/action/citation_signature","submit_replication":"https://pith.science/pith/CTFGZ5ZLV2N2HLTYYC5PNMRSKF/action/replication_record"}},"created_at":"2026-07-05T10:53:05.690925+00:00","updated_at":"2026-07-05T10:53:05.690925+00:00"}