{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5SZ4V7XQJIKN2DU4LISJEARBC4","short_pith_number":"pith:5SZ4V7XQ","schema_version":"1.0","canonical_sha256":"ecb3cafef04a14dd0e9c5a24920221171a4ce9a1fdf986f0f17018272733f182","source":{"kind":"arxiv","id":"2104.14722","version":2},"attestation_state":"computed","paper":{"title":"OpenQASM 3: A broader and deeper quantum assembly language","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ali Javadi-Abhari, Andrew W. Cross, Blake R. Johnson, Colm A. Ryan, Jay M. Gambetta, John Smolin, Lev S. Bishop, Niel de Beaudrap, Prasahnt Sivarajah, Steven Heidel, Thomas Alexander","submitted_at":"2021-04-30T01:57:53Z","abstract_excerpt":"Quantum assembly languages are machine-independent languages that traditionally describe quantum computation in the circuit model. Open quantum assembly language (OpenQASM 2) was proposed as an imperative programming language for quantum circuits based on earlier QASM dialects. In principle, any quantum computation could be described using OpenQASM 2, but there is a need to describe a broader set of circuits beyond the language of qubits and gates. By examining interactive use cases, we recognize two different timescales of quantum-classical interactions: real-time classical computations that "},"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":"2104.14722","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-04-30T01:57:53Z","cross_cats_sorted":[],"title_canon_sha256":"2a8f89b89058e97efaee277a38909905d370cc3caa0fc93d424c880a2983afbf","abstract_canon_sha256":"30e4038ed88c52be957d7472acca07baae1d7c1437038ec333eb514c24228ef0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:37:51.379266Z","signature_b64":"HW4yqjfImex1qfsguT/iibE0syy/DEXrpG2ihZo4ZNj36cm3+LN7ZJ24y+H6hrA7Xef0F16C2opGaM09oNoHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecb3cafef04a14dd0e9c5a24920221171a4ce9a1fdf986f0f17018272733f182","last_reissued_at":"2026-07-05T05:37:51.378764Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:37:51.378764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"OpenQASM 3: A broader and deeper quantum assembly language","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ali Javadi-Abhari, Andrew W. Cross, Blake R. Johnson, Colm A. Ryan, Jay M. Gambetta, John Smolin, Lev S. Bishop, Niel de Beaudrap, Prasahnt Sivarajah, Steven Heidel, Thomas Alexander","submitted_at":"2021-04-30T01:57:53Z","abstract_excerpt":"Quantum assembly languages are machine-independent languages that traditionally describe quantum computation in the circuit model. Open quantum assembly language (OpenQASM 2) was proposed as an imperative programming language for quantum circuits based on earlier QASM dialects. In principle, any quantum computation could be described using OpenQASM 2, but there is a need to describe a broader set of circuits beyond the language of qubits and gates. By examining interactive use cases, we recognize two different timescales of quantum-classical interactions: real-time classical computations that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.14722","kind":"arxiv","version":2},"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/2104.14722/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":"2104.14722","created_at":"2026-07-05T05:37:51.378819+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.14722v2","created_at":"2026-07-05T05:37:51.378819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.14722","created_at":"2026-07-05T05:37:51.378819+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SZ4V7XQJIKN","created_at":"2026-07-05T05:37:51.378819+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SZ4V7XQJIKN2DU4","created_at":"2026-07-05T05:37:51.378819+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SZ4V7XQ","created_at":"2026-07-05T05:37:51.378819+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26254","citing_title":"A Survey of Quantum Programming Languages","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29872","citing_title":"Claim against Measurement: Statistical Artefacts in Quantum Error Mitigation Benchmarks","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2509.08328","citing_title":"Towards solving industrial integer linear programs with Decoded Quantum Interferometry","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2603.12054","citing_title":"Noise Correlations as a Resource in Pauli-Twirled Circuits","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5SZ4V7XQJIKN2DU4LISJEARBC4","json":"https://pith.science/pith/5SZ4V7XQJIKN2DU4LISJEARBC4.json","graph_json":"https://pith.science/api/pith-number/5SZ4V7XQJIKN2DU4LISJEARBC4/graph.json","events_json":"https://pith.science/api/pith-number/5SZ4V7XQJIKN2DU4LISJEARBC4/events.json","paper":"https://pith.science/paper/5SZ4V7XQ"},"agent_actions":{"view_html":"https://pith.science/pith/5SZ4V7XQJIKN2DU4LISJEARBC4","download_json":"https://pith.science/pith/5SZ4V7XQJIKN2DU4LISJEARBC4.json","view_paper":"https://pith.science/paper/5SZ4V7XQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.14722&json=true","fetch_graph":"https://pith.science/api/pith-number/5SZ4V7XQJIKN2DU4LISJEARBC4/graph.json","fetch_events":"https://pith.science/api/pith-number/5SZ4V7XQJIKN2DU4LISJEARBC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SZ4V7XQJIKN2DU4LISJEARBC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SZ4V7XQJIKN2DU4LISJEARBC4/action/storage_attestation","attest_author":"https://pith.science/pith/5SZ4V7XQJIKN2DU4LISJEARBC4/action/author_attestation","sign_citation":"https://pith.science/pith/5SZ4V7XQJIKN2DU4LISJEARBC4/action/citation_signature","submit_replication":"https://pith.science/pith/5SZ4V7XQJIKN2DU4LISJEARBC4/action/replication_record"}},"created_at":"2026-07-05T05:37:51.378819+00:00","updated_at":"2026-07-05T05:37:51.378819+00:00"}