{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PKQMHIGOVFKM3LNTBS2NV3GNQK","short_pith_number":"pith:PKQMHIGO","schema_version":"1.0","canonical_sha256":"7aa0c3a0cea954cdadb30cb4daeccd829def64d35281eb1ac319e06039c41949","source":{"kind":"arxiv","id":"2311.09995","version":1},"attestation_state":"computed","paper":{"title":"Realistic Runtime Analysis for Quantum Simplex Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"quant-ph","authors_text":"Andreea Lefterovici, Antonio Rotundo, David Gross, Debora Ramacciotti, Maximilian Hess, Michael Perk, Paulina L. A. Goedicke, Sabrina Ammann, S\\'andor P. Fekete, Sebastian Stiller, S. E. Skelton, Timo de Wolff, Tobias J. Osborne","submitted_at":"2023-11-16T16:11:44Z","abstract_excerpt":"In recent years, strong expectations have been raised for the possible power of quantum computing for solving difficult optimization problems, based on theoretical, asymptotic worst-case bounds. Can we expect this to have consequences for Linear and Integer Programming when solving instances of practically relevant size, a fundamental goal of Mathematical Programming, Operations Research and Algorithm Engineering? Answering this question faces a crucial impediment: The lack of sufficiently large quantum platforms prevents performing real-world tests for comparison with classical methods.\n  In "},"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":"2311.09995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-11-16T16:11:44Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"4adfb6f050bafead8bc3c9cbae8b29271c5319dbf9770c9d58b80338c82fba5b","abstract_canon_sha256":"1fc2629b435585bf715121cd375fc00e315ee77009faaaa81d51f98376745e52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:13:36.282995Z","signature_b64":"4eAxxBnGgLODnkidqGjmSBfGWXaoV4JMr74av0tBElQPC5KVGLy3TNTM349p3ipeQbmkjDtx+/uW8f+R1eayDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7aa0c3a0cea954cdadb30cb4daeccd829def64d35281eb1ac319e06039c41949","last_reissued_at":"2026-07-05T07:13:36.282572Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:13:36.282572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Realistic Runtime Analysis for Quantum Simplex Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"quant-ph","authors_text":"Andreea Lefterovici, Antonio Rotundo, David Gross, Debora Ramacciotti, Maximilian Hess, Michael Perk, Paulina L. A. Goedicke, Sabrina Ammann, S\\'andor P. Fekete, Sebastian Stiller, S. E. Skelton, Timo de Wolff, Tobias J. Osborne","submitted_at":"2023-11-16T16:11:44Z","abstract_excerpt":"In recent years, strong expectations have been raised for the possible power of quantum computing for solving difficult optimization problems, based on theoretical, asymptotic worst-case bounds. Can we expect this to have consequences for Linear and Integer Programming when solving instances of practically relevant size, a fundamental goal of Mathematical Programming, Operations Research and Algorithm Engineering? Answering this question faces a crucial impediment: The lack of sufficiently large quantum platforms prevents performing real-world tests for comparison with classical methods.\n  In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.09995","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/2311.09995/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":"2311.09995","created_at":"2026-07-05T07:13:36.282627+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.09995v1","created_at":"2026-07-05T07:13:36.282627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.09995","created_at":"2026-07-05T07:13:36.282627+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKQMHIGOVFKM","created_at":"2026-07-05T07:13:36.282627+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKQMHIGOVFKM3LNT","created_at":"2026-07-05T07:13:36.282627+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKQMHIGO","created_at":"2026-07-05T07:13:36.282627+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.24362","citing_title":"Practical lower bounds for hybrid quantum interior point methods in linear programming","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PKQMHIGOVFKM3LNTBS2NV3GNQK","json":"https://pith.science/pith/PKQMHIGOVFKM3LNTBS2NV3GNQK.json","graph_json":"https://pith.science/api/pith-number/PKQMHIGOVFKM3LNTBS2NV3GNQK/graph.json","events_json":"https://pith.science/api/pith-number/PKQMHIGOVFKM3LNTBS2NV3GNQK/events.json","paper":"https://pith.science/paper/PKQMHIGO"},"agent_actions":{"view_html":"https://pith.science/pith/PKQMHIGOVFKM3LNTBS2NV3GNQK","download_json":"https://pith.science/pith/PKQMHIGOVFKM3LNTBS2NV3GNQK.json","view_paper":"https://pith.science/paper/PKQMHIGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.09995&json=true","fetch_graph":"https://pith.science/api/pith-number/PKQMHIGOVFKM3LNTBS2NV3GNQK/graph.json","fetch_events":"https://pith.science/api/pith-number/PKQMHIGOVFKM3LNTBS2NV3GNQK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKQMHIGOVFKM3LNTBS2NV3GNQK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKQMHIGOVFKM3LNTBS2NV3GNQK/action/storage_attestation","attest_author":"https://pith.science/pith/PKQMHIGOVFKM3LNTBS2NV3GNQK/action/author_attestation","sign_citation":"https://pith.science/pith/PKQMHIGOVFKM3LNTBS2NV3GNQK/action/citation_signature","submit_replication":"https://pith.science/pith/PKQMHIGOVFKM3LNTBS2NV3GNQK/action/replication_record"}},"created_at":"2026-07-05T07:13:36.282627+00:00","updated_at":"2026-07-05T07:13:36.282627+00:00"}