{"id":"W2082869103","doi":"10.1145/1125994.1125995","title":"Generating rooted and free plane trees","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Lexicographical order; Bounding overwatch; Mathematics; Plane (geometry); Sequence (biology); Tree (set theory); Amortized analysis; Combinatorics; Centroid; Representation (politics); Weight-balanced tree; Simple (philosophy); Algorithm; Binary search tree; Computer science; Data structure; Binary tree; Artificial intelligence; Geometry","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.0001280899,0.0002155456,0.0002585173,0.0001021219,0.000245694,0.00004997733,0.0002787328,0.0001129597,0.00006190327],"category_scores_gemma":[0.0001785247,0.0002042913,0.00006194398,0.0001845476,0.00005588022,0.0001288536,0.00001247606,0.0002344677,0.00001485531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000502238,"about_ca_system_score_gemma":0.00001683792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005262735,"about_ca_topic_score_gemma":0.0001286107,"domain_scores_codex":[0.9988434,0.00003890948,0.000340253,0.0002638703,0.0002621823,0.0002513991],"domain_scores_gemma":[0.9983813,0.0006345119,0.00009854937,0.0007677011,0.00005199028,0.00006594651],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002179973,0.005589255,0.0001044948,0.0007748018,0.0006767901,0.0002393693,0.002865339,0.01840664,0.03252175,0.3479381,0.00713766,0.5835277],"study_design_scores_gemma":[0.001383159,0.0001523117,0.00007538255,0.00005923239,0.00008122733,0.00005200296,0.0001249522,0.00958358,0.01136578,0.9762267,0.0005547793,0.0003409234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07734287,0.00008169939,0.9201622,0.0004256392,0.0004831683,0.0003158049,0.00005785676,0.0003879878,0.0007427747],"genre_scores_gemma":[0.2577959,0.00001962514,0.7405197,0.00004989524,0.0002581317,0.00006401954,0.000006743639,0.00007233953,0.001213645],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6282886,"threshold_uncertainty_score":0.8330759,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02742443493467967,"score_gpt":0.2827155707507121,"score_spread":0.2552911358160325,"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."}}