{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1999:CW2RFKDULL5IQKZHLNEYNMQFAK","short_pith_number":"pith:CW2RFKDU","schema_version":"1.0","canonical_sha256":"15b512a8745afa882b275b4986b2050299b0a685b49746fe1b01e9b7a8cb883c","source":{"kind":"arxiv","id":"quant-ph/9906111","version":1},"attestation_state":"computed","paper":{"title":"An Introduction to Quantum Complexity Theory","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Richard Cleve (U of Calgary)","submitted_at":"1999-06-28T21:52:49Z","abstract_excerpt":"We give a basic overview of computational complexity, query complexity, and communication complexity, with quantum information incorporated into each of these scenarios. The aim is to provide simple but clear definitions, and to highlight the interplay between the three scenarios and currently-known quantum algorithms."},"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":"quant-ph/9906111","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1999-06-28T21:52:49Z","cross_cats_sorted":[],"title_canon_sha256":"d9de56d2b34208ffa476adc4f578eefabb3140ceb00f19b7474fa55f71110a25","abstract_canon_sha256":"842722eab8139822c40552bc9e42bf28df56f0f70328c664a46d2dd45f203684"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:05.240020Z","signature_b64":"2Sekuu995ljBiwsHbViRMf48Uxgqxrsc+ZY28mxflC7wJ91IJX5gLbXt60DEuPkFMkZyFwEHk6l8Ue7rSoRICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15b512a8745afa882b275b4986b2050299b0a685b49746fe1b01e9b7a8cb883c","last_reissued_at":"2026-05-18T00:57:05.239405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:05.239405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Introduction to Quantum Complexity Theory","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Richard Cleve (U of Calgary)","submitted_at":"1999-06-28T21:52:49Z","abstract_excerpt":"We give a basic overview of computational complexity, query complexity, and communication complexity, with quantum information incorporated into each of these scenarios. The aim is to provide simple but clear definitions, and to highlight the interplay between the three scenarios and currently-known quantum algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9906111","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":"quant-ph/9906111","created_at":"2026-05-18T00:57:05.239494+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9906111v1","created_at":"2026-05-18T00:57:05.239494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9906111","created_at":"2026-05-18T00:57:05.239494+00:00"},{"alias_kind":"pith_short_12","alias_value":"CW2RFKDULL5I","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_16","alias_value":"CW2RFKDULL5IQKZH","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_8","alias_value":"CW2RFKDU","created_at":"2026-05-18T12:25:49.038998+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/CW2RFKDULL5IQKZHLNEYNMQFAK","json":"https://pith.science/pith/CW2RFKDULL5IQKZHLNEYNMQFAK.json","graph_json":"https://pith.science/api/pith-number/CW2RFKDULL5IQKZHLNEYNMQFAK/graph.json","events_json":"https://pith.science/api/pith-number/CW2RFKDULL5IQKZHLNEYNMQFAK/events.json","paper":"https://pith.science/paper/CW2RFKDU"},"agent_actions":{"view_html":"https://pith.science/pith/CW2RFKDULL5IQKZHLNEYNMQFAK","download_json":"https://pith.science/pith/CW2RFKDULL5IQKZHLNEYNMQFAK.json","view_paper":"https://pith.science/paper/CW2RFKDU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9906111&json=true","fetch_graph":"https://pith.science/api/pith-number/CW2RFKDULL5IQKZHLNEYNMQFAK/graph.json","fetch_events":"https://pith.science/api/pith-number/CW2RFKDULL5IQKZHLNEYNMQFAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CW2RFKDULL5IQKZHLNEYNMQFAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CW2RFKDULL5IQKZHLNEYNMQFAK/action/storage_attestation","attest_author":"https://pith.science/pith/CW2RFKDULL5IQKZHLNEYNMQFAK/action/author_attestation","sign_citation":"https://pith.science/pith/CW2RFKDULL5IQKZHLNEYNMQFAK/action/citation_signature","submit_replication":"https://pith.science/pith/CW2RFKDULL5IQKZHLNEYNMQFAK/action/replication_record"}},"created_at":"2026-05-18T00:57:05.239494+00:00","updated_at":"2026-05-18T00:57:05.239494+00:00"}