{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2VONZDCGTF7WTOY62PHUDECWDC","short_pith_number":"pith:2VONZDCG","schema_version":"1.0","canonical_sha256":"d55cdc8c46997f69bb1ed3cf41905618b336bdef184b98eaacb93db11dd71e35","source":{"kind":"arxiv","id":"2210.08027","version":3},"attestation_state":"computed","paper":{"title":"Predicting Good Quantum Circuit Compilation Options","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Lukas Burgholzer, Nils Quetschlich, Robert Wille","submitted_at":"2022-10-14T18:00:03Z","abstract_excerpt":"Any potential application of quantum computing, once encoded as a quantum circuit, needs to be compiled in order to be executed on a quantum computer. Deciding which qubit technology, which device, which compiler, and which corresponding settings are best for the considered problem -- according to a measure of goodness -- requires expert knowledge and is overwhelming for end-users from different domains trying to use quantum computing to their advantage. In this work, we treat the problem as a statistical classification task and explore the utilization of supervised machine learning techniques"},"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":"2210.08027","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-10-14T18:00:03Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"356bd71cdee685055cfd4c09888e198545141b010493f4a2948513b959410721","abstract_canon_sha256":"2cca81d59211fa8f691e9c994f29cbc1c204d161b04854465c869eaf04863f4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:35:33.779887Z","signature_b64":"xGj3/VljyBTYFY9TdrstLHS50cmkLvoaOpfn+K83At88k+O2AwtIVCSDxuWRmHlnhUnn+zBai4Tt9PJd9jpUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d55cdc8c46997f69bb1ed3cf41905618b336bdef184b98eaacb93db11dd71e35","last_reissued_at":"2026-07-05T08:35:33.779489Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:35:33.779489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predicting Good Quantum Circuit Compilation Options","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Lukas Burgholzer, Nils Quetschlich, Robert Wille","submitted_at":"2022-10-14T18:00:03Z","abstract_excerpt":"Any potential application of quantum computing, once encoded as a quantum circuit, needs to be compiled in order to be executed on a quantum computer. Deciding which qubit technology, which device, which compiler, and which corresponding settings are best for the considered problem -- according to a measure of goodness -- requires expert knowledge and is overwhelming for end-users from different domains trying to use quantum computing to their advantage. In this work, we treat the problem as a statistical classification task and explore the utilization of supervised machine learning techniques"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.08027","kind":"arxiv","version":3},"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/2210.08027/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":"2210.08027","created_at":"2026-07-05T08:35:33.779551+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.08027v3","created_at":"2026-07-05T08:35:33.779551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.08027","created_at":"2026-07-05T08:35:33.779551+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VONZDCGTF7W","created_at":"2026-07-05T08:35:33.779551+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VONZDCGTF7WTOY6","created_at":"2026-07-05T08:35:33.779551+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VONZDCG","created_at":"2026-07-05T08:35:33.779551+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11620","citing_title":"Family-Aware Residual Architecture for Predicting Quantum Circuit Simulation Performance","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2VONZDCGTF7WTOY62PHUDECWDC","json":"https://pith.science/pith/2VONZDCGTF7WTOY62PHUDECWDC.json","graph_json":"https://pith.science/api/pith-number/2VONZDCGTF7WTOY62PHUDECWDC/graph.json","events_json":"https://pith.science/api/pith-number/2VONZDCGTF7WTOY62PHUDECWDC/events.json","paper":"https://pith.science/paper/2VONZDCG"},"agent_actions":{"view_html":"https://pith.science/pith/2VONZDCGTF7WTOY62PHUDECWDC","download_json":"https://pith.science/pith/2VONZDCGTF7WTOY62PHUDECWDC.json","view_paper":"https://pith.science/paper/2VONZDCG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.08027&json=true","fetch_graph":"https://pith.science/api/pith-number/2VONZDCGTF7WTOY62PHUDECWDC/graph.json","fetch_events":"https://pith.science/api/pith-number/2VONZDCGTF7WTOY62PHUDECWDC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VONZDCGTF7WTOY62PHUDECWDC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VONZDCGTF7WTOY62PHUDECWDC/action/storage_attestation","attest_author":"https://pith.science/pith/2VONZDCGTF7WTOY62PHUDECWDC/action/author_attestation","sign_citation":"https://pith.science/pith/2VONZDCGTF7WTOY62PHUDECWDC/action/citation_signature","submit_replication":"https://pith.science/pith/2VONZDCGTF7WTOY62PHUDECWDC/action/replication_record"}},"created_at":"2026-07-05T08:35:33.779551+00:00","updated_at":"2026-07-05T08:35:33.779551+00:00"}