{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001768231,0.0001439552,0.0002231109,0.0001264973,0.0001780744,0.0001220612,0.0009015128,0.00008129809,0.00001978893],"category_scores_gemma":[0.00006465039,0.0001286533,0.00008278473,0.00052727,0.00003782048,0.0008279769,0.0004845446,0.0001134208,0.00003264843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001211641,"about_ca_system_score_gemma":0.0000697985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002318973,"about_ca_topic_score_gemma":0.000001248979,"domain_scores_codex":[0.9987519,0.00004729964,0.0002944277,0.0002679234,0.0003248864,0.000313512],"domain_scores_gemma":[0.9984302,0.0001176688,0.0001846868,0.0007063678,0.000416508,0.0001445683],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002636249,0.002909859,0.01033389,0.0002226583,0.00023838,0.000172723,0.003466761,0.003330357,0.05248814,0.4726822,0.1389445,0.3151841],"study_design_scores_gemma":[0.0006512203,0.0004461179,0.01630679,0.0002860642,0.00001659598,0.00005192243,0.00009408804,0.7788288,0.0381397,0.1574694,0.006997081,0.0007122586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6474295,0.0009997489,0.3469496,0.001080708,0.001415791,0.0003413557,0.000007241327,0.000164769,0.001611258],"genre_scores_gemma":[0.9884163,0.0001231211,0.01109871,0.0001957831,0.00003755519,0.000006169368,0.000004282524,0.00001207927,0.0001060173],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7754984,"threshold_uncertainty_score":0.524633,"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."}}