{"id":"W2034468591","doi":"10.1080/01966324.2000.10737507","title":"Loop Free Generation of<i>K</i>-Ary Trees","year":2000,"lang":"en","type":"article","venue":"American Journal of Mathematical and Management Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Loop (graph theory); Listing (finance); Recursion (computer science); Representation (politics); Tree (set theory); Object (grammar); String (physics); Weight-balanced tree; Computer science; Algorithm; Combinatorics; Discrete mathematics; Mathematics; Theoretical computer science; Binary tree; Binary search tree","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.0005330656,0.00006692703,0.0001817161,0.00009335962,0.00009071198,0.00008305121,0.0007382673,0.000007426564,0.00007834777],"category_scores_gemma":[0.00001811532,0.00004147892,0.00003976258,0.0003046399,0.000364851,0.0005278222,0.0001638987,0.00003943966,0.000004465235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003733981,"about_ca_system_score_gemma":0.00001421745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004465398,"about_ca_topic_score_gemma":4.731801e-7,"domain_scores_codex":[0.9990225,0.00003879299,0.0002946185,0.0001301398,0.0003992291,0.0001147057],"domain_scores_gemma":[0.9994482,0.00006029304,0.0001943405,0.0001852686,0.00002789871,0.000084028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005741296,0.000118177,0.00005334569,0.0000232787,0.00002204224,0.00001396199,0.0002329099,0.000162884,0.000162478,0.102833,0.002127439,0.8942447],"study_design_scores_gemma":[0.002271267,0.006500243,0.009102059,0.0009573822,0.0001913071,0.0006151615,0.002167274,0.53931,0.002866526,0.4168804,0.01815597,0.0009823991],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.334987,0.0003193225,0.6531118,0.002318122,0.000103764,0.00009945495,0.00000166466,0.00001705845,0.009041877],"genre_scores_gemma":[0.4238677,0.001070987,0.5742401,0.0003931673,0.00008188974,0.000002005282,2.589365e-7,0.000003261287,0.0003406453],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8932623,"threshold_uncertainty_score":0.1691461,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02232322074684773,"score_gpt":0.2547044051874919,"score_spread":0.2323811844406442,"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."}}