{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2UWJVNFV5WJIPUNLQEKXQURL25","short_pith_number":"pith:2UWJVNFV","schema_version":"1.0","canonical_sha256":"d52c9ab4b5ed9287d1ab811578522bd76f96ecda533f338a46eeef23e3ea5f51","source":{"kind":"arxiv","id":"2501.14191","version":2},"attestation_state":"computed","paper":{"title":"Optimal Preconditioning for Online Quadratic Cone Programming","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Abhinav G. Kamath, Beh\\c{c}et A\\c{c}{\\i}kme\\c{s}e, Purnanand Elango","submitted_at":"2025-01-24T02:54:06Z","abstract_excerpt":"First-order conic optimization solvers are sensitive to problem conditioning and typically perform poorly in the face of ill-conditioned problem data. To mitigate this, we propose an approach to preconditioning--the hypersphere preconditioner--for a class of quadratic cone programs (QCPs), i.e., conic optimization problems with a quadratic objective function, wherein the objective function is strongly convex and possesses a certain structure. This approach lends itself to factorization-free, customizable, first-order conic optimization for online applications wherein the solver is called repea"},"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":"2501.14191","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-24T02:54:06Z","cross_cats_sorted":[],"title_canon_sha256":"b0382f3b35724312b56eed58198eb96dbc0eb5466e827637c91f96e8c51df90a","abstract_canon_sha256":"b6c0bb9501e845a5495570b0751ac79616d69f5a40a2395a681fb3d332ccdb88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:54:42.102993Z","signature_b64":"9TqM3DchUXVYdUHYdNXS1oXJIJDv8vLrOyS3ljjXEAssEr/vYzw33zMIxqGWlfuJ1sTqBzWyR4hQNAOelXjLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d52c9ab4b5ed9287d1ab811578522bd76f96ecda533f338a46eeef23e3ea5f51","last_reissued_at":"2026-07-05T10:54:42.102492Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:54:42.102492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Preconditioning for Online Quadratic Cone Programming","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Abhinav G. Kamath, Beh\\c{c}et A\\c{c}{\\i}kme\\c{s}e, Purnanand Elango","submitted_at":"2025-01-24T02:54:06Z","abstract_excerpt":"First-order conic optimization solvers are sensitive to problem conditioning and typically perform poorly in the face of ill-conditioned problem data. To mitigate this, we propose an approach to preconditioning--the hypersphere preconditioner--for a class of quadratic cone programs (QCPs), i.e., conic optimization problems with a quadratic objective function, wherein the objective function is strongly convex and possesses a certain structure. This approach lends itself to factorization-free, customizable, first-order conic optimization for online applications wherein the solver is called repea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.14191","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/2501.14191/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":"2501.14191","created_at":"2026-07-05T10:54:42.102548+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.14191v2","created_at":"2026-07-05T10:54:42.102548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14191","created_at":"2026-07-05T10:54:42.102548+00:00"},{"alias_kind":"pith_short_12","alias_value":"2UWJVNFV5WJI","created_at":"2026-07-05T10:54:42.102548+00:00"},{"alias_kind":"pith_short_16","alias_value":"2UWJVNFV5WJIPUNL","created_at":"2026-07-05T10:54:42.102548+00:00"},{"alias_kind":"pith_short_8","alias_value":"2UWJVNFV","created_at":"2026-07-05T10:54:42.102548+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/2UWJVNFV5WJIPUNLQEKXQURL25","json":"https://pith.science/pith/2UWJVNFV5WJIPUNLQEKXQURL25.json","graph_json":"https://pith.science/api/pith-number/2UWJVNFV5WJIPUNLQEKXQURL25/graph.json","events_json":"https://pith.science/api/pith-number/2UWJVNFV5WJIPUNLQEKXQURL25/events.json","paper":"https://pith.science/paper/2UWJVNFV"},"agent_actions":{"view_html":"https://pith.science/pith/2UWJVNFV5WJIPUNLQEKXQURL25","download_json":"https://pith.science/pith/2UWJVNFV5WJIPUNLQEKXQURL25.json","view_paper":"https://pith.science/paper/2UWJVNFV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.14191&json=true","fetch_graph":"https://pith.science/api/pith-number/2UWJVNFV5WJIPUNLQEKXQURL25/graph.json","fetch_events":"https://pith.science/api/pith-number/2UWJVNFV5WJIPUNLQEKXQURL25/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2UWJVNFV5WJIPUNLQEKXQURL25/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2UWJVNFV5WJIPUNLQEKXQURL25/action/storage_attestation","attest_author":"https://pith.science/pith/2UWJVNFV5WJIPUNLQEKXQURL25/action/author_attestation","sign_citation":"https://pith.science/pith/2UWJVNFV5WJIPUNLQEKXQURL25/action/citation_signature","submit_replication":"https://pith.science/pith/2UWJVNFV5WJIPUNLQEKXQURL25/action/replication_record"}},"created_at":"2026-07-05T10:54:42.102548+00:00","updated_at":"2026-07-05T10:54:42.102548+00:00"}