{"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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001571988,0.0001477981,0.0003226897,0.0003431274,0.0002784139,0.0002117355,0.009374331,0.00008355498,0.000003240215],"category_scores_gemma":[0.0001398473,0.0001274171,0.00006784726,0.0003396444,0.00006479067,0.001746409,0.001653103,0.0002710315,0.000003833911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001025293,"about_ca_system_score_gemma":0.0004587396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004092776,"about_ca_topic_score_gemma":0.00001031069,"domain_scores_codex":[0.9970122,0.000517474,0.001041705,0.0002315904,0.00104687,0.0001501839],"domain_scores_gemma":[0.9929163,0.00058157,0.001110327,0.002694005,0.002558677,0.0001391647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001558713,0.01011473,0.03371621,0.0002131124,0.00234548,0.00005661765,0.04359258,0.4262764,0.2464624,0.09848167,0.08484215,0.05233996],"study_design_scores_gemma":[0.001280564,0.0001788376,0.007347121,0.0006627896,0.00001415682,0.0001694926,0.0005023492,0.9772295,0.001121419,0.000081699,0.01125219,0.000159914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.242884,0.006428878,0.7485113,0.0009829511,0.0006095393,0.0003320188,0.00006151108,0.00006772515,0.0001220571],"genre_scores_gemma":[0.7825682,0.001279862,0.2158049,0.00003220417,0.0001199534,0.000003895811,0.0001621031,0.00001306898,0.00001586027],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5509531,"threshold_uncertainty_score":0.9959854,"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."}}