{"id":"W2148029210","doi":"10.1109/dcc.2013.40","title":"Partition Tree Weighting","year":2013,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Weighting; Computer science; Partition (number theory); Piecewise; Algorithm; Entropy (arrow of time); Tree (set theory); k-d tree; Huffman coding; Redundancy (engineering); Data mining; Theoretical computer science; Tree traversal; Data compression; Mathematics","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004381864,0.0000382438,0.00003616823,0.00001955281,0.00006230997,0.0001387602,0.0002680245,0.00001564674,0.0003112296],"category_scores_gemma":[0.000005247626,0.00002662894,0.00001426693,0.00007759662,0.000005927469,0.000900778,0.0001592308,0.0000297195,0.0009895449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005089245,"about_ca_system_score_gemma":0.000005719874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008381115,"about_ca_topic_score_gemma":0.00000266896,"domain_scores_codex":[0.9995902,0.00001070961,0.00007097677,0.0001303892,0.00009104089,0.0001066488],"domain_scores_gemma":[0.9996468,0.00001784808,0.0000185777,0.0002474582,0.00002587669,0.00004339274],"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":[2.174356e-7,0.00003034048,0.0003848156,0.000002291919,0.000002355021,0.00000203232,0.00007866434,0.000006056198,0.003254631,0.1278059,0.05978052,0.8086522],"study_design_scores_gemma":[0.0001959443,0.00004198176,0.01749114,0.00001395825,0.000001059162,0.000008042283,0.00001975273,0.9015725,0.008657444,0.03634883,0.03546981,0.0001795887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007545405,0.00001738512,0.9530426,0.000865788,0.0001399162,0.00005154551,1.766461e-7,0.0001666364,0.03817056],"genre_scores_gemma":[0.6384789,0.000005269768,0.3589355,0.0005900319,0.0001090949,0.00002085913,0.000004096634,0.00000334413,0.001852912],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9015664,"threshold_uncertainty_score":0.9997883,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009474460688097647,"score_gpt":0.2045399286998666,"score_spread":0.195065468011769,"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."}}