{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7R4R56D3CXLXRDF5QH5JX55QLG","short_pith_number":"pith:7R4R56D3","schema_version":"1.0","canonical_sha256":"fc791ef87b15d7788cbd81fa9bf7b059bf45be34c7deae77192f9992b3fbec35","source":{"kind":"arxiv","id":"2406.11749","version":2},"attestation_state":"computed","paper":{"title":"On the Differentiability of the Primal-Dual Interior-Point Method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kevin Tracy, Zachary Manchester","submitted_at":"2024-06-17T17:04:49Z","abstract_excerpt":"Primal-Dual Interior-Point methods are capable of solving constrained convex optimization problems to tight tolerances in a fast and robust manner. The derivatives of the primal-dual solution with respect to the problem matrices can be computed using the implicit function theorem, enabling efficient differentiation of these optimizers for a fraction of the cost of the total solution time. In the presence of active inequality constraints, this technique is only capable of providing discontinuous subgradients that present a challenge to algorithms that rely on the smoothness of these derivatives"},"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":"2406.11749","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-17T17:04:49Z","cross_cats_sorted":[],"title_canon_sha256":"e3f05c7051d6d97ba8986c8a81976b770f4ab02f457ca081f5d801be1c08549b","abstract_canon_sha256":"57b0107aba26540dedd6be87347089399e0c60cadd7375792c619e3d648bdf5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:34:21.844468Z","signature_b64":"f33eSEHQFsChj0mZmXkw7jsOUsQbzT09U1KFqpUtTwExZD1xnRqP5X2cuTf8SwclWkTINKevFV1DyL0bcLb9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc791ef87b15d7788cbd81fa9bf7b059bf45be34c7deae77192f9992b3fbec35","last_reissued_at":"2026-07-05T08:34:21.844004Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:34:21.844004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Differentiability of the Primal-Dual Interior-Point Method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kevin Tracy, Zachary Manchester","submitted_at":"2024-06-17T17:04:49Z","abstract_excerpt":"Primal-Dual Interior-Point methods are capable of solving constrained convex optimization problems to tight tolerances in a fast and robust manner. The derivatives of the primal-dual solution with respect to the problem matrices can be computed using the implicit function theorem, enabling efficient differentiation of these optimizers for a fraction of the cost of the total solution time. In the presence of active inequality constraints, this technique is only capable of providing discontinuous subgradients that present a challenge to algorithms that rely on the smoothness of these derivatives"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.11749","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/2406.11749/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":"2406.11749","created_at":"2026-07-05T08:34:21.844060+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.11749v2","created_at":"2026-07-05T08:34:21.844060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.11749","created_at":"2026-07-05T08:34:21.844060+00:00"},{"alias_kind":"pith_short_12","alias_value":"7R4R56D3CXLX","created_at":"2026-07-05T08:34:21.844060+00:00"},{"alias_kind":"pith_short_16","alias_value":"7R4R56D3CXLXRDF5","created_at":"2026-07-05T08:34:21.844060+00:00"},{"alias_kind":"pith_short_8","alias_value":"7R4R56D3","created_at":"2026-07-05T08:34:21.844060+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00374","citing_title":"Constrained Whole-Body Tracking for Humanoid Robots","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17913","citing_title":"A Differentiable Interior-Point Method in Single Precision","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2510.07625","citing_title":"GATO: GPU-Accelerated and Batched Trajectory Optimization for Scalable Edge Model Predictive Control","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7R4R56D3CXLXRDF5QH5JX55QLG","json":"https://pith.science/pith/7R4R56D3CXLXRDF5QH5JX55QLG.json","graph_json":"https://pith.science/api/pith-number/7R4R56D3CXLXRDF5QH5JX55QLG/graph.json","events_json":"https://pith.science/api/pith-number/7R4R56D3CXLXRDF5QH5JX55QLG/events.json","paper":"https://pith.science/paper/7R4R56D3"},"agent_actions":{"view_html":"https://pith.science/pith/7R4R56D3CXLXRDF5QH5JX55QLG","download_json":"https://pith.science/pith/7R4R56D3CXLXRDF5QH5JX55QLG.json","view_paper":"https://pith.science/paper/7R4R56D3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.11749&json=true","fetch_graph":"https://pith.science/api/pith-number/7R4R56D3CXLXRDF5QH5JX55QLG/graph.json","fetch_events":"https://pith.science/api/pith-number/7R4R56D3CXLXRDF5QH5JX55QLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7R4R56D3CXLXRDF5QH5JX55QLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7R4R56D3CXLXRDF5QH5JX55QLG/action/storage_attestation","attest_author":"https://pith.science/pith/7R4R56D3CXLXRDF5QH5JX55QLG/action/author_attestation","sign_citation":"https://pith.science/pith/7R4R56D3CXLXRDF5QH5JX55QLG/action/citation_signature","submit_replication":"https://pith.science/pith/7R4R56D3CXLXRDF5QH5JX55QLG/action/replication_record"}},"created_at":"2026-07-05T08:34:21.844060+00:00","updated_at":"2026-07-05T08:34:21.844060+00:00"}