{"id":"W2585327097","doi":"10.4086/toc.2016.v012a018","title":"","year":2016,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Mathematics; Computational complexity theory; Quantum algorithm; Communication complexity; Query optimization; Quantum; Bipartite graph; Matching (statistics); Worst-case complexity; Discrete mathematics; Combinatorics; Constructive; Computer science; Algorithm; Graph; Information retrieval","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":[],"consensus_categories":[],"category_scores_codex":[0.002908897,0.0003004644,0.0004724652,0.0002451237,0.000304108,0.00006804696,0.002598698,0.00006988713,0.000002991585],"category_scores_gemma":[0.0003134921,0.0001847208,0.0002108696,0.0005915593,0.0002857735,0.0004050883,0.001309306,0.0001587804,0.000004748299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002691379,"about_ca_system_score_gemma":0.00006945133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005562073,"about_ca_topic_score_gemma":4.320983e-7,"domain_scores_codex":[0.9968143,0.0006019229,0.0007062846,0.0006799301,0.0004753229,0.0007222234],"domain_scores_gemma":[0.9950693,0.002953969,0.0004608235,0.001163262,0.000175884,0.0001767658],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001777891,0.00005017519,0.0008364149,0.00001475243,0.00002653564,0.00001066189,0.002568818,0.002325465,0.02119504,0.3785842,0.000004321988,0.5943658],"study_design_scores_gemma":[0.002063278,0.0005115743,0.03148229,0.0007563701,0.00001147357,0.0001944857,0.0001011089,0.3041096,0.08283204,0.5771609,0.00008114448,0.0006957167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4874739,0.00005431469,0.5109693,0.0008231807,0.0002164485,0.00007175683,6.845062e-7,0.0003155674,0.00007486089],"genre_scores_gemma":[0.869123,0.000002700517,0.130467,0.0002165935,0.0001545198,9.12192e-7,1.321699e-7,0.00001527301,0.00001991422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5936701,"threshold_uncertainty_score":0.7532696,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009925032442266456,"score_gpt":0.2265594615263934,"score_spread":0.216634429084127,"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."}}