{"id":"W4232286640","doi":"10.1002/dac.943","title":"An efficient compression scheme for data communication which uses a new family of self‐organizing binary search trees","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Instituto de Sistemas Complejos de Ingeniería","keywords":"Computer science; Decoding methods; Huffman coding; Binary tree; Fano plane; Algorithm; Binary number; Coding (social sciences); Encoding (memory); Theoretical computer science; Data compression; Tree (set theory); Adaptive coding; Lossless compression; Tree structure; Artificial intelligence; Mathematics; Arithmetic","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":true,"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.0004579738,0.0002616901,0.0002878793,0.00108582,0.000426495,0.0005616969,0.0007245091,0.0003860756,0.001205089],"category_scores_gemma":[0.002108997,0.0001272425,0.0002059556,0.001481265,0.0004835561,0.001382236,0.0005210787,0.0004634733,0.0003503409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004368078,"about_ca_system_score_gemma":0.000535202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001170155,"about_ca_topic_score_gemma":0.001379326,"domain_scores_codex":[0.9997146,0.00006138947,0.00002344899,0.00003988416,0.0001324136,0.00002830223],"domain_scores_gemma":[0.9990342,0.0003571949,0.00007863104,0.0002482476,0.0002452216,0.00003659132],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003322446,0.0001343057,0.001467855,0.0002276824,0.00004179029,0.0002381597,0.0003629324,0.1009888,0.0751057,0.08999019,0.007998921,0.7231116],"study_design_scores_gemma":[0.00005725001,0.000215515,0.0009319938,0.00004169275,0.00002967101,0.0004623141,0.00009325708,0.8952178,0.05143376,0.03612883,0.01534184,0.00004603538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07474329,0.000679881,0.9194657,0.0002380608,0.0001015733,0.0001389958,0.0002078111,0.000967166,0.00345751],"genre_scores_gemma":[0.4859198,0.0004787145,0.5097822,0.0001852761,0.00007458441,0.0001941391,0.0004980051,0.0001124951,0.002754723],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001205089,"threshold_uncertainty_score":0.00403142,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1167425421150749,"score_gpt":0.3615014230712698,"score_spread":0.2447588809561949,"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."}}