{"id":"W2051671786","doi":"10.1007/s00453-012-9664-0","title":"A Uniform Paradigm to Succinctly Encode Various Families of Trees","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"ENCODE; Computer science; Theory of computation; Combinatorics; Weight-balanced tree; Theoretical computer science; Mathematics; Set (abstract data type); Encoding (memory); Tree (set theory); Node (physics); Discrete mathematics; Algorithm; Binary tree; Artificial intelligence; Binary search tree","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.00262214,0.0006580856,0.000669862,0.001741058,0.001513708,0.003610938,0.002506654,0.001554701,0.006094216],"category_scores_gemma":[0.01103849,0.000630903,0.001108058,0.002867509,0.002434594,0.0121867,0.005069341,0.004964617,0.001943149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001258699,"about_ca_system_score_gemma":0.001427198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000476021,"about_ca_topic_score_gemma":0.000978008,"domain_scores_codex":[0.9974979,0.0007214639,0.0003152967,0.0004633089,0.0007964437,0.0002055439],"domain_scores_gemma":[0.9930558,0.001889348,0.0002364084,0.00354517,0.00106549,0.0002078853],"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.00009975905,0.00006374516,0.0001631123,0.0001037155,0.00001268301,0.00005782136,0.0001975099,0.00451955,0.004892642,0.8998586,0.006242144,0.08378867],"study_design_scores_gemma":[0.00003915937,0.00008888903,0.00009818001,0.0001290114,0.00004118574,0.0003060009,0.0001334442,0.05232281,0.0113499,0.8957929,0.03966265,0.00003586061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007867626,0.0004014516,0.9831685,0.001039471,0.0002438006,0.0001130599,0.0003667966,0.0005955286,0.006203713],"genre_scores_gemma":[0.1406565,0.001155138,0.843537,0.001591903,0.0003731883,0.0006716186,0.00145936,0.0007811357,0.009774259],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006094216,"threshold_uncertainty_score":0.02038717,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01263315840486076,"score_gpt":0.2454722923001212,"score_spread":0.2328391338952605,"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."}}