{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4FXMISGGLZHSYUAUSAEHZANF6N","short_pith_number":"pith:4FXMISGG","schema_version":"1.0","canonical_sha256":"e16ec448c65e4f2c501490087c81a5f37a260385ba7c0b5a04c1085a1bf776d1","source":{"kind":"arxiv","id":"1509.07789","version":1},"attestation_state":"computed","paper":{"title":"On exact counting and quasi-quantum complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Niel de Beaudrap","submitted_at":"2015-09-25T16:54:10Z","abstract_excerpt":"We present characterisations of \"exact\" gap-definable classes, in terms of indeterministic models of computation which slightly modify the standard model of quantum computation. This follows on work of Aaronson [arXiv:quant-ph/0412187], who shows that the counting class PP can be characterised in terms of bounded-error \"quantum\" algorithms which use invertible (and possibly non-unitary) transformations, or postselections on events of non-zero probability. Our work considers similar modifications of the quantum computational model, but in the setting of exact algorithms, and algorithms with zer"},"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":"1509.07789","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-25T16:54:10Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"0723cfa1183822e08712fd8d0ae315d8b11b6f67456c1f33e0fc28a3947bc54b","abstract_canon_sha256":"8825868b19319f92120850f172dd29069272029be49e1f1ed98035162c400b86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:01.946787Z","signature_b64":"CVjPhOOJWLNYyhl/xoIX7AHQFB8Sg2JiUzTKBvf3EA2+/ldzyrkgPhSk8rtKu/kgmQgswP9Ied7zdYE62mihAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e16ec448c65e4f2c501490087c81a5f37a260385ba7c0b5a04c1085a1bf776d1","last_reissued_at":"2026-05-18T01:32:01.946289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:01.946289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On exact counting and quasi-quantum complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Niel de Beaudrap","submitted_at":"2015-09-25T16:54:10Z","abstract_excerpt":"We present characterisations of \"exact\" gap-definable classes, in terms of indeterministic models of computation which slightly modify the standard model of quantum computation. This follows on work of Aaronson [arXiv:quant-ph/0412187], who shows that the counting class PP can be characterised in terms of bounded-error \"quantum\" algorithms which use invertible (and possibly non-unitary) transformations, or postselections on events of non-zero probability. Our work considers similar modifications of the quantum computational model, but in the setting of exact algorithms, and algorithms with zer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07789","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":""},"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":"1509.07789","created_at":"2026-05-18T01:32:01.946370+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07789v1","created_at":"2026-05-18T01:32:01.946370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07789","created_at":"2026-05-18T01:32:01.946370+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FXMISGGLZHS","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FXMISGGLZHSYUAU","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FXMISGG","created_at":"2026-05-18T12:29:05.191682+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/4FXMISGGLZHSYUAUSAEHZANF6N","json":"https://pith.science/pith/4FXMISGGLZHSYUAUSAEHZANF6N.json","graph_json":"https://pith.science/api/pith-number/4FXMISGGLZHSYUAUSAEHZANF6N/graph.json","events_json":"https://pith.science/api/pith-number/4FXMISGGLZHSYUAUSAEHZANF6N/events.json","paper":"https://pith.science/paper/4FXMISGG"},"agent_actions":{"view_html":"https://pith.science/pith/4FXMISGGLZHSYUAUSAEHZANF6N","download_json":"https://pith.science/pith/4FXMISGGLZHSYUAUSAEHZANF6N.json","view_paper":"https://pith.science/paper/4FXMISGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07789&json=true","fetch_graph":"https://pith.science/api/pith-number/4FXMISGGLZHSYUAUSAEHZANF6N/graph.json","fetch_events":"https://pith.science/api/pith-number/4FXMISGGLZHSYUAUSAEHZANF6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FXMISGGLZHSYUAUSAEHZANF6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FXMISGGLZHSYUAUSAEHZANF6N/action/storage_attestation","attest_author":"https://pith.science/pith/4FXMISGGLZHSYUAUSAEHZANF6N/action/author_attestation","sign_citation":"https://pith.science/pith/4FXMISGGLZHSYUAUSAEHZANF6N/action/citation_signature","submit_replication":"https://pith.science/pith/4FXMISGGLZHSYUAUSAEHZANF6N/action/replication_record"}},"created_at":"2026-05-18T01:32:01.946370+00:00","updated_at":"2026-05-18T01:32:01.946370+00:00"}