{"id":"W6966814896","doi":"10.4230/lipics.aofa.2024.2","title":"Enumeration and Succinct Encoding of AVL Trees","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Enumeration; Tree (set theory); Class (philosophy); Node (physics); Encoding (memory); Variety (cybernetics); Upper and lower bounds; Constant (computer programming)","routes":{"ca_aff":true,"ca_fund":true,"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.00118478,0.0004266863,0.0006548146,0.001327744,0.0007797754,0.002846521,0.001727954,0.0008482634,0.004053609],"category_scores_gemma":[0.009143907,0.0005704383,0.0007224462,0.002183315,0.001685401,0.006773086,0.003260871,0.002088986,0.001289918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001895698,"about_ca_system_score_gemma":0.001312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008173204,"about_ca_topic_score_gemma":0.00168684,"domain_scores_codex":[0.9982902,0.0003786132,0.0001401543,0.0002601277,0.0006552877,0.0002755208],"domain_scores_gemma":[0.9928235,0.002884342,0.0005959693,0.002676487,0.0008131276,0.0002066293],"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.000348338,0.0001929511,0.001837724,0.0002439963,0.00002190046,0.0002591449,0.0007391108,0.05853947,0.02558515,0.7519184,0.009834553,0.1504793],"study_design_scores_gemma":[0.00005513782,0.00008522657,0.000352317,0.00008960914,0.00002499306,0.0002449665,0.0001757035,0.3161087,0.0262704,0.6429818,0.01356263,0.00004853753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1185668,0.0003616142,0.8642323,0.001146059,0.0001155986,0.00009922597,0.001495312,0.002270659,0.01171249],"genre_scores_gemma":[0.6523321,0.0003703947,0.3360279,0.0004632962,0.0001136904,0.0003309989,0.00303389,0.0006450205,0.006682759],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004053609,"threshold_uncertainty_score":0.01375431,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01592361490010857,"score_gpt":0.2583559842509671,"score_spread":0.2424323693508585,"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."}}