{"id":"W2952002168","doi":"10.48550/arxiv.1304.7392","title":"A Universal Grammar-Based Code For Lossless Compression of Binary Trees","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National Science Foundation","keywords":"Lossless compression; Code word; Computer science; Binary tree; Binary number; Theoretical computer science; Tree (set theory); Mathematics; Algorithm; Decoding methods; Data compression; Combinatorics; Arithmetic","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001743023,0.0003726872,0.0005131306,0.0003419241,0.0001911881,0.00009318358,0.002727628,0.0003520085,0.00003146269],"category_scores_gemma":[0.00001906735,0.0003765535,0.0003109158,0.0003803149,0.0001885153,0.0005332194,0.002583978,0.0003636302,0.00001621268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001272658,"about_ca_system_score_gemma":0.0002990096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003400531,"about_ca_topic_score_gemma":0.00003466367,"domain_scores_codex":[0.9979448,0.0001399578,0.0002799127,0.001109926,0.0001489702,0.0003764404],"domain_scores_gemma":[0.9971054,0.0002642855,0.0004898158,0.001607219,0.000333143,0.0002001478],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004915083,0.001081659,0.002085296,0.000804514,0.0002286047,0.0002847358,0.0003063819,0.7783696,0.00280981,0.1958369,0.01081714,0.006883828],"study_design_scores_gemma":[0.001326963,0.0001685975,0.001000248,0.000352956,0.00006096446,0.000001056209,0.00004705365,0.9822091,0.0009307141,0.01084061,0.002626383,0.0004353835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1715604,0.00007477724,0.8265035,0.00007989072,0.0005225505,0.0005698103,0.0003135058,0.000177827,0.0001976806],"genre_scores_gemma":[0.9752644,0.00006009076,0.0238,0.00004071066,0.00005852274,0.000003425546,0.0001813759,0.00002363459,0.00056784],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.803704,"threshold_uncertainty_score":0.9998686,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0761930113248232,"score_gpt":0.2049237266269968,"score_spread":0.1287307153021736,"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."}}