{"id":"W2110940943","doi":"10.1109/isit.2009.5205704","title":"Structural complexity of random binary trees","year":2009,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Tree (set theory); Binary number; Computer science; Discrete mathematics; Mathematics; Arithmetic","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.001527576,0.0004436433,0.001070032,0.002282016,0.001266558,0.003347115,0.00156983,0.001572061,0.006033762],"category_scores_gemma":[0.01720434,0.0006603543,0.000914805,0.001397379,0.002370871,0.005823942,0.002216485,0.001935093,0.0007441598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002879794,"about_ca_system_score_gemma":0.0009918413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001378668,"about_ca_topic_score_gemma":0.001506224,"domain_scores_codex":[0.9977781,0.0005820201,0.0001142872,0.0004441334,0.0007158328,0.0003656529],"domain_scores_gemma":[0.9852548,0.009910733,0.001658804,0.001188592,0.0008915871,0.001095607],"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.0002601609,0.00006460201,0.00506868,0.0002361374,0.00006232625,0.0002044123,0.0006180027,0.07177389,0.003332228,0.8982456,0.00477748,0.01535657],"study_design_scores_gemma":[0.00002310841,0.00003041007,0.002315669,0.00003017439,0.00001506134,0.0001625485,0.00008658356,0.175404,0.0008408493,0.8195606,0.001504468,0.00002657092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7640323,0.001659467,0.1925777,0.005321342,0.0001042591,0.0001042874,0.003073025,0.0004469534,0.0326807],"genre_scores_gemma":[0.9760183,0.0006133691,0.01488722,0.0003567723,0.0001832021,0.0001830048,0.001730007,0.0001398305,0.005888305],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006033762,"threshold_uncertainty_score":0.02089453,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03670641564302513,"score_gpt":0.2715687901565743,"score_spread":0.2348623745135492,"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."}}