{"id":"W2623901742","doi":"10.4230/lipics.stacs.2011.661","title":"Quantum query complexity of minor-closed graph properties","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Minor (academic); Computer science; Graph; Quantum; Theoretical computer science; Mathematics; Physics; Quantum mechanics; Philosophy; Humanities","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000317399,0.000436388,0.0005923487,0.0003860288,0.0002162255,0.0001062312,0.002905184,0.0003940556,0.00001318213],"category_scores_gemma":[0.0000390337,0.0004227652,0.0003991195,0.0005898436,0.0006718836,0.0001753295,0.002853767,0.001324872,0.00002117305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004610783,"about_ca_system_score_gemma":0.0002805036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007280062,"about_ca_topic_score_gemma":0.00009886492,"domain_scores_codex":[0.9976497,0.0002045927,0.0003421403,0.001173593,0.0001713736,0.0004586003],"domain_scores_gemma":[0.9972717,0.00008505973,0.0004614641,0.001744675,0.0002517073,0.0001854516],"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.00009979657,0.0006418115,0.002450933,0.0008356711,0.0003307053,0.0004217704,0.001872267,0.3769687,0.003625291,0.6081787,0.0003833135,0.004191064],"study_design_scores_gemma":[0.0003173431,0.00007804186,0.002535684,0.0001806193,0.00003560321,0.00001026194,0.00003311733,0.8744417,0.001386545,0.1203298,0.0001589506,0.0004923482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7694726,0.00009234399,0.2283607,0.000170817,0.0009728849,0.000250937,0.00001976925,0.0002787364,0.0003812738],"genre_scores_gemma":[0.9919185,0.00003471522,0.007628272,0.00006056284,0.0001101389,6.418011e-7,0.000009115842,0.00002150499,0.000216537],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.497473,"threshold_uncertainty_score":0.9998224,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08411088116472523,"score_gpt":0.1866573141472123,"score_spread":0.1025464329824871,"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."}}