{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007606141,0.0004042265,0.0005866407,0.001001738,0.00048734,0.0009305195,0.001072169,0.001190638,0.00118959],"category_scores_gemma":[0.005949622,0.0002504268,0.000406976,0.001261949,0.001648652,0.001588131,0.001674636,0.001357915,0.0003861157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000870061,"about_ca_system_score_gemma":0.001183243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001110429,"about_ca_topic_score_gemma":0.0009603099,"domain_scores_codex":[0.9990953,0.0001702826,0.0000521678,0.0001633899,0.0004291422,0.00008974889],"domain_scores_gemma":[0.9976941,0.001158273,0.0001976367,0.0005137488,0.0003498446,0.00008646928],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002296117,0.00007802373,0.0009199805,0.0003038044,0.00004257087,0.0005262091,0.0004314597,0.1902616,0.03166507,0.5760061,0.004165115,0.1953706],"study_design_scores_gemma":[0.00003317534,0.00008008127,0.0002202936,0.00006076386,0.0000237824,0.0004912665,0.00003629635,0.7536325,0.01804884,0.221516,0.005825756,0.00003115548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03620048,0.0006276752,0.9594324,0.0004008342,0.0000676753,0.00006094348,0.0001943937,0.0005281645,0.002487444],"genre_scores_gemma":[0.5834492,0.001112309,0.4083729,0.0005160121,0.0001917657,0.0003099743,0.0007136459,0.0003921953,0.004941914],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001190638,"threshold_uncertainty_score":0.006312788,"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."}}