{"id":"W1627186833","doi":"10.48550/arxiv.cs/0611099","title":"On the space complexity of one-pass compression","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Binary logarithm; Order (exchange); String (physics); Memory footprint; Compression (physics); Entropy (arrow of time); Footprint; Space (punctuation); Discrete mathematics; Physics; Mathematical physics; Computer science; Quantum mechanics; Thermodynamics","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.0004005522,0.0003590483,0.0004861229,0.00009875282,0.0002571192,0.0001248356,0.003005011,0.0002425639,0.00006024794],"category_scores_gemma":[0.00005874365,0.0002427471,0.000191498,0.0002067348,0.0002669612,0.0001800115,0.004915251,0.0008892748,0.0001080609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005911519,"about_ca_system_score_gemma":0.0001044307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009123074,"about_ca_topic_score_gemma":0.00002328017,"domain_scores_codex":[0.9974393,0.0002579226,0.0004630183,0.0008135436,0.0006792548,0.0003469907],"domain_scores_gemma":[0.99613,0.000344698,0.0005404546,0.002736566,0.0001554494,0.00009280729],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001660025,0.003220303,0.08603124,0.0007838939,0.0003438831,0.00008929093,0.001314489,0.009981467,0.01079796,0.6234518,0.2440249,0.01979469],"study_design_scores_gemma":[0.0007845412,0.0002204674,0.7239508,0.001932898,0.00004893321,0.00000640688,0.00002188458,0.1420705,0.01867304,0.1003514,0.01085476,0.001084399],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6283914,0.0002914041,0.3585245,0.004375578,0.001882467,0.0006221306,0.0001192177,0.0002496253,0.005543696],"genre_scores_gemma":[0.9779266,0.00003272986,0.02099054,0.0003513632,0.0002401878,0.00002934468,0.00009544018,0.00002360051,0.0003101631],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6379196,"threshold_uncertainty_score":0.989894,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1126531853581844,"score_gpt":0.2864259018103955,"score_spread":0.1737727164522111,"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."}}