{"id":"W1765644073","doi":"10.1007/978-3-540-69903-3_17","title":"A Uniform Approach Towards Succinct Representation of Trees","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Representation (politics); Binary tree; Theoretical computer science; Entropy (arrow of time); Set (abstract data type); Algorithm; Mathematics; Discrete mathematics","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.001786079,0.001221482,0.001348502,0.002548469,0.0009349599,0.004787704,0.004567907,0.001864788,0.01143975],"category_scores_gemma":[0.009306332,0.001121316,0.001793441,0.004698448,0.002005194,0.01115249,0.006466136,0.005786037,0.005196704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001061996,"about_ca_system_score_gemma":0.001148751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008029626,"about_ca_topic_score_gemma":0.001207234,"domain_scores_codex":[0.9966443,0.0006834582,0.0004663147,0.000551699,0.001457487,0.0001968915],"domain_scores_gemma":[0.9944819,0.001230929,0.0001708086,0.00301982,0.0009349256,0.000161668],"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.0001097987,0.00007572219,0.0001366318,0.0003946502,0.00003395885,0.0001252364,0.0003072683,0.01403931,0.009153505,0.7328016,0.01304436,0.2297779],"study_design_scores_gemma":[0.00003589109,0.00007114281,0.00009903819,0.0001957427,0.00005614126,0.0004222338,0.00009899135,0.09273753,0.01312798,0.8320723,0.06103357,0.00004946078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001151304,0.0003660665,0.9940907,0.0001993258,0.0001154847,0.00005763822,0.0002158192,0.00064412,0.00315954],"genre_scores_gemma":[0.03540614,0.001624467,0.9501581,0.0004890595,0.0002984769,0.0003569137,0.001598198,0.0008193721,0.009249158],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01143975,"threshold_uncertainty_score":0.03826976,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02773717381977151,"score_gpt":0.2614565415251866,"score_spread":0.2337193677054151,"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."}}