{"id":"W2103473460","doi":"10.1137/110833026","title":"Quantum Query Complexity of Minor-Closed Graph Properties","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minor (academic); Mathematics; Combinatorics; Vertex (graph theory); Upper and lower bounds; Graph; Discrete mathematics; Quantum; Planar graph; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002637904,0.0006418545,0.001738177,0.0009752208,0.001610676,0.003374288,0.00292992,0.001791263,0.006519342],"category_scores_gemma":[0.02119683,0.000610227,0.001625798,0.001939957,0.002651479,0.009228634,0.003037374,0.003210663,0.0004962561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003161257,"about_ca_system_score_gemma":0.002408905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003390336,"about_ca_topic_score_gemma":0.003149214,"domain_scores_codex":[0.9961979,0.0009321015,0.0001896157,0.000851468,0.0009664309,0.0008624251],"domain_scores_gemma":[0.9633814,0.02906673,0.001647247,0.004126821,0.0009744458,0.0008033987],"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.002866623,0.0007113712,0.009119654,0.0008539615,0.0003118558,0.0004805618,0.0009553094,0.4459418,0.03021943,0.4063373,0.01431877,0.08788344],"study_design_scores_gemma":[0.00009873712,0.00008934987,0.0008977951,0.00001608366,0.00005556713,0.0001698792,0.0001354223,0.7098543,0.005019478,0.2822795,0.001354997,0.00002892831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5206147,0.0008327825,0.4548161,0.004973812,0.0001156643,0.0003963701,0.002184413,0.0016501,0.01441597],"genre_scores_gemma":[0.9454917,0.0003619976,0.05004472,0.0003394215,0.0001058102,0.0001756094,0.001178284,0.0002334546,0.002068944],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006519342,"threshold_uncertainty_score":0.02293658,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04791838239550129,"score_gpt":0.2581324715016704,"score_spread":0.2102140891061691,"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."}}