{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000493315,0.0002243216,0.0002827558,0.0003304254,0.0002163533,0.000558895,0.0005814659,0.0001022522,0.00001574462],"category_scores_gemma":[0.00004576637,0.0001986373,0.0001618372,0.0003974508,0.0001059456,0.001899659,0.0003268772,0.0002253388,0.00002060997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003804726,"about_ca_system_score_gemma":0.00005567575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001694657,"about_ca_topic_score_gemma":0.00002015215,"domain_scores_codex":[0.9983625,0.00002368317,0.0007121486,0.0002307889,0.0003209361,0.0003499233],"domain_scores_gemma":[0.9990031,0.0002086962,0.0001491647,0.0004230759,0.0001146692,0.0001013373],"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.00004504018,0.000239022,0.003433738,0.002302725,0.0003180376,0.0000168509,0.03681292,0.0002433908,0.0008578907,0.6284856,0.003597545,0.3236473],"study_design_scores_gemma":[0.001082652,0.0003433161,0.001426382,0.0004701237,0.00003887274,0.0001187463,0.0005851778,0.9189724,0.004662583,0.01485202,0.05693542,0.0005122781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1297462,0.0005283824,0.8624513,0.0006089684,0.001608555,0.0006391715,0.0002118022,0.0003514695,0.003854088],"genre_scores_gemma":[0.9636811,0.00009125019,0.0357016,0.0001801937,0.0001095811,0.0000292066,0.00006114789,0.0000154922,0.0001304607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9187291,"threshold_uncertainty_score":0.8100194,"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."}}