{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CQ547HIADUBJYTSXWA3JFG7PAA","short_pith_number":"pith:CQ547HIA","schema_version":"1.0","canonical_sha256":"143bcf9d001d029c4e57b036929bef003eba3937d9cd8e91700194e3fd9bb9da","source":{"kind":"arxiv","id":"2608.01121","version":1},"attestation_state":"computed","paper":{"title":"Geometry-Informed Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM","math-ph","math.MP","physics.app-ph"],"primary_cat":"quant-ph","authors_text":"Chinonso Onah, Kristel Michielsen","submitted_at":"2026-08-02T09:35:42Z","abstract_excerpt":"When does a noisy quantum sampler yield an end-to-end polynomial-time optimization algorithm with performance guarantees? Building on finite-depth and finite-shot guarantees for Constraint-Enhanced QAOA, we show that inverse-polynomial ideal probability on the optimal set, together with independent sampling, polynomial-time feasibility repair, and scoring, produces an exact-hit fully polynomial randomized approximation scheme, which we call an FPRASq.\n  This guarantee survives device noise within an instance-dependent window. For effective circuit depth linear in the product of layer count and"},"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":"2608.01121","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-02T09:35:42Z","cross_cats_sorted":["cs.CC","cs.DM","math-ph","math.MP","physics.app-ph"],"title_canon_sha256":"c9954427c4ae012cd2b1efc3ee369d5946a8af0ae38dc0648ced6466b7009f31","abstract_canon_sha256":"2efce8026f0c14a4e960ae838c2f61ebef8b5de0257cb425407f6538b6e7e44e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T01:56:54.922200Z","signature_b64":"gxyjn5hwxeQMnXtuh4NzJ6BO6aDs1x2HemYtBQFFpMBH7qC1xA7b9AJo9tx8ZbXlZCC4dnnvqm/XE9ww9rIDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"143bcf9d001d029c4e57b036929bef003eba3937d9cd8e91700194e3fd9bb9da","last_reissued_at":"2026-08-04T01:56:54.920724Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T01:56:54.920724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometry-Informed Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM","math-ph","math.MP","physics.app-ph"],"primary_cat":"quant-ph","authors_text":"Chinonso Onah, Kristel Michielsen","submitted_at":"2026-08-02T09:35:42Z","abstract_excerpt":"When does a noisy quantum sampler yield an end-to-end polynomial-time optimization algorithm with performance guarantees? Building on finite-depth and finite-shot guarantees for Constraint-Enhanced QAOA, we show that inverse-polynomial ideal probability on the optimal set, together with independent sampling, polynomial-time feasibility repair, and scoring, produces an exact-hit fully polynomial randomized approximation scheme, which we call an FPRASq.\n  This guarantee survives device noise within an instance-dependent window. For effective circuit depth linear in the product of layer count and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.01121","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/2608.01121/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":"2608.01121","created_at":"2026-08-04T01:56:54.922014+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.01121v1","created_at":"2026-08-04T01:56:54.922014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.01121","created_at":"2026-08-04T01:56:54.922014+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQ547HIADUBJ","created_at":"2026-08-04T01:56:54.922014+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQ547HIADUBJYTSX","created_at":"2026-08-04T01:56:54.922014+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQ547HIA","created_at":"2026-08-04T01:56:54.922014+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/CQ547HIADUBJYTSXWA3JFG7PAA","json":"https://pith.science/pith/CQ547HIADUBJYTSXWA3JFG7PAA.json","graph_json":"https://pith.science/api/pith-number/CQ547HIADUBJYTSXWA3JFG7PAA/graph.json","events_json":"https://pith.science/api/pith-number/CQ547HIADUBJYTSXWA3JFG7PAA/events.json","paper":"https://pith.science/paper/CQ547HIA"},"agent_actions":{"view_html":"https://pith.science/pith/CQ547HIADUBJYTSXWA3JFG7PAA","download_json":"https://pith.science/pith/CQ547HIADUBJYTSXWA3JFG7PAA.json","view_paper":"https://pith.science/paper/CQ547HIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.01121&json=true","fetch_graph":"https://pith.science/api/pith-number/CQ547HIADUBJYTSXWA3JFG7PAA/graph.json","fetch_events":"https://pith.science/api/pith-number/CQ547HIADUBJYTSXWA3JFG7PAA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQ547HIADUBJYTSXWA3JFG7PAA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQ547HIADUBJYTSXWA3JFG7PAA/action/storage_attestation","attest_author":"https://pith.science/pith/CQ547HIADUBJYTSXWA3JFG7PAA/action/author_attestation","sign_citation":"https://pith.science/pith/CQ547HIADUBJYTSXWA3JFG7PAA/action/citation_signature","submit_replication":"https://pith.science/pith/CQ547HIADUBJYTSXWA3JFG7PAA/action/replication_record"}},"created_at":"2026-08-04T01:56:54.922014+00:00","updated_at":"2026-08-04T01:56:54.922014+00:00"}