{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PRZO5MVFMVDKWQPXU5Z76ZRIYV","short_pith_number":"pith:PRZO5MVF","schema_version":"1.0","canonical_sha256":"7c72eeb2a56546ab41f7a773ff6628c5524b9f80ff9c9e0731be97a6ac4ea0dc","source":{"kind":"arxiv","id":"1711.08013","version":4},"attestation_state":"computed","paper":{"title":"OSQP: An Operator Splitting Solver for Quadratic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alberto Bemporad, Bartolomeo Stellato, Goran Banjac, Paul Goulart, Stephen Boyd","submitted_at":"2017-11-21T19:58:57Z","abstract_excerpt":"We present a general-purpose solver for convex quadratic programs based on the alternating direction method of multipliers, employing a novel operator splitting technique that requires the solution of a quasi-definite linear system with the same coefficient matrix at almost every iteration. Our algorithm is very robust, placing no requirements on the problem data such as positive definiteness of the objective function or linear independence of the constraint functions. It can be configured to be division-free once an initial matrix factorization is carried out, making it suitable for real-time"},"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":"1711.08013","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-21T19:58:57Z","cross_cats_sorted":[],"title_canon_sha256":"7a2ed852874a9482ee5092b6ead9c83ed8fc971f0868d44ea0349897749c741d","abstract_canon_sha256":"a82d5ea271f655a93c0979dbd49b904fde910927997347edd590429b157b4d0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:11.386644Z","signature_b64":"gaAa5w74S7K96pKzGcTnh8XOyy+xgm5wd/XOLH8AUWbGYfM3/sj1oyMHotPL3mVVs010GhM4z1lrUNrAGMmFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c72eeb2a56546ab41f7a773ff6628c5524b9f80ff9c9e0731be97a6ac4ea0dc","last_reissued_at":"2026-07-05T00:40:11.386217Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:11.386217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"OSQP: An Operator Splitting Solver for Quadratic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alberto Bemporad, Bartolomeo Stellato, Goran Banjac, Paul Goulart, Stephen Boyd","submitted_at":"2017-11-21T19:58:57Z","abstract_excerpt":"We present a general-purpose solver for convex quadratic programs based on the alternating direction method of multipliers, employing a novel operator splitting technique that requires the solution of a quasi-definite linear system with the same coefficient matrix at almost every iteration. Our algorithm is very robust, placing no requirements on the problem data such as positive definiteness of the objective function or linear independence of the constraint functions. It can be configured to be division-free once an initial matrix factorization is carried out, making it suitable for real-time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08013","kind":"arxiv","version":4},"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/1711.08013/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":"1711.08013","created_at":"2026-07-05T00:40:11.386274+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08013v4","created_at":"2026-07-05T00:40:11.386274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08013","created_at":"2026-07-05T00:40:11.386274+00:00"},{"alias_kind":"pith_short_12","alias_value":"PRZO5MVFMVDK","created_at":"2026-07-05T00:40:11.386274+00:00"},{"alias_kind":"pith_short_16","alias_value":"PRZO5MVFMVDKWQPX","created_at":"2026-07-05T00:40:11.386274+00:00"},{"alias_kind":"pith_short_8","alias_value":"PRZO5MVF","created_at":"2026-07-05T00:40:11.386274+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.11991","citing_title":"Complementarity by Construction: A Lie-Group Approach to Solving Quadratic Programs with Linear Complementarity Constraints","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PRZO5MVFMVDKWQPXU5Z76ZRIYV","json":"https://pith.science/pith/PRZO5MVFMVDKWQPXU5Z76ZRIYV.json","graph_json":"https://pith.science/api/pith-number/PRZO5MVFMVDKWQPXU5Z76ZRIYV/graph.json","events_json":"https://pith.science/api/pith-number/PRZO5MVFMVDKWQPXU5Z76ZRIYV/events.json","paper":"https://pith.science/paper/PRZO5MVF"},"agent_actions":{"view_html":"https://pith.science/pith/PRZO5MVFMVDKWQPXU5Z76ZRIYV","download_json":"https://pith.science/pith/PRZO5MVFMVDKWQPXU5Z76ZRIYV.json","view_paper":"https://pith.science/paper/PRZO5MVF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08013&json=true","fetch_graph":"https://pith.science/api/pith-number/PRZO5MVFMVDKWQPXU5Z76ZRIYV/graph.json","fetch_events":"https://pith.science/api/pith-number/PRZO5MVFMVDKWQPXU5Z76ZRIYV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PRZO5MVFMVDKWQPXU5Z76ZRIYV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PRZO5MVFMVDKWQPXU5Z76ZRIYV/action/storage_attestation","attest_author":"https://pith.science/pith/PRZO5MVFMVDKWQPXU5Z76ZRIYV/action/author_attestation","sign_citation":"https://pith.science/pith/PRZO5MVFMVDKWQPXU5Z76ZRIYV/action/citation_signature","submit_replication":"https://pith.science/pith/PRZO5MVFMVDKWQPXU5Z76ZRIYV/action/replication_record"}},"created_at":"2026-07-05T00:40:11.386274+00:00","updated_at":"2026-07-05T00:40:11.386274+00:00"}