{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008345505,0.0005269872,0.0005429234,0.001512436,0.0002792418,0.0008470547,0.0008961043,0.0004641362,0.00122169],"category_scores_gemma":[0.005182564,0.0002259177,0.0003746297,0.001314911,0.0004616248,0.001431434,0.0007287387,0.000532746,0.0003704666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000878612,"about_ca_system_score_gemma":0.0009358721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002036349,"about_ca_topic_score_gemma":0.001879988,"domain_scores_codex":[0.9992203,0.0001835762,0.00004796166,0.00009110801,0.000360772,0.00009626695],"domain_scores_gemma":[0.9985484,0.0006842901,0.0001664746,0.0002788154,0.0002657716,0.00005608628],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001308111,0.0001647521,0.002756483,0.0004219647,0.00007689145,0.0008102214,0.0004243107,0.3392098,0.03862867,0.1591738,0.008620305,0.4484048],"study_design_scores_gemma":[0.00002190884,0.00009812308,0.0006184049,0.00002876253,0.00002739287,0.0001953749,0.00004315968,0.9407383,0.008745059,0.04760261,0.001865033,0.00001577664],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1837619,0.0011326,0.8080214,0.0006238086,0.00006478561,0.00008080058,0.0009692626,0.001286964,0.004058536],"genre_scores_gemma":[0.7967806,0.0009141456,0.1957713,0.0001934444,0.0001041275,0.0001961915,0.002115271,0.0001388237,0.003786095],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002036349,"threshold_uncertainty_score":0.006374836,"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."}}