{"id":"W2037416325","doi":"10.1007/s00026-013-0202-9","title":"Solving Non-Homogeneous Nested Recursions Using Trees","year":2013,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Recursion (computer science); Tree (set theory); Binary tree; Double recursion; Homogeneous; Interpretation (philosophy); Mathematics; Term (time); Combinatorics; Generalization; Set (abstract data type); Discrete mathematics; Algorithm; Computer science; Mathematical analysis; Physics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001488246,0.0007168534,0.001565737,0.000951391,0.001259881,0.00184067,0.002344532,0.001283112,0.005169673],"category_scores_gemma":[0.009240247,0.0007922352,0.001602374,0.001918093,0.001979736,0.00538632,0.003129925,0.002811268,0.001211747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009035945,"about_ca_system_score_gemma":0.001320889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002273954,"about_ca_topic_score_gemma":0.006992562,"domain_scores_codex":[0.9984595,0.0003512138,0.0001380529,0.0003261979,0.0004487376,0.0002763658],"domain_scores_gemma":[0.9929322,0.005444408,0.0002485157,0.0009020592,0.0003263243,0.000146481],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004762531,0.0005245519,0.002700723,0.0008689798,0.0001332888,0.0005601242,0.001502012,0.1583951,0.01636107,0.4204043,0.009814143,0.3882594],"study_design_scores_gemma":[0.00009607668,0.00007905562,0.0001791103,0.00004678547,0.0000609047,0.0001488643,0.000182472,0.5340691,0.009014813,0.4510791,0.005018293,0.00002550535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07373428,0.0003598223,0.9171809,0.0003179882,0.00007633484,0.00008528022,0.000143452,0.001304634,0.006797253],"genre_scores_gemma":[0.3035109,0.0002840118,0.687946,0.0001873862,0.0001100757,0.0001263139,0.0004550211,0.0006633832,0.006716947],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005169673,"threshold_uncertainty_score":0.01729423,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05390717657397869,"score_gpt":0.3014080344625421,"score_spread":0.2475008578885634,"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."}}