{"id":"W1722831725","doi":"10.1017/cbo9780511808241.012","title":"Recursion on Trees","year":2008,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Recursion (computer science); Computer science; Mathematics; Programming language","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.00003883914,0.0002499257,0.0002138544,0.0002412114,0.0002225081,0.00004847521,0.0005587583,0.0002485508,0.000007510208],"category_scores_gemma":[0.000005425022,0.0002940264,0.0001517556,0.00001096032,0.0001169406,0.0001445316,0.0002244527,0.0003114853,0.00004867453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001696812,"about_ca_system_score_gemma":0.00009640685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000193112,"about_ca_topic_score_gemma":0.000001760714,"domain_scores_codex":[0.9989215,0.0000281324,0.0001269505,0.000485674,0.000271721,0.0001659999],"domain_scores_gemma":[0.9989773,0.00005145828,0.0001598242,0.0005814809,0.000102945,0.0001270137],"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.00001996499,0.000005737119,6.276616e-7,0.000006849034,0.00002497523,0.0001707097,0.00004290183,0.00004393286,0.000006057836,0.9108688,0.0634191,0.02539033],"study_design_scores_gemma":[0.0003322412,0.00006781198,0.00005285838,0.00008868653,0.00001740931,0.00003345378,0.000003289612,0.001365499,0.0001163477,0.000006869455,0.9975963,0.0003192069],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00001151956,0.00002832145,0.03941129,0.00005910817,0.0003594184,0.0001950165,0.00003597809,0.0002784904,0.9596208],"genre_scores_gemma":[0.0006523482,0.0003282834,0.00136481,0.0001311039,0.00005822918,2.280068e-7,0.000018835,0.00001685545,0.9974293],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9341772,"threshold_uncertainty_score":0.9999512,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02249583745029374,"score_gpt":0.1901754652666727,"score_spread":0.167679627816379,"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."}}