{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:TT3ACVNI6QENUIRR4AMYK7DAR3","short_pith_number":"pith:TT3ACVNI","schema_version":"1.0","canonical_sha256":"9cf60155a8f408da2231e019857c608ed302693985d82400fb2bfb378ff0d6b2","source":{"kind":"arxiv","id":"2212.02294","version":1},"attestation_state":"computed","paper":{"title":"Log-domain interior-point methods for convex quadratic programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Frank Permenter","submitted_at":"2022-12-05T14:18:42Z","abstract_excerpt":"Applying an interior-point method to the central-path conditions is a widely used approach for solving quadratic programs. Reformulating these conditions in the log-domain is a natural variation on this approach that to our knowledge is previously unstudied. In this paper, we analyze log-domain interior-point methods and prove their polynomial-time convergence. We also prove that they are approximated by classical barrier methods in a precise sense and provide simple computational experiments illustrating their superior performance."},"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":"2212.02294","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-12-05T14:18:42Z","cross_cats_sorted":[],"title_canon_sha256":"6475705a1da34bc0a80f333a0b557117407f9ef5a54d8270ae859da21bee26e6","abstract_canon_sha256":"975743d3077ad5c96168bb1301b023ba6ed45154e285a87449e53ac63dbce8ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:22:22.805722Z","signature_b64":"BjB+q0ZN8Yjy4OlSLaoTrjlRpkp7ZS9d3Wd2VSrm5cVTqMWmI5yHwg5E+5ULNqrVZm83FZ6rAKGhZvn8aEPJBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cf60155a8f408da2231e019857c608ed302693985d82400fb2bfb378ff0d6b2","last_reissued_at":"2026-07-05T05:22:22.805254Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:22:22.805254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Log-domain interior-point methods for convex quadratic programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Frank Permenter","submitted_at":"2022-12-05T14:18:42Z","abstract_excerpt":"Applying an interior-point method to the central-path conditions is a widely used approach for solving quadratic programs. Reformulating these conditions in the log-domain is a natural variation on this approach that to our knowledge is previously unstudied. In this paper, we analyze log-domain interior-point methods and prove their polynomial-time convergence. We also prove that they are approximated by classical barrier methods in a precise sense and provide simple computational experiments illustrating their superior performance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02294","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/2212.02294/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":"2212.02294","created_at":"2026-07-05T05:22:22.805325+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.02294v1","created_at":"2026-07-05T05:22:22.805325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02294","created_at":"2026-07-05T05:22:22.805325+00:00"},{"alias_kind":"pith_short_12","alias_value":"TT3ACVNI6QEN","created_at":"2026-07-05T05:22:22.805325+00:00"},{"alias_kind":"pith_short_16","alias_value":"TT3ACVNI6QENUIRR","created_at":"2026-07-05T05:22:22.805325+00:00"},{"alias_kind":"pith_short_8","alias_value":"TT3ACVNI","created_at":"2026-07-05T05:22:22.805325+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/TT3ACVNI6QENUIRR4AMYK7DAR3","json":"https://pith.science/pith/TT3ACVNI6QENUIRR4AMYK7DAR3.json","graph_json":"https://pith.science/api/pith-number/TT3ACVNI6QENUIRR4AMYK7DAR3/graph.json","events_json":"https://pith.science/api/pith-number/TT3ACVNI6QENUIRR4AMYK7DAR3/events.json","paper":"https://pith.science/paper/TT3ACVNI"},"agent_actions":{"view_html":"https://pith.science/pith/TT3ACVNI6QENUIRR4AMYK7DAR3","download_json":"https://pith.science/pith/TT3ACVNI6QENUIRR4AMYK7DAR3.json","view_paper":"https://pith.science/paper/TT3ACVNI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.02294&json=true","fetch_graph":"https://pith.science/api/pith-number/TT3ACVNI6QENUIRR4AMYK7DAR3/graph.json","fetch_events":"https://pith.science/api/pith-number/TT3ACVNI6QENUIRR4AMYK7DAR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TT3ACVNI6QENUIRR4AMYK7DAR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TT3ACVNI6QENUIRR4AMYK7DAR3/action/storage_attestation","attest_author":"https://pith.science/pith/TT3ACVNI6QENUIRR4AMYK7DAR3/action/author_attestation","sign_citation":"https://pith.science/pith/TT3ACVNI6QENUIRR4AMYK7DAR3/action/citation_signature","submit_replication":"https://pith.science/pith/TT3ACVNI6QENUIRR4AMYK7DAR3/action/replication_record"}},"created_at":"2026-07-05T05:22:22.805325+00:00","updated_at":"2026-07-05T05:22:22.805325+00:00"}