{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TZ32NW27WSOZFEL5HBIFROL6P4","short_pith_number":"pith:TZ32NW27","schema_version":"1.0","canonical_sha256":"9e77a6db5fb49d92917d385058b97e7f087f030d9f012ac2a47c6038734dc887","source":{"kind":"arxiv","id":"1803.06775","version":1},"attestation_state":"computed","paper":{"title":"Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.ET","cs.SY"],"primary_cat":"quant-ph","authors_text":"Davide Venturelli, Eleanor Rieffel, J. Christopher Beck, Jeremy Frank, Kyle E. C. Booth, Minh Do","submitted_at":"2018-03-19T01:29:02Z","abstract_excerpt":"Recently, the makespan-minimization problem of compiling a general class of quantum algorithms into near-term quantum processors has been introduced to the AI community. The research demonstrated that temporal planning is a strong approach for a class of quantum circuit compilation (QCC) problems. In this paper, we explore the use of constraint programming (CP) as an alternative and complementary approach to temporal planning. We extend previous work by introducing two new problem variations that incorporate important characteristics identified by the quantum computing community. We apply temp"},"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":"1803.06775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-19T01:29:02Z","cross_cats_sorted":["cs.AI","cs.ET","cs.SY"],"title_canon_sha256":"a130d934ded7ec85c1de7b1e05702e441131114cb1b7c4baa9c5dc4e8b2e6c89","abstract_canon_sha256":"bcd3d87fc85e79a3346e964a68aaaed7b1e9c3fc65acb8ade0cd29ae09c91c84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:43.782836Z","signature_b64":"s95So7tCP2L+R6pUA0RUfene5o4csYeUiJEfiArCfgtnE+m5kHfRHKt49dJ0ic0YIAvuLRdh/1py1gtuzC0PAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e77a6db5fb49d92917d385058b97e7f087f030d9f012ac2a47c6038734dc887","last_reissued_at":"2026-05-18T00:20:43.782142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:43.782142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.ET","cs.SY"],"primary_cat":"quant-ph","authors_text":"Davide Venturelli, Eleanor Rieffel, J. Christopher Beck, Jeremy Frank, Kyle E. C. Booth, Minh Do","submitted_at":"2018-03-19T01:29:02Z","abstract_excerpt":"Recently, the makespan-minimization problem of compiling a general class of quantum algorithms into near-term quantum processors has been introduced to the AI community. The research demonstrated that temporal planning is a strong approach for a class of quantum circuit compilation (QCC) problems. In this paper, we explore the use of constraint programming (CP) as an alternative and complementary approach to temporal planning. We extend previous work by introducing two new problem variations that incorporate important characteristics identified by the quantum computing community. We apply temp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06775","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":"1803.06775","created_at":"2026-05-18T00:20:43.782253+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06775v1","created_at":"2026-05-18T00:20:43.782253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06775","created_at":"2026-05-18T00:20:43.782253+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZ32NW27WSOZ","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZ32NW27WSOZFEL5","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZ32NW27","created_at":"2026-05-18T12:32:56.356000+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/TZ32NW27WSOZFEL5HBIFROL6P4","json":"https://pith.science/pith/TZ32NW27WSOZFEL5HBIFROL6P4.json","graph_json":"https://pith.science/api/pith-number/TZ32NW27WSOZFEL5HBIFROL6P4/graph.json","events_json":"https://pith.science/api/pith-number/TZ32NW27WSOZFEL5HBIFROL6P4/events.json","paper":"https://pith.science/paper/TZ32NW27"},"agent_actions":{"view_html":"https://pith.science/pith/TZ32NW27WSOZFEL5HBIFROL6P4","download_json":"https://pith.science/pith/TZ32NW27WSOZFEL5HBIFROL6P4.json","view_paper":"https://pith.science/paper/TZ32NW27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06775&json=true","fetch_graph":"https://pith.science/api/pith-number/TZ32NW27WSOZFEL5HBIFROL6P4/graph.json","fetch_events":"https://pith.science/api/pith-number/TZ32NW27WSOZFEL5HBIFROL6P4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZ32NW27WSOZFEL5HBIFROL6P4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZ32NW27WSOZFEL5HBIFROL6P4/action/storage_attestation","attest_author":"https://pith.science/pith/TZ32NW27WSOZFEL5HBIFROL6P4/action/author_attestation","sign_citation":"https://pith.science/pith/TZ32NW27WSOZFEL5HBIFROL6P4/action/citation_signature","submit_replication":"https://pith.science/pith/TZ32NW27WSOZFEL5HBIFROL6P4/action/replication_record"}},"created_at":"2026-05-18T00:20:43.782253+00:00","updated_at":"2026-05-18T00:20:43.782253+00:00"}