{"id":"W2167200109","doi":"10.1109/dcc.2010.67","title":"Optimum String Match Choices in LZSS","year":2010,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Acadia University","funders":"","keywords":"String (physics); Computer science; Set (abstract data type); Compression (physics); Data compression; String searching algorithm; Algorithm; Greedy algorithm; Compression ratio; Mathematics; Artificial intelligence; Engineering; Pattern matching","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.0001296451,0.00005631819,0.00006210044,0.00005364994,0.00003986157,0.0001349925,0.0006757652,0.00003642082,0.00008144778],"category_scores_gemma":[0.000008505771,0.00004303201,0.00001338571,0.000154635,0.00000994837,0.0006485104,0.0003989124,0.0001524176,0.00006507043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004470507,"about_ca_system_score_gemma":0.00001612661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002080288,"about_ca_topic_score_gemma":0.0001073933,"domain_scores_codex":[0.9994271,0.000007763179,0.00009805875,0.0001991685,0.0001171318,0.0001508061],"domain_scores_gemma":[0.9994922,0.00003242968,0.00002120492,0.0003920844,0.00001421436,0.00004786258],"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.000006011463,0.0002689486,0.02500897,0.00002348246,0.000008020964,0.00007341205,0.0005918836,0.0003379668,0.03289592,0.3827369,0.005315481,0.552733],"study_design_scores_gemma":[0.0007758227,0.00004824313,0.0874271,0.0000370116,0.00000133436,0.00002407557,0.00004248138,0.8212479,0.01573342,0.008840092,0.06537472,0.000447815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.265947,0.00002742965,0.7161825,0.0005321881,0.000949604,0.00009248302,0.000001409127,0.000199391,0.01606803],"genre_scores_gemma":[0.6662788,0.000005174772,0.3327522,0.0001342229,0.00008768206,0.000004574176,0.000001630019,0.000003658604,0.0007320563],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8209099,"threshold_uncertainty_score":0.1754794,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009385781601101092,"score_gpt":0.2495336743216183,"score_spread":0.2401478927205172,"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."}}