{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003397823,0.001510748,0.002066731,0.001738647,0.001653085,0.004752445,0.003103281,0.002452878,0.01087134],"category_scores_gemma":[0.02307071,0.000753173,0.001210022,0.003919388,0.002530518,0.01590593,0.004339575,0.002558862,0.0026941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002861678,"about_ca_system_score_gemma":0.002889376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003084652,"about_ca_topic_score_gemma":0.004023546,"domain_scores_codex":[0.993807,0.00141848,0.0004605701,0.0007180278,0.002544373,0.001051452],"domain_scores_gemma":[0.9732747,0.01968393,0.0009386415,0.004480224,0.001204402,0.0004180605],"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.005463957,0.0006229704,0.008528506,0.001065286,0.0003292827,0.0006670357,0.001087314,0.2479679,0.03015923,0.1696714,0.03157169,0.5028654],"study_design_scores_gemma":[0.0002602316,0.0003675203,0.001337972,0.00009699849,0.0001408387,0.0005492148,0.0003049336,0.8420122,0.01486593,0.1343415,0.005651716,0.00007088776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4887178,0.01289668,0.431467,0.011218,0.0005094635,0.0003650727,0.001700338,0.006094686,0.04703093],"genre_scores_gemma":[0.8145882,0.002999135,0.162345,0.001062023,0.0005546276,0.0005080045,0.001588775,0.001056789,0.01529736],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01087134,"threshold_uncertainty_score":0.03636831,"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."}}