{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007480205,0.0005775666,0.0007165208,0.001266881,0.0003544206,0.0006021395,0.0009040539,0.0005055192,0.001539476],"category_scores_gemma":[0.005876318,0.0002548013,0.0002339158,0.001889268,0.0007415324,0.002019652,0.000996575,0.0008036366,0.0005319673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002491109,"about_ca_system_score_gemma":0.000396509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003002509,"about_ca_topic_score_gemma":0.0004269555,"domain_scores_codex":[0.9993675,0.0001037327,0.00006103157,0.0000855574,0.0003344543,0.00004772707],"domain_scores_gemma":[0.9965765,0.001874899,0.0003063918,0.0008124116,0.0003672706,0.00006254928],"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.001068161,0.0001893727,0.002032259,0.000270436,0.0000538104,0.0002829156,0.0002207154,0.03266768,0.2200747,0.02171332,0.002308045,0.7191185],"study_design_scores_gemma":[0.0001568667,0.0009543155,0.002942122,0.00005772417,0.00009341836,0.001369072,0.00009354798,0.4288524,0.5333312,0.01966703,0.01241182,0.00007053518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1813132,0.001330762,0.8119593,0.0004332523,0.0001605288,0.00007951472,0.0001129021,0.002498309,0.002112292],"genre_scores_gemma":[0.5598602,0.0006477076,0.4357698,0.0002895383,0.0002173187,0.00008186436,0.0004369092,0.000230118,0.002466536],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001539476,"threshold_uncertainty_score":0.00515002,"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."}}