{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VWKCBNOBDWOV6JITZRV5WGHTXY","short_pith_number":"pith:VWKCBNOB","schema_version":"1.0","canonical_sha256":"ad9420b5c11d9d5f2513cc6bdb18f3be2119924561666fe19af3013dc0314813","source":{"kind":"arxiv","id":"2304.00290","version":2},"attestation_state":"computed","paper":{"title":"PIQP: A Proximal Interior-Point Quadratic Programming Solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Colin N. Jones, Daniel Kuhn, Roland Schwan, Yuning Jiang","submitted_at":"2023-04-01T10:55:28Z","abstract_excerpt":"This paper presents PIQP, a high-performance toolkit for solving generic sparse quadratic programs (QP). Combining an infeasible Interior Point Method (IPM) with the Proximal Method of Multipliers (PMM), the algorithm can handle ill-conditioned convex QP problems without the need for linear independence of the constraints. The open-source implementation is written in C++ with interfaces to C, Python, Matlab, and R leveraging the Eigen3 library. The method uses a pivoting-free factorization routine and allocation-free updates of the problem data, making the solver suitable for embedded applicat"},"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":"2304.00290","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-04-01T10:55:28Z","cross_cats_sorted":[],"title_canon_sha256":"4f2126a5f01833cd5cffc3170a06a5c844618b5a4722bdefd520965580a1df91","abstract_canon_sha256":"0d3df1a25cce32787762378b58e71c12089b2e79a12491bef5bfed9ebb941ee4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:50:54.376821Z","signature_b64":"pWgF58J9NojdiA+fETx5Lm4eWHgjQNYpI9w/lqUOPIOIqnORaj742o/xko3/fzSOt7BOSoVAggCjgKN5snikCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad9420b5c11d9d5f2513cc6bdb18f3be2119924561666fe19af3013dc0314813","last_reissued_at":"2026-07-05T06:50:54.376311Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:50:54.376311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PIQP: A Proximal Interior-Point Quadratic Programming Solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Colin N. Jones, Daniel Kuhn, Roland Schwan, Yuning Jiang","submitted_at":"2023-04-01T10:55:28Z","abstract_excerpt":"This paper presents PIQP, a high-performance toolkit for solving generic sparse quadratic programs (QP). Combining an infeasible Interior Point Method (IPM) with the Proximal Method of Multipliers (PMM), the algorithm can handle ill-conditioned convex QP problems without the need for linear independence of the constraints. The open-source implementation is written in C++ with interfaces to C, Python, Matlab, and R leveraging the Eigen3 library. The method uses a pivoting-free factorization routine and allocation-free updates of the problem data, making the solver suitable for embedded applicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.00290","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/2304.00290/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":"2304.00290","created_at":"2026-07-05T06:50:54.376381+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.00290v2","created_at":"2026-07-05T06:50:54.376381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.00290","created_at":"2026-07-05T06:50:54.376381+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWKCBNOBDWOV","created_at":"2026-07-05T06:50:54.376381+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWKCBNOBDWOV6JIT","created_at":"2026-07-05T06:50:54.376381+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWKCBNOB","created_at":"2026-07-05T06:50:54.376381+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/VWKCBNOBDWOV6JITZRV5WGHTXY","json":"https://pith.science/pith/VWKCBNOBDWOV6JITZRV5WGHTXY.json","graph_json":"https://pith.science/api/pith-number/VWKCBNOBDWOV6JITZRV5WGHTXY/graph.json","events_json":"https://pith.science/api/pith-number/VWKCBNOBDWOV6JITZRV5WGHTXY/events.json","paper":"https://pith.science/paper/VWKCBNOB"},"agent_actions":{"view_html":"https://pith.science/pith/VWKCBNOBDWOV6JITZRV5WGHTXY","download_json":"https://pith.science/pith/VWKCBNOBDWOV6JITZRV5WGHTXY.json","view_paper":"https://pith.science/paper/VWKCBNOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.00290&json=true","fetch_graph":"https://pith.science/api/pith-number/VWKCBNOBDWOV6JITZRV5WGHTXY/graph.json","fetch_events":"https://pith.science/api/pith-number/VWKCBNOBDWOV6JITZRV5WGHTXY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWKCBNOBDWOV6JITZRV5WGHTXY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWKCBNOBDWOV6JITZRV5WGHTXY/action/storage_attestation","attest_author":"https://pith.science/pith/VWKCBNOBDWOV6JITZRV5WGHTXY/action/author_attestation","sign_citation":"https://pith.science/pith/VWKCBNOBDWOV6JITZRV5WGHTXY/action/citation_signature","submit_replication":"https://pith.science/pith/VWKCBNOBDWOV6JITZRV5WGHTXY/action/replication_record"}},"created_at":"2026-07-05T06:50:54.376381+00:00","updated_at":"2026-07-05T06:50:54.376381+00:00"}