{"id":"W4297336581","doi":"10.48550/arxiv.1803.06775","title":"Comparing and Integrating Constraint Programming and Temporal Planning\\n for Quantum Circuit Compilation","year":2018,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Advanced Exploration Systems; National Aeronautics and Space Administration","keywords":"Computer science; Satisficing; Time horizon; Task (project management); Constraint (computer-aided design); Constraint programming; Class (philosophy); Quantum; Mathematical optimization; Baseline (sea); Job shop scheduling; Artificial intelligence; Mathematics; Routing (electronic design automation)","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003027396,0.000907183,0.0006414766,0.001075049,0.000726707,0.001927557,0.001731958,0.001030695,0.004536386],"category_scores_gemma":[0.01399402,0.0004733237,0.0008033679,0.002165445,0.001265513,0.002977084,0.002017925,0.002470803,0.0003531735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002156203,"about_ca_system_score_gemma":0.004203403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01953162,"about_ca_topic_score_gemma":0.03523722,"domain_scores_codex":[0.9974952,0.001158459,0.0001141232,0.0003493655,0.0006299644,0.0002529092],"domain_scores_gemma":[0.9903796,0.007680235,0.0002515631,0.0009100405,0.0005253226,0.0002531744],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000380233,0.0002740458,0.002256312,0.0005188112,0.0001241657,0.00007428385,0.0002354164,0.6755533,0.001931447,0.0439626,0.005074463,0.269615],"study_design_scores_gemma":[0.00003407399,0.0001073144,0.000369563,0.00004012512,0.00003382462,0.00002436347,0.0001046927,0.9784662,0.001537208,0.01518652,0.004081505,0.00001466876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1758941,0.00500478,0.7719834,0.002899937,0.0003566638,0.0003316852,0.0004324753,0.003735475,0.0393615],"genre_scores_gemma":[0.5500259,0.00148459,0.4429615,0.0005179213,0.00009771506,0.000204358,0.0005436303,0.0008259468,0.003338384],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01953162,"threshold_uncertainty_score":0.03883582,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1411671498380723,"score_gpt":0.2275043781560747,"score_spread":0.08633722831800242,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}