{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TM53CLUCJL67KEGJTQMZBXV3CU","short_pith_number":"pith:TM53CLUC","schema_version":"1.0","canonical_sha256":"9b3bb12e824afdf510c99c1990debb1512db5df2c9200a0819aef1f36c4ab8a8","source":{"kind":"arxiv","id":"2506.15551","version":1},"attestation_state":"computed","paper":{"title":"${\\sf QMA}={\\sf QMA}_1$ with an infinite counter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Freek Witteveen, Stacey Jeffery","submitted_at":"2025-06-18T15:23:40Z","abstract_excerpt":"A long-standing open problem in quantum complexity theory is whether ${\\sf QMA}$, the quantum analogue of ${\\sf NP}$, is equal to ${\\sf QMA}_1$, its one-sided error variant. We show that ${\\sf QMA}={\\sf QMA}^{\\infty}= {\\sf QMA}_1^{\\infty}$, where ${\\sf QMA}_1^\\infty$ is like ${\\sf QMA}_1$, but the verifier has an infinite register, as part of their witness system, in which they can efficiently perform a shift (increment) operation. We call this register an ``infinite counter'', and compare it to a program counter in a Las Vegas algorithm. The result ${\\sf QMA}={\\sf QMA}^\\infty$ means such an i"},"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":"2506.15551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-06-18T15:23:40Z","cross_cats_sorted":[],"title_canon_sha256":"76f737cfa3d9c6d94273f712f18d9923d17c81e2b0e7c6dc9903d5aa0f24cee1","abstract_canon_sha256":"acfd1c5d9ca2a539125c59ad062571b23960a6b942c751d02715224075d7b314"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:45.925857Z","signature_b64":"ILTZ/TzLhuBODqbfnSO1UDhQ6ovVOEmCVEEaBzXqzkOM/FBf1B6vrdHrp3064dYpjD1iCbOsx4PBzTHgNnh7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b3bb12e824afdf510c99c1990debb1512db5df2c9200a0819aef1f36c4ab8a8","last_reissued_at":"2026-07-05T11:23:45.925270Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:45.925270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"${\\sf QMA}={\\sf QMA}_1$ with an infinite counter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Freek Witteveen, Stacey Jeffery","submitted_at":"2025-06-18T15:23:40Z","abstract_excerpt":"A long-standing open problem in quantum complexity theory is whether ${\\sf QMA}$, the quantum analogue of ${\\sf NP}$, is equal to ${\\sf QMA}_1$, its one-sided error variant. We show that ${\\sf QMA}={\\sf QMA}^{\\infty}= {\\sf QMA}_1^{\\infty}$, where ${\\sf QMA}_1^\\infty$ is like ${\\sf QMA}_1$, but the verifier has an infinite register, as part of their witness system, in which they can efficiently perform a shift (increment) operation. We call this register an ``infinite counter'', and compare it to a program counter in a Las Vegas algorithm. The result ${\\sf QMA}={\\sf QMA}^\\infty$ means such an i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.15551","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/2506.15551/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":"2506.15551","created_at":"2026-07-05T11:23:45.925336+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.15551v1","created_at":"2026-07-05T11:23:45.925336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.15551","created_at":"2026-07-05T11:23:45.925336+00:00"},{"alias_kind":"pith_short_12","alias_value":"TM53CLUCJL67","created_at":"2026-07-05T11:23:45.925336+00:00"},{"alias_kind":"pith_short_16","alias_value":"TM53CLUCJL67KEGJ","created_at":"2026-07-05T11:23:45.925336+00:00"},{"alias_kind":"pith_short_8","alias_value":"TM53CLUC","created_at":"2026-07-05T11:23:45.925336+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/TM53CLUCJL67KEGJTQMZBXV3CU","json":"https://pith.science/pith/TM53CLUCJL67KEGJTQMZBXV3CU.json","graph_json":"https://pith.science/api/pith-number/TM53CLUCJL67KEGJTQMZBXV3CU/graph.json","events_json":"https://pith.science/api/pith-number/TM53CLUCJL67KEGJTQMZBXV3CU/events.json","paper":"https://pith.science/paper/TM53CLUC"},"agent_actions":{"view_html":"https://pith.science/pith/TM53CLUCJL67KEGJTQMZBXV3CU","download_json":"https://pith.science/pith/TM53CLUCJL67KEGJTQMZBXV3CU.json","view_paper":"https://pith.science/paper/TM53CLUC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.15551&json=true","fetch_graph":"https://pith.science/api/pith-number/TM53CLUCJL67KEGJTQMZBXV3CU/graph.json","fetch_events":"https://pith.science/api/pith-number/TM53CLUCJL67KEGJTQMZBXV3CU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TM53CLUCJL67KEGJTQMZBXV3CU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TM53CLUCJL67KEGJTQMZBXV3CU/action/storage_attestation","attest_author":"https://pith.science/pith/TM53CLUCJL67KEGJTQMZBXV3CU/action/author_attestation","sign_citation":"https://pith.science/pith/TM53CLUCJL67KEGJTQMZBXV3CU/action/citation_signature","submit_replication":"https://pith.science/pith/TM53CLUCJL67KEGJTQMZBXV3CU/action/replication_record"}},"created_at":"2026-07-05T11:23:45.925336+00:00","updated_at":"2026-07-05T11:23:45.925336+00:00"}