{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005322043,0.000958806,0.001751635,0.001509569,0.002774163,0.004457594,0.003549094,0.003148264,0.01210118],"category_scores_gemma":[0.029938,0.0006441615,0.001778557,0.002294759,0.005927725,0.01567264,0.005344336,0.006159892,0.001906914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004537964,"about_ca_system_score_gemma":0.003215154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004031899,"about_ca_topic_score_gemma":0.00237021,"domain_scores_codex":[0.9927665,0.002358818,0.0002706015,0.00148751,0.002178508,0.0009379108],"domain_scores_gemma":[0.9751634,0.01613993,0.001137117,0.004545616,0.002155278,0.0008586185],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003757276,0.00002780686,0.000274647,0.00003583721,0.00001549964,0.00002954339,0.00008935134,0.00616566,0.0005830475,0.9818456,0.003286742,0.007608692],"study_design_scores_gemma":[0.00001793235,0.00003843248,0.0001762567,0.00001361374,0.00001190719,0.00007703598,0.00005000084,0.07287943,0.0008829473,0.9199967,0.005836365,0.00001951705],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.02724903,0.0007584311,0.932869,0.006330095,0.000297403,0.00019288,0.0004313542,0.0003259925,0.03154577],"genre_scores_gemma":[0.755672,0.001291989,0.2194362,0.002988987,0.00083288,0.0006053347,0.0008742954,0.0003580835,0.01794029],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9878988,"threshold_uncertainty_score":0,"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."}}