{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007388066,0.0005347111,0.000617834,0.0004060795,0.0008887271,0.0007778805,0.0004543969,0.0003601575,0.00002290595],"category_scores_gemma":[0.0001037217,0.0006659477,0.0001466475,0.0004373621,0.0009241884,0.000802446,0.0008020316,0.0005609329,0.000004467865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002008658,"about_ca_system_score_gemma":0.0002629416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001148831,"about_ca_topic_score_gemma":0.00009133834,"domain_scores_codex":[0.9969962,0.000180631,0.0005640485,0.001614988,0.0001179214,0.0005262617],"domain_scores_gemma":[0.9976269,0.000350014,0.0007590835,0.0004821109,0.0004589842,0.0003228892],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001483099,0.0001084151,0.4978632,0.0005365661,0.0002379577,0.00005448695,0.005058985,0.0422704,0.00006082419,0.4171734,0.00004450466,0.03644294],"study_design_scores_gemma":[0.001273114,0.0002186264,0.01982038,0.0006272431,0.0001243061,0.00005015209,0.001775649,0.963885,0.00001981201,0.01120797,0.0003270067,0.0006707557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2833126,0.00005561138,0.7144297,0.00006185038,0.0005226976,0.0009027125,0.00002049394,0.0001520067,0.0005422904],"genre_scores_gemma":[0.9791138,0.00005816588,0.02048342,0.00004287272,0.0001138919,0.000003876649,0.00007589315,0.00002527754,0.00008280222],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9216146,"threshold_uncertainty_score":0.9995792,"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."}}