{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004101302,0.0003195416,0.0004666303,0.0007184719,0.0005652956,0.001150443,0.0009321669,0.000491358,0.004263999],"category_scores_gemma":[0.003256957,0.0002335125,0.0003835056,0.0009074554,0.0005543544,0.001510479,0.001092369,0.0003986822,0.001167893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005235429,"about_ca_system_score_gemma":0.0004427596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008064129,"about_ca_topic_score_gemma":0.001088878,"domain_scores_codex":[0.9993829,0.0001236133,0.00006390543,0.00009509267,0.0002169442,0.0001176207],"domain_scores_gemma":[0.9982793,0.0007079004,0.0001875113,0.0004388974,0.0003233123,0.00006305754],"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.001142408,0.0002018639,0.003492025,0.000501463,0.00004789009,0.0006810186,0.0005030393,0.085076,0.08348174,0.1168011,0.01991918,0.6881523],"study_design_scores_gemma":[0.0002416863,0.000429983,0.001974006,0.00009589588,0.00006487,0.000908053,0.0001657158,0.6367583,0.112342,0.2157101,0.03122936,0.00008003558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1634414,0.0003770915,0.8171808,0.0003207821,0.0001005136,0.0001781185,0.000729888,0.005552926,0.01211847],"genre_scores_gemma":[0.5136606,0.0001535746,0.4749618,0.0001808185,0.00004430455,0.0001304687,0.001711055,0.000636509,0.008520844],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004263999,"threshold_uncertainty_score":0.01426446,"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."}}