{"id":"W2555880401","doi":"10.1109/spcom.2016.7746651","title":"Text compression using lexicographic permutation of binary strings","year":2016,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Lexicographical order; Lossless compression; String (physics); Computer science; Binary number; Data compression; Permutation (music); Reduction (mathematics); Rank (graph theory); Compression ratio; Compression (physics); String searching algorithm; Algorithm; Binary code; n-gram; Speech recognition; Mathematics; Combinatorics; Artificial intelligence; Arithmetic; Pattern matching; Language model; Physics","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.0004365008,0.000693237,0.0005814285,0.001884032,0.0004085291,0.0009766499,0.0006778509,0.0005523876,0.003145043],"category_scores_gemma":[0.003441692,0.000217019,0.000367223,0.002200764,0.0005714135,0.001567613,0.0006140659,0.0006094548,0.002159086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000347121,"about_ca_system_score_gemma":0.0005551073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007520019,"about_ca_topic_score_gemma":0.0007912121,"domain_scores_codex":[0.9993657,0.0001262201,0.00007781078,0.0001100481,0.0002715353,0.00004866906],"domain_scores_gemma":[0.9985363,0.0005949045,0.0001634241,0.0004000263,0.0002774333,0.00002780472],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0007142369,0.0001352974,0.001032832,0.0004639725,0.00004901253,0.0005657781,0.0002246933,0.02360214,0.1037488,0.02661199,0.008803993,0.8340472],"study_design_scores_gemma":[0.0001669444,0.0008016261,0.002805439,0.0002297137,0.00009558649,0.002696221,0.000350647,0.4697067,0.414782,0.05463372,0.0536083,0.0001232107],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05784909,0.001685406,0.9276211,0.0006345425,0.0004084519,0.0002716981,0.001026876,0.004606628,0.005896323],"genre_scores_gemma":[0.2445756,0.001751177,0.7420291,0.0003855241,0.0002931019,0.0002591124,0.002710048,0.0004053901,0.007591075],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003145043,"threshold_uncertainty_score":0.01052123,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02569379645617112,"score_gpt":0.266010369188574,"score_spread":0.2403165727324029,"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."}}