{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UNQLXVUTGLZZ336W5XIYR6BV24","short_pith_number":"pith:UNQLXVUT","schema_version":"1.0","canonical_sha256":"a360bbd69332f39defd6edd188f835d731f9e731fc258e962894350792250c4c","source":{"kind":"arxiv","id":"1904.06319","version":4},"attestation_state":"computed","paper":{"title":"Verified Optimization in a Quantum Intermediate Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","cs.PL","quant-ph"],"primary_cat":"cs.LO","authors_text":"Kesha Hietala, Michael Hicks, Robert Rand, Shih-Han Hung, Xiaodi Wu","submitted_at":"2019-04-12T16:54:17Z","abstract_excerpt":"We present sqire, a low-level language for quantum computing and verification. sqire uses a global register of quantum bits, allowing easy compilation to and from existing `quantum assembly' languages and simplifying the verification process. We demonstrate the power of sqire as an intermediate representation of quantum programs by verifying a number of useful optimizations, and we demonstrate sqire's use as a tool for general verification by proving several quantum programs correct."},"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":"1904.06319","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-04-12T16:54:17Z","cross_cats_sorted":["cs.ET","cs.PL","quant-ph"],"title_canon_sha256":"33688af262f61cab06b73e4ccc5bd8e384b4418ddfeba9e5a252f7512712cda0","abstract_canon_sha256":"e86fb32ea894464a5ffef800daa1e0ec168192a40cac239443e2aef738a134ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:24:26.312297Z","signature_b64":"EJF2iXfwrmw9si5kDBfHNOYnfzUtMtZws4bLC9B+laJHU8H3t6kdvsAoEdduoV4wzcmOSsX/SGWCqZ6c0TcCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a360bbd69332f39defd6edd188f835d731f9e731fc258e962894350792250c4c","last_reissued_at":"2026-07-05T00:24:26.311739Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:24:26.311739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verified Optimization in a Quantum Intermediate Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","cs.PL","quant-ph"],"primary_cat":"cs.LO","authors_text":"Kesha Hietala, Michael Hicks, Robert Rand, Shih-Han Hung, Xiaodi Wu","submitted_at":"2019-04-12T16:54:17Z","abstract_excerpt":"We present sqire, a low-level language for quantum computing and verification. sqire uses a global register of quantum bits, allowing easy compilation to and from existing `quantum assembly' languages and simplifying the verification process. We demonstrate the power of sqire as an intermediate representation of quantum programs by verifying a number of useful optimizations, and we demonstrate sqire's use as a tool for general verification by proving several quantum programs correct."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06319","kind":"arxiv","version":4},"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/1904.06319/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":"1904.06319","created_at":"2026-07-05T00:24:26.311803+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.06319v4","created_at":"2026-07-05T00:24:26.311803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06319","created_at":"2026-07-05T00:24:26.311803+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNQLXVUTGLZZ","created_at":"2026-07-05T00:24:26.311803+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNQLXVUTGLZZ336W","created_at":"2026-07-05T00:24:26.311803+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNQLXVUT","created_at":"2026-07-05T00:24:26.311803+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2411.09121","citing_title":"AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs (Technical Report)","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UNQLXVUTGLZZ336W5XIYR6BV24","json":"https://pith.science/pith/UNQLXVUTGLZZ336W5XIYR6BV24.json","graph_json":"https://pith.science/api/pith-number/UNQLXVUTGLZZ336W5XIYR6BV24/graph.json","events_json":"https://pith.science/api/pith-number/UNQLXVUTGLZZ336W5XIYR6BV24/events.json","paper":"https://pith.science/paper/UNQLXVUT"},"agent_actions":{"view_html":"https://pith.science/pith/UNQLXVUTGLZZ336W5XIYR6BV24","download_json":"https://pith.science/pith/UNQLXVUTGLZZ336W5XIYR6BV24.json","view_paper":"https://pith.science/paper/UNQLXVUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.06319&json=true","fetch_graph":"https://pith.science/api/pith-number/UNQLXVUTGLZZ336W5XIYR6BV24/graph.json","fetch_events":"https://pith.science/api/pith-number/UNQLXVUTGLZZ336W5XIYR6BV24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNQLXVUTGLZZ336W5XIYR6BV24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNQLXVUTGLZZ336W5XIYR6BV24/action/storage_attestation","attest_author":"https://pith.science/pith/UNQLXVUTGLZZ336W5XIYR6BV24/action/author_attestation","sign_citation":"https://pith.science/pith/UNQLXVUTGLZZ336W5XIYR6BV24/action/citation_signature","submit_replication":"https://pith.science/pith/UNQLXVUTGLZZ336W5XIYR6BV24/action/replication_record"}},"created_at":"2026-07-05T00:24:26.311803+00:00","updated_at":"2026-07-05T00:24:26.311803+00:00"}