{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006444901,0.00006244124,0.0001232063,0.00003561711,0.00005464012,0.00002981787,0.000514036,0.00001967945,0.00006064728],"category_scores_gemma":[0.00000612295,0.00004178295,0.00003867726,0.0001206623,0.00004424865,0.0003557248,0.0001310644,0.00003964624,0.000006067495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004512731,"about_ca_system_score_gemma":0.00001251018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004461096,"about_ca_topic_score_gemma":0.000003409021,"domain_scores_codex":[0.9994463,0.00002374131,0.0001317404,0.0001478598,0.000146037,0.0001043104],"domain_scores_gemma":[0.9995078,0.0000247685,0.00004376793,0.0003524305,0.00003016278,0.00004101721],"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.000102733,0.0001292988,0.000682411,0.000009080378,0.00001483326,0.00001977867,0.0004290072,0.0003553104,0.0153312,0.5604856,0.01119852,0.4112422],"study_design_scores_gemma":[0.001807427,0.0002953087,0.1822955,0.0000177926,0.000003143341,0.00001601217,0.00001552607,0.7355028,0.00643169,0.07247577,0.0009468571,0.000192184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2377068,0.000186293,0.751794,0.001391491,0.0002752349,0.0001373587,0.000008758633,0.0002009065,0.008299218],"genre_scores_gemma":[0.8880209,0.000003256129,0.1117079,0.0001391692,0.00002370759,3.013303e-7,0.000004461811,9.557766e-7,0.00009937876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7351475,"threshold_uncertainty_score":0.1703859,"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."}}