{"id":"W2129623613","doi":"10.1109/isit.2013.6620559","title":"Redundancy analysis in lossless compression of a binary tree via its minimal DAG representation","year":2013,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Encoder; Binary number; Lossless compression; Binary tree; Discrete mathematics; Tree (set theory); Redundancy (engineering); Mathematics; Computer science; Algorithm; Data compression; Arithmetic; Statistics","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.0001432898,0.0001259368,0.000292781,0.0004400642,0.00005453854,0.00007840939,0.0007334519,0.0000671564,0.0002252283],"category_scores_gemma":[0.00001931205,0.00009885546,0.00009674155,0.0015636,0.00003177951,0.001309771,0.0004258803,0.00009216564,0.00004759138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002048294,"about_ca_system_score_gemma":0.00002424916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001055005,"about_ca_topic_score_gemma":0.00005205104,"domain_scores_codex":[0.9984524,0.000111989,0.0004347688,0.0004515609,0.0003432006,0.0002061107],"domain_scores_gemma":[0.9987875,0.00009458547,0.0001746569,0.0007354652,0.000125975,0.00008187712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000112235,0.001935797,0.1044742,0.000133798,0.0003501051,0.00009157228,0.003141647,0.01021685,0.3916362,0.006280272,0.01226611,0.4693612],"study_design_scores_gemma":[0.0003234191,0.00005329832,0.263669,0.00003015833,0.00001602624,0.000001955771,0.0000518068,0.7271581,0.008148028,0.0003856891,0.00004945387,0.0001129781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5064451,0.0001617623,0.4904322,0.0003301136,0.0001190651,0.0002525995,0.000004375498,0.00006795464,0.002186859],"genre_scores_gemma":[0.9507518,0.0000145728,0.04872215,0.00003923535,0.00002089362,0.00002076866,0.00003003236,0.000004893884,0.0003956544],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7169413,"threshold_uncertainty_score":0.4031209,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02165254944003027,"score_gpt":0.2818698988199121,"score_spread":0.2602173493798819,"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."}}