{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:N4PUQX557ZNTPNXOFHV6AYYNCJ","short_pith_number":"pith:N4PUQX55","schema_version":"1.0","canonical_sha256":"6f1f485fbdfe5b37b6ee29ebe0630d126d48cbde07a6bd0711a7c82e029f3dcb","source":{"kind":"arxiv","id":"2205.01220","version":2},"attestation_state":"computed","paper":{"title":"Efficient Use of Quantum Linear System Algorithms in Interior Point Methods for Linear Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Mohammadhossein Mohammadisiahroudi, Ramin Fakhimi, Tam\\'as Terlaky","submitted_at":"2022-05-02T21:30:56Z","abstract_excerpt":"Quantum computing has attracted significant interest in the optimization community because it potentially can solve classes of optimization problems faster than conventional supercomputers. Several researchers proposed quantum computing methods, especially Quantum Interior Point Methods (QIPMs), to solve convex optimization problems, such as Linear Optimization, Semidefinite Optimization, and Second-order Cone Optimization problems. Most of them have applied a Quantum Linear System Algorithm at each iteration to compute a Newton step. However, using quantum linear solvers in QIPMs comes with m"},"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":"2205.01220","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-05-02T21:30:56Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"635e006b3b5f9d0012d5da200ab4c2003d08ac46486d7d1087d2dec0fc7fca2e","abstract_canon_sha256":"b09d61965bf4eb64135ede7dfaba31b967a6c4018237970a957690472d54892f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:40:45.711247Z","signature_b64":"TCP+zsHn+Vl1dIiC4XeHJLlduXWN7UJylUhzcInbNDv56XqaPDcl+Cp3xQ66AMCpe5xYM4LdCVyACgCqgEt7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f1f485fbdfe5b37b6ee29ebe0630d126d48cbde07a6bd0711a7c82e029f3dcb","last_reissued_at":"2026-07-05T05:40:45.710817Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:40:45.710817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Use of Quantum Linear System Algorithms in Interior Point Methods for Linear Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Mohammadhossein Mohammadisiahroudi, Ramin Fakhimi, Tam\\'as Terlaky","submitted_at":"2022-05-02T21:30:56Z","abstract_excerpt":"Quantum computing has attracted significant interest in the optimization community because it potentially can solve classes of optimization problems faster than conventional supercomputers. Several researchers proposed quantum computing methods, especially Quantum Interior Point Methods (QIPMs), to solve convex optimization problems, such as Linear Optimization, Semidefinite Optimization, and Second-order Cone Optimization problems. Most of them have applied a Quantum Linear System Algorithm at each iteration to compute a Newton step. However, using quantum linear solvers in QIPMs comes with m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.01220","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/2205.01220/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":"2205.01220","created_at":"2026-07-05T05:40:45.710870+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.01220v2","created_at":"2026-07-05T05:40:45.710870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.01220","created_at":"2026-07-05T05:40:45.710870+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4PUQX557ZNT","created_at":"2026-07-05T05:40:45.710870+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4PUQX557ZNTPNXO","created_at":"2026-07-05T05:40:45.710870+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4PUQX55","created_at":"2026-07-05T05:40:45.710870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.11307","citing_title":"A preconditioned inexact infeasible quantum interior point method for linear optimization","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N4PUQX557ZNTPNXOFHV6AYYNCJ","json":"https://pith.science/pith/N4PUQX557ZNTPNXOFHV6AYYNCJ.json","graph_json":"https://pith.science/api/pith-number/N4PUQX557ZNTPNXOFHV6AYYNCJ/graph.json","events_json":"https://pith.science/api/pith-number/N4PUQX557ZNTPNXOFHV6AYYNCJ/events.json","paper":"https://pith.science/paper/N4PUQX55"},"agent_actions":{"view_html":"https://pith.science/pith/N4PUQX557ZNTPNXOFHV6AYYNCJ","download_json":"https://pith.science/pith/N4PUQX557ZNTPNXOFHV6AYYNCJ.json","view_paper":"https://pith.science/paper/N4PUQX55","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.01220&json=true","fetch_graph":"https://pith.science/api/pith-number/N4PUQX557ZNTPNXOFHV6AYYNCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/N4PUQX557ZNTPNXOFHV6AYYNCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4PUQX557ZNTPNXOFHV6AYYNCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4PUQX557ZNTPNXOFHV6AYYNCJ/action/storage_attestation","attest_author":"https://pith.science/pith/N4PUQX557ZNTPNXOFHV6AYYNCJ/action/author_attestation","sign_citation":"https://pith.science/pith/N4PUQX557ZNTPNXOFHV6AYYNCJ/action/citation_signature","submit_replication":"https://pith.science/pith/N4PUQX557ZNTPNXOFHV6AYYNCJ/action/replication_record"}},"created_at":"2026-07-05T05:40:45.710870+00:00","updated_at":"2026-07-05T05:40:45.710870+00:00"}