{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LUDAYEVY3FDPKYJY7BP3QGEQEB","short_pith_number":"pith:LUDAYEVY","schema_version":"1.0","canonical_sha256":"5d060c12b8d946f56138f85fb8189020477ec6c35a422f3c9d6850a25383c09e","source":{"kind":"arxiv","id":"2312.14832","version":2},"attestation_state":"computed","paper":{"title":"cuPDLP-C: A Strengthened Implementation of cuPDLP for Linear Programming by C language","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chuwen Zhang, Dongdong Ge, Haihao Lu, Haodong Hu, Jinsong Liu, Jinwen Yang, Qi Huangfu, Tianhao Liu, Yinyu Ye","submitted_at":"2023-12-22T17:07:50Z","abstract_excerpt":"A recent GPU implementation of the Restarted Primal-Dual Hybrid Gradient Method for Linear Programming was proposed in Lu and Yang (2023). Its computational results demonstrate the significant computational advantages of the GPU-based first-order algorithm on certain large-scale problems. The average performance also achieves a level close to commercial solvers for the first time in history. However, due to limitations in experimental hardware and the disadvantage of implementing the algorithm in Julia compared to C language, neither the commercial solver nor cuPDLP reached their maximum effic"},"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":"2312.14832","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-22T17:07:50Z","cross_cats_sorted":[],"title_canon_sha256":"3f8bdbd1e81603c5ca948ab460cd08e4c714daed60458616c2802ac5990f15f7","abstract_canon_sha256":"577085492e21889ee85751ca3f98fb2eaca3efc1c3a6c3216d5c6335c77f8cf8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:30:58.603089Z","signature_b64":"e6kpxm7sOIVN+8tu4yTc8HZ66FNXY7KKwsRS8zAW1Rq4yIk1zP7caheKh8+ZdM3hsaKk2aFvof9lAaCOlGKTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d060c12b8d946f56138f85fb8189020477ec6c35a422f3c9d6850a25383c09e","last_reissued_at":"2026-07-05T07:30:58.602657Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:30:58.602657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"cuPDLP-C: A Strengthened Implementation of cuPDLP for Linear Programming by C language","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chuwen Zhang, Dongdong Ge, Haihao Lu, Haodong Hu, Jinsong Liu, Jinwen Yang, Qi Huangfu, Tianhao Liu, Yinyu Ye","submitted_at":"2023-12-22T17:07:50Z","abstract_excerpt":"A recent GPU implementation of the Restarted Primal-Dual Hybrid Gradient Method for Linear Programming was proposed in Lu and Yang (2023). Its computational results demonstrate the significant computational advantages of the GPU-based first-order algorithm on certain large-scale problems. The average performance also achieves a level close to commercial solvers for the first time in history. However, due to limitations in experimental hardware and the disadvantage of implementing the algorithm in Julia compared to C language, neither the commercial solver nor cuPDLP reached their maximum effic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.14832","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/2312.14832/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":"2312.14832","created_at":"2026-07-05T07:30:58.602720+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.14832v2","created_at":"2026-07-05T07:30:58.602720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14832","created_at":"2026-07-05T07:30:58.602720+00:00"},{"alias_kind":"pith_short_12","alias_value":"LUDAYEVY3FDP","created_at":"2026-07-05T07:30:58.602720+00:00"},{"alias_kind":"pith_short_16","alias_value":"LUDAYEVY3FDPKYJY","created_at":"2026-07-05T07:30:58.602720+00:00"},{"alias_kind":"pith_short_8","alias_value":"LUDAYEVY","created_at":"2026-07-05T07:30:58.602720+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2402.01061","citing_title":"On the power of linear programming for K-means clustering","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2409.14715","citing_title":"A New Crossover Algorithm for LP Inspired by the Spiral Dynamic of PDHG","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2410.04043","citing_title":"Accessible Complexity Bounds for Restarted PDHG on Linear Programs with a Unique Optimizer","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22188","citing_title":"From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23979","citing_title":"SDSL-Solver: Scalable Distributed Sparse Linear Solvers for Large-Scale Interior Point Methods","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23951","citing_title":"Presolving for GPU-Accelerated First-Order LP Solvers","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LUDAYEVY3FDPKYJY7BP3QGEQEB","json":"https://pith.science/pith/LUDAYEVY3FDPKYJY7BP3QGEQEB.json","graph_json":"https://pith.science/api/pith-number/LUDAYEVY3FDPKYJY7BP3QGEQEB/graph.json","events_json":"https://pith.science/api/pith-number/LUDAYEVY3FDPKYJY7BP3QGEQEB/events.json","paper":"https://pith.science/paper/LUDAYEVY"},"agent_actions":{"view_html":"https://pith.science/pith/LUDAYEVY3FDPKYJY7BP3QGEQEB","download_json":"https://pith.science/pith/LUDAYEVY3FDPKYJY7BP3QGEQEB.json","view_paper":"https://pith.science/paper/LUDAYEVY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.14832&json=true","fetch_graph":"https://pith.science/api/pith-number/LUDAYEVY3FDPKYJY7BP3QGEQEB/graph.json","fetch_events":"https://pith.science/api/pith-number/LUDAYEVY3FDPKYJY7BP3QGEQEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LUDAYEVY3FDPKYJY7BP3QGEQEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LUDAYEVY3FDPKYJY7BP3QGEQEB/action/storage_attestation","attest_author":"https://pith.science/pith/LUDAYEVY3FDPKYJY7BP3QGEQEB/action/author_attestation","sign_citation":"https://pith.science/pith/LUDAYEVY3FDPKYJY7BP3QGEQEB/action/citation_signature","submit_replication":"https://pith.science/pith/LUDAYEVY3FDPKYJY7BP3QGEQEB/action/replication_record"}},"created_at":"2026-07-05T07:30:58.602720+00:00","updated_at":"2026-07-05T07:30:58.602720+00:00"}