{"id":"W2065457428","doi":"10.5555/365411.365526","title":"Representing dynamic binary trees succinctly","year":2001,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary number; Representation (politics); Amortized analysis; Binary tree; Computer science; Constant (computer programming); Binary search tree; Weight-balanced tree; Contrast (vision); Binary decision diagram; Theoretical computer science; Data structure; Binary expression tree; Discrete mathematics; Combinatorics; Mathematics; Algorithm; Arithmetic; Programming language; Artificial intelligence","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.0004599627,0.0005121236,0.0006743884,0.001185165,0.0004378463,0.002052658,0.001149252,0.0007765234,0.005304078],"category_scores_gemma":[0.004316065,0.0004483353,0.0003707822,0.002389089,0.0006269873,0.005570316,0.00155849,0.00116913,0.001402972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005027233,"about_ca_system_score_gemma":0.0006249934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008382985,"about_ca_topic_score_gemma":0.001507641,"domain_scores_codex":[0.9993864,0.0001099433,0.00006872541,0.00009960464,0.0002511733,0.00008410533],"domain_scores_gemma":[0.9983245,0.0005222128,0.0002045011,0.0006304207,0.000266469,0.00005195643],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005159394,0.0001816525,0.0008664461,0.000458428,0.00003723698,0.0004805847,0.0005526115,0.1099977,0.02698209,0.3071435,0.01678331,0.5360004],"study_design_scores_gemma":[0.0001070725,0.0002249418,0.0004094563,0.0002359103,0.0000767809,0.0006428988,0.0002183641,0.5073244,0.03796189,0.3745672,0.07813842,0.00009271141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03394069,0.0008186998,0.9535469,0.0005252912,0.0002116448,0.0001142403,0.002101295,0.001963726,0.006777428],"genre_scores_gemma":[0.4157247,0.002168889,0.5619731,0.0004637701,0.000205945,0.0004286465,0.005809353,0.0006279455,0.01259766],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005304078,"threshold_uncertainty_score":0.01774389,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01167444419750935,"score_gpt":0.2667827410708196,"score_spread":0.2551082968733102,"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."}}