{"id":"W2921895451","doi":"10.23919/isita.2018.8664360","title":"Compression by Substring Enumeration with a Finite Alphabet Using Sorting","year":2018,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Substring; Lexicographical order; Upper and lower bounds; Enumeration; Sorting; Algorithm; Code word; Encoding (memory); Computer science; Compression (physics); Alphabet; Data compression; Combinatorics; Encoder; Pooling; Mathematics; Order (exchange); Data structure; Decoding methods; Artificial intelligence; Statistics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006982466,0.0005025666,0.000876762,0.002236013,0.0005348498,0.0009328577,0.001118693,0.0005667363,0.001336343],"category_scores_gemma":[0.003922127,0.000233439,0.0004763885,0.003048025,0.0006784122,0.002029093,0.0007651125,0.0007906269,0.000460197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007601934,"about_ca_system_score_gemma":0.001385229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00191387,"about_ca_topic_score_gemma":0.002470398,"domain_scores_codex":[0.9989504,0.0001627256,0.0001463481,0.0001779056,0.0004761591,0.00008643265],"domain_scores_gemma":[0.9975066,0.001143822,0.0001835763,0.0006759499,0.0004406126,0.000049468],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005741814,0.0001590775,0.002006518,0.0002591469,0.00004761659,0.0002610472,0.0001906746,0.061153,0.05964331,0.03835494,0.002550096,0.8348004],"study_design_scores_gemma":[0.0001227947,0.0003202538,0.00199883,0.0001007282,0.00006941574,0.0009996574,0.0001670522,0.7529362,0.1735937,0.05083613,0.01877665,0.00007864618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05459625,0.0005990191,0.939945,0.0001783734,0.00006615823,0.0001065197,0.0002039178,0.001488589,0.002816129],"genre_scores_gemma":[0.1802836,0.0003897078,0.8155799,0.0001634047,0.00004878653,0.0001207726,0.0007130518,0.0001538149,0.002547026],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002236013,"threshold_uncertainty_score":0.005515635,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01883167309484636,"score_gpt":0.2555191560520908,"score_spread":0.2366874829572444,"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."}}