{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Q7F2MW6MGTVQIITAWUAJTBIYCD","short_pith_number":"pith:Q7F2MW6M","schema_version":"1.0","canonical_sha256":"87cba65bcc34eb042260b50099851810cfc0484fac822e77cd7c6db9f8098284","source":{"kind":"arxiv","id":"2405.12762","version":1},"attestation_state":"computed","paper":{"title":"Clarabel: An interior-point solver for conic programs with quadratic objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Paul J. Goulart, Yuwen Chen","submitted_at":"2024-05-21T13:15:19Z","abstract_excerpt":"We present a general-purpose interior-point solver for convex optimization problems with conic constraints. Our method is based on a homogeneous embedding method originally developed for general monotone complementarity problems and more recently applied to operator splitting methods, and here specialized to an interior-point method for problems with quadratic objectives. We allow for a variety of standard symmetric and non-symmetric cones, and provide support for chordal decomposition methods in the case of semidefinite cones. We describe the implementation of this method in the open-source s"},"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":"2405.12762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-21T13:15:19Z","cross_cats_sorted":[],"title_canon_sha256":"9614f902e4ea98a04c617481d7ee343b66ac3432f82855323c62f76a5ebf797b","abstract_canon_sha256":"062056263dcb18497dd14bb4e3c202c96943a1b92c5a9c681b7a812f3c5f7345"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:21:25.571164Z","signature_b64":"nCIrnbCOaAP1ZFyfZPWfuSIZsTIsRZXUT34UtIswjCoB3/ub3nQ2aAiCaLvs1b4iAyqNjl//w/CmIRNqv1GaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87cba65bcc34eb042260b50099851810cfc0484fac822e77cd7c6db9f8098284","last_reissued_at":"2026-07-05T08:21:25.570664Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:21:25.570664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clarabel: An interior-point solver for conic programs with quadratic objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Paul J. Goulart, Yuwen Chen","submitted_at":"2024-05-21T13:15:19Z","abstract_excerpt":"We present a general-purpose interior-point solver for convex optimization problems with conic constraints. Our method is based on a homogeneous embedding method originally developed for general monotone complementarity problems and more recently applied to operator splitting methods, and here specialized to an interior-point method for problems with quadratic objectives. We allow for a variety of standard symmetric and non-symmetric cones, and provide support for chordal decomposition methods in the case of semidefinite cones. We describe the implementation of this method in the open-source s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.12762","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/2405.12762/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":"2405.12762","created_at":"2026-07-05T08:21:25.570727+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.12762v1","created_at":"2026-07-05T08:21:25.570727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.12762","created_at":"2026-07-05T08:21:25.570727+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7F2MW6MGTVQ","created_at":"2026-07-05T08:21:25.570727+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7F2MW6MGTVQIITA","created_at":"2026-07-05T08:21:25.570727+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7F2MW6M","created_at":"2026-07-05T08:21:25.570727+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":24,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23367","citing_title":"Asymmetry PRISM: A CPU/GPU Portfolio Optimization Engine for Deadline-Bounded Institutional Rebalancing","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08993","citing_title":"LEAF: A Learning-Enabled ADMM Framework for Accelerated Convex Optimization","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2605.31425","citing_title":"Mixed-Precision GPU Acceleration for Large-Scale Minimum Enclosing Ball Problems","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07529","citing_title":"Stochastic Differential Dynamic Programming for Trajectory Optimization under Partial Observability","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2605.24803","citing_title":"Active Learning for Stochastic Contextual Linear Bandits","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28617","citing_title":"A Fast Convergent Algorithm for Solving Non-convex Partially-Decoupled Generalized Nash Equilibrium Problems","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28757","citing_title":"Learning Approximate Solutions to Multiparametric Generalized Nash Equilibrium Problems","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2412.09757","citing_title":"Revisiting Gaussian genuine entanglement witnesses with modern software","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04376","citing_title":"Polynomial iteration complexity of a path-following smoothing Newton method for symmetric cone programming","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19089","citing_title":"Reachability-Augmented Dual Dynamic Programming for Optimal Path Parameterization","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2511.06156","citing_title":"A Note on Optimal Product Pricing","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2602.02394","citing_title":"On the Practical Implementation of a Sequential Quadratic Programming Algorithm for Nonconvex Sum-of-squares Problems","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2602.09368","citing_title":"Certified Gradient-Based Contact-Rich Manipulation via Smoothing-Error Reachable Tubes","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2602.21302","citing_title":"Learning Dynamic Rope Manipulation Using Task-Level Iterative Learning Control","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02531","citing_title":"\\texttt{DR-DAQP}: An Hybrid Operator Splitting and Active-Set Solver for Affine Variational Inequalities","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03791","citing_title":"Acceleration of Moment Bound Optimization for Stochastic Chemical Reactions Using Reaction-wise Sparsity of Moment Equations","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23951","citing_title":"Presolving for GPU-Accelerated First-Order LP Solvers","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23833","citing_title":"Beyond De Prado and Cotton: Hierarchical and Iterative Methods for General Mean-Variance Portfolios","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23013","citing_title":"Integrated Lander-Propulsion-GNC Framework for Autonomous Lunar Powered Descent","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09074","citing_title":"A Bayesian Perspective on the Data-Driven LQR","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07529","citing_title":"Stochastic Differential Dynamic Programming for Trajectory Optimization under Partial Observability","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05640","citing_title":"Parametric Nonconvex Optimization via Convex Surrogates","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04376","citing_title":"Polynomial iteration complexity of a path-following smoothing Newton method for symmetric cone programming","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13179","citing_title":"HUANet: Hard-Constrained Unrolled ADMM for Constrained Convex Optimization","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q7F2MW6MGTVQIITAWUAJTBIYCD","json":"https://pith.science/pith/Q7F2MW6MGTVQIITAWUAJTBIYCD.json","graph_json":"https://pith.science/api/pith-number/Q7F2MW6MGTVQIITAWUAJTBIYCD/graph.json","events_json":"https://pith.science/api/pith-number/Q7F2MW6MGTVQIITAWUAJTBIYCD/events.json","paper":"https://pith.science/paper/Q7F2MW6M"},"agent_actions":{"view_html":"https://pith.science/pith/Q7F2MW6MGTVQIITAWUAJTBIYCD","download_json":"https://pith.science/pith/Q7F2MW6MGTVQIITAWUAJTBIYCD.json","view_paper":"https://pith.science/paper/Q7F2MW6M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.12762&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7F2MW6MGTVQIITAWUAJTBIYCD/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7F2MW6MGTVQIITAWUAJTBIYCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7F2MW6MGTVQIITAWUAJTBIYCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7F2MW6MGTVQIITAWUAJTBIYCD/action/storage_attestation","attest_author":"https://pith.science/pith/Q7F2MW6MGTVQIITAWUAJTBIYCD/action/author_attestation","sign_citation":"https://pith.science/pith/Q7F2MW6MGTVQIITAWUAJTBIYCD/action/citation_signature","submit_replication":"https://pith.science/pith/Q7F2MW6MGTVQIITAWUAJTBIYCD/action/replication_record"}},"created_at":"2026-07-05T08:21:25.570727+00:00","updated_at":"2026-07-05T08:21:25.570727+00:00"}