{"id":"W2102525660","doi":"10.1109/isit.2008.4595134","title":"Improving LZ77 bit recycling using all matches","year":2008,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Lossless compression; Redundancy (engineering); Computer science; Bit (key); Exploit; Algorithm; Data compression; Multiplicity (mathematics); Mathematics; Computer network; Operating system","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.0001316953,0.00009645061,0.0001045261,0.00005912162,0.0002065762,0.00009559065,0.0005441591,0.00004308686,0.0000236512],"category_scores_gemma":[0.00001662939,0.00007690541,0.0000379286,0.0001520709,0.00001427633,0.0008239461,0.0005160937,0.00008863277,0.00004442644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004647682,"about_ca_system_score_gemma":0.00004421926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000805632,"about_ca_topic_score_gemma":0.000005563111,"domain_scores_codex":[0.9990928,0.00001957755,0.0001646059,0.0003040838,0.0001852673,0.0002336994],"domain_scores_gemma":[0.9993261,0.00004126989,0.00006067938,0.000462242,0.00003214153,0.00007761706],"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.00002002127,0.000353385,0.005302148,0.00008501727,0.00007484854,0.0006263298,0.004005808,0.002831736,0.2565753,0.01316355,0.01395477,0.7030071],"study_design_scores_gemma":[0.000160477,0.00002059208,0.0003343348,0.00001946601,0.000002661913,0.0001309083,0.00001926773,0.9829337,0.0107711,0.0005740291,0.004834013,0.0001994276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08437502,0.00008644245,0.9139402,0.0001977206,0.0002698005,0.0000496532,7.361826e-7,0.0002102258,0.0008701944],"genre_scores_gemma":[0.1415495,0.00002297338,0.8570952,0.0004377707,0.0001313461,0.000001636821,0.00000221825,0.00000911818,0.0007502647],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.980102,"threshold_uncertainty_score":0.3136111,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07083278689956192,"score_gpt":0.2698876164155146,"score_spread":0.1990548295159527,"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."}}