{"id":"W2951625064","doi":"10.48550/arxiv.0710.5794","title":"Quantum Algorithms for Evaluating MIN-MAX Trees","year":2007,"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":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Bounded function; Quantum; Algorithm; Tree (set theory); Quantum algorithm; Computer science; Mathematics; Discrete mathematics; Combinatorics; Physics; Quantum mechanics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00117773,0.0005525704,0.0005646264,0.0004673622,0.0004364767,0.0002531685,0.002777414,0.0004228388,0.00001042521],"category_scores_gemma":[0.0001322936,0.0005970029,0.0005143484,0.0006985035,0.0001290956,0.0002041286,0.002305674,0.0008522266,0.00003234735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001861104,"about_ca_system_score_gemma":0.000330115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001267073,"about_ca_topic_score_gemma":0.00003067168,"domain_scores_codex":[0.9965585,0.0001640346,0.0003980503,0.00182639,0.0002268367,0.000826114],"domain_scores_gemma":[0.9968215,0.0006261943,0.0004502586,0.001499257,0.0003354134,0.0002673771],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004365057,0.0001443844,0.0001843942,0.0001441325,0.0001541773,0.0002386348,0.0006201508,0.8756193,0.00008059739,0.06700238,0.0005049799,0.05526322],"study_design_scores_gemma":[0.0006492727,0.0002236676,0.0003967276,0.0001631955,0.00006722067,0.00001268636,0.00005262465,0.9295163,0.0001317988,0.06710409,0.001017437,0.0006649715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2096587,0.0001718385,0.787179,0.0001592208,0.001493936,0.0005222177,0.00002925867,0.0004363465,0.0003495069],"genre_scores_gemma":[0.8877209,0.00003834654,0.1104453,0.0001830293,0.0004789438,0.000003064361,0.00003279405,0.00004902903,0.00104861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6780623,"threshold_uncertainty_score":0.9996482,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.108831898960261,"score_gpt":0.2522712761908307,"score_spread":0.1434393772305697,"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."}}