{"id":"W2009268872","doi":"10.1109/dcc.2014.68","title":"Improving Compression via Substring Enumeration by Explicit Phase Awareness","year":2014,"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":"","keywords":"Lossless compression; Substring; Computer science; Compression (physics); Data compression; Byte; Algorithm; Synchronization (alternating current); Enumeration; Code (set theory); Universal code; Phase (matter); Compression ratio; Theoretical computer science; Mathematics; Data structure; Decoding methods; Block code; Discrete mathematics; Programming language; Linear code; Telecommunications","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002282236,0.0001440753,0.0001433817,0.00005758792,0.0002989869,0.0002580444,0.0006454716,0.00006036114,0.00003209568],"category_scores_gemma":[0.00001837623,0.0001162451,0.00003423559,0.0001558945,0.00001049532,0.001193398,0.0003871699,0.000101873,0.00003919651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002190945,"about_ca_system_score_gemma":0.00001812256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002688527,"about_ca_topic_score_gemma":0.000004164886,"domain_scores_codex":[0.9987661,0.00006429113,0.0002273623,0.0004313845,0.0002678076,0.0002430334],"domain_scores_gemma":[0.9990496,0.00007309209,0.0001030417,0.0006011109,0.00005664952,0.0001165064],"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.000006122216,0.0001243931,0.000190731,0.00001151548,0.000003059106,0.000001372998,0.00008929514,0.00008682947,0.3048711,0.003606518,0.003193996,0.687815],"study_design_scores_gemma":[0.0006932009,0.00006460716,0.00005606191,0.00001887926,0.000002088482,0.000004059855,0.000006497431,0.8727692,0.1171968,0.0002987606,0.008717602,0.0001722093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02735126,0.00006142397,0.9713699,0.00009752508,0.0003460865,0.0001013037,0.000004212481,0.0002636079,0.0004046666],"genre_scores_gemma":[0.9483111,0.000005276861,0.05112509,0.0001731593,0.0001257052,0.00001544178,0.00007214054,0.00001019517,0.000161896],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9209598,"threshold_uncertainty_score":0.4740337,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0118491525656889,"score_gpt":0.2620469084618924,"score_spread":0.2501977558962035,"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."}}