{"id":"W2008594023","doi":"10.1109/isita.2010.5649565","title":"Using synchronization bits to boost compression by substring enumeration","year":2010,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Lossless compression; Computer science; Enumeration; Byte; Synchronization (alternating current); Binary number; Algorithm; Preprocessor; Data compression; Simple (philosophy); Data structure; Theoretical computer science; Mathematics; Arithmetic; Artificial intelligence; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001245171,0.0001023551,0.00008474167,0.00007712399,0.0002468915,0.0002756178,0.0004325009,0.00006358102,0.00005699431],"category_scores_gemma":[0.00002459672,0.00008685315,0.00001714971,0.0002870226,0.000009721655,0.0009786639,0.0003223583,0.000123458,0.00005161906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002212729,"about_ca_system_score_gemma":0.00003052002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001065771,"about_ca_topic_score_gemma":0.00001729173,"domain_scores_codex":[0.9990776,0.00002308815,0.0001638952,0.0003169614,0.0002360617,0.0001824567],"domain_scores_gemma":[0.9992956,0.00002708397,0.0000535262,0.0004201903,0.00008081071,0.0001227859],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002697475,0.00004948441,0.0008090841,0.00000516746,0.000002784251,0.000001898881,0.0001389353,0.001186861,0.8978526,0.005578913,0.007238613,0.08713298],"study_design_scores_gemma":[0.0001620329,0.0000220691,0.000465176,0.00002458107,0.000001858805,0.000008370763,0.000005579793,0.8867617,0.0984944,0.0001318109,0.01375195,0.0001704392],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07233419,0.00002182709,0.9260376,0.0001874709,0.0006174016,0.0001309053,0.000005378036,0.0001473138,0.0005179183],"genre_scores_gemma":[0.7575659,0.000002353273,0.2419499,0.0001886457,0.0001070369,0.000003525092,0.00003684216,0.000007806763,0.0001380025],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8855749,"threshold_uncertainty_score":0.3541768,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0169993740333941,"score_gpt":0.2740995600223278,"score_spread":0.2571001859889337,"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."}}