{"id":"W3099748545","doi":"","title":"Quantum query complexity of minor-closed graph properties","year":2011,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minor (academic); Mathematics; Combinatorics; Upper and lower bounds; Vertex (graph theory); Graph; Quantum; Graph minor; Planar graph; Discrete mathematics; Line graph; Graph power; Physics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002006551,0.0001486308,0.0002188314,0.0001198992,0.00009628748,0.00003093674,0.0008982786,0.00004447169,0.00003329298],"category_scores_gemma":[0.00001636763,0.0001035812,0.0001082894,0.000306116,0.0002550113,0.0001433545,0.0002998444,0.0001230936,0.00002105522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000586547,"about_ca_system_score_gemma":0.00004608225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006350618,"about_ca_topic_score_gemma":0.00002284392,"domain_scores_codex":[0.9988525,0.00007230883,0.0002744164,0.000309292,0.0002209154,0.000270548],"domain_scores_gemma":[0.9991481,0.00002556485,0.0001022011,0.0005570211,0.00008713682,0.00007999429],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000390137,0.0005987868,0.002653657,0.0001481169,0.00008519395,0.00003121216,0.009956727,0.0001504799,0.007074267,0.9159299,0.001033062,0.06229965],"study_design_scores_gemma":[0.0006238304,0.0005819282,0.04163421,0.0001173641,0.00001229851,0.00004968876,0.0001756494,0.7146604,0.06665484,0.1742381,0.0005954645,0.0006562612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6690616,0.0001599104,0.321332,0.0003122621,0.0003921705,0.0001575463,0.000001899267,0.000350391,0.00823217],"genre_scores_gemma":[0.8883931,0.000002697959,0.1113198,0.0001367704,0.00002837367,0.000002648383,4.36247e-7,0.000006588549,0.0001095349],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7416918,"threshold_uncertainty_score":0.4223917,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07387360906020861,"score_gpt":0.226500688925899,"score_spread":0.1526270798656904,"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."}}