{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:O74IIMNQJZTFVSXQBXSWUN6LQW","short_pith_number":"pith:O74IIMNQ","schema_version":"1.0","canonical_sha256":"77f88431b04e665acaf00de56a37cb85830e8681fa890cbbf81194fc843e9698","source":{"kind":"arxiv","id":"2211.02559","version":1},"attestation_state":"computed","paper":{"title":"Conventions for Quantum Pseudocode","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Knill","submitted_at":"2022-11-04T16:24:45Z","abstract_excerpt":"A few conventions for thinking about and writing quantum pseudocode are proposed. The conventions can be used for presenting any quantum algorithm down to the lowest level and are consistent with a quantum random access machine (QRAM) model for quantum computing. In principle a formal version of quantum pseudocode could be used in a future extension of a conventional language."},"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":"2211.02559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-11-04T16:24:45Z","cross_cats_sorted":[],"title_canon_sha256":"a4020e60c8141d6c34e3ba320fa3d2edf3a8cfd4fecd9130a641e52c35e81ec6","abstract_canon_sha256":"23fe379eb2eabb64e61c632a9267f30d5a7b1c0872b983572c05c67b29e1452c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:13:16.614740Z","signature_b64":"Tg3TuQGKEaTb2eHAAFGBB2DF7y+O08eEy4trSqwgeO/3hOBhl9N4tjyBjYWfvZw9WnaUvRW7zgg280pxHCwjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77f88431b04e665acaf00de56a37cb85830e8681fa890cbbf81194fc843e9698","last_reissued_at":"2026-07-05T05:13:16.614353Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:13:16.614353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conventions for Quantum Pseudocode","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Knill","submitted_at":"2022-11-04T16:24:45Z","abstract_excerpt":"A few conventions for thinking about and writing quantum pseudocode are proposed. The conventions can be used for presenting any quantum algorithm down to the lowest level and are consistent with a quantum random access machine (QRAM) model for quantum computing. In principle a formal version of quantum pseudocode could be used in a future extension of a conventional language."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02559","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/2211.02559/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":"2211.02559","created_at":"2026-07-05T05:13:16.614411+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.02559v1","created_at":"2026-07-05T05:13:16.614411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02559","created_at":"2026-07-05T05:13:16.614411+00:00"},{"alias_kind":"pith_short_12","alias_value":"O74IIMNQJZTF","created_at":"2026-07-05T05:13:16.614411+00:00"},{"alias_kind":"pith_short_16","alias_value":"O74IIMNQJZTFVSXQ","created_at":"2026-07-05T05:13:16.614411+00:00"},{"alias_kind":"pith_short_8","alias_value":"O74IIMNQ","created_at":"2026-07-05T05:13:16.614411+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/O74IIMNQJZTFVSXQBXSWUN6LQW","json":"https://pith.science/pith/O74IIMNQJZTFVSXQBXSWUN6LQW.json","graph_json":"https://pith.science/api/pith-number/O74IIMNQJZTFVSXQBXSWUN6LQW/graph.json","events_json":"https://pith.science/api/pith-number/O74IIMNQJZTFVSXQBXSWUN6LQW/events.json","paper":"https://pith.science/paper/O74IIMNQ"},"agent_actions":{"view_html":"https://pith.science/pith/O74IIMNQJZTFVSXQBXSWUN6LQW","download_json":"https://pith.science/pith/O74IIMNQJZTFVSXQBXSWUN6LQW.json","view_paper":"https://pith.science/paper/O74IIMNQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.02559&json=true","fetch_graph":"https://pith.science/api/pith-number/O74IIMNQJZTFVSXQBXSWUN6LQW/graph.json","fetch_events":"https://pith.science/api/pith-number/O74IIMNQJZTFVSXQBXSWUN6LQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O74IIMNQJZTFVSXQBXSWUN6LQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O74IIMNQJZTFVSXQBXSWUN6LQW/action/storage_attestation","attest_author":"https://pith.science/pith/O74IIMNQJZTFVSXQBXSWUN6LQW/action/author_attestation","sign_citation":"https://pith.science/pith/O74IIMNQJZTFVSXQBXSWUN6LQW/action/citation_signature","submit_replication":"https://pith.science/pith/O74IIMNQJZTFVSXQBXSWUN6LQW/action/replication_record"}},"created_at":"2026-07-05T05:13:16.614411+00:00","updated_at":"2026-07-05T05:13:16.614411+00:00"}