{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001392602,0.0002899232,0.0004398166,0.0003178843,0.0005443991,0.0001863434,0.001109301,0.00007814611,0.000007476374],"category_scores_gemma":[0.00009868744,0.0002184653,0.0002685583,0.0005096678,0.0001912062,0.0003337175,0.0003779848,0.0007690401,0.00002185581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004784831,"about_ca_system_score_gemma":0.00009104712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001838437,"about_ca_topic_score_gemma":6.382622e-7,"domain_scores_codex":[0.9972728,0.000335141,0.0006866634,0.0002928835,0.0006344419,0.000778012],"domain_scores_gemma":[0.998287,0.0002044805,0.0005647287,0.0004584461,0.0001805112,0.0003048899],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002019218,0.00293792,0.02417894,0.0005570523,0.0005788146,0.0002116088,0.02620199,0.07533918,0.02091299,0.3346405,0.003642243,0.5105968],"study_design_scores_gemma":[0.00110604,0.0007391336,0.03580104,0.0009199399,0.00002208336,0.001411926,0.0002032021,0.9355087,0.008721785,0.01317015,0.001599161,0.0007968922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7788535,0.000806064,0.2171264,0.0006930563,0.001861854,0.0001051007,0.000001121709,0.0001375759,0.0004153164],"genre_scores_gemma":[0.9574088,0.000009074587,0.04131626,0.0003250365,0.0009040613,4.781934e-7,5.581801e-7,0.00001959326,0.00001610776],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8601695,"threshold_uncertainty_score":0.8908756,"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."}}