{"id":"W2806423369","doi":"10.1016/j.tcs.2020.05.039","title":"Tree path majority data structures","year":2020,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada; Instituto Millenium","keywords":"Combinatorics; Logarithm; Binary logarithm; Sigma; Mathematics; Path (computing); Tree (set theory); Log-log plot; Time complexity; Entropy (arrow of time); Data structure; Space (punctuation); Linear space; Discrete mathematics; Physics; Computer science; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001557807,0.0005383532,0.000598631,0.0001845186,0.0005568964,0.00219115,0.02731066,0.0002334984,0.00006681593],"category_scores_gemma":[0.0002151787,0.0004218394,0.0001095544,0.000890988,0.002657536,0.001303505,0.08276959,0.001317149,0.00009129673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006407539,"about_ca_system_score_gemma":0.0006922157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000245356,"about_ca_topic_score_gemma":9.940089e-7,"domain_scores_codex":[0.9932966,0.0002249493,0.0005422737,0.003306752,0.001790162,0.0008392482],"domain_scores_gemma":[0.9912894,0.000234229,0.000236474,0.007294496,0.0002340313,0.0007113618],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006518699,0.00004006805,0.00001421364,0.00003599978,0.000008893267,0.0000590925,0.0001747027,0.00007484316,0.00007438062,0.8660241,0.002384604,0.1311026],"study_design_scores_gemma":[0.0001063955,0.00006154421,0.0007218417,0.00005262488,0.00000884001,0.00001858951,0.000001710673,0.5847749,0.0002164725,0.4131828,0.0005120845,0.0003422676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008648135,0.0001463217,0.9898501,0.002851811,0.003261834,0.0003321897,0.0001714783,0.0005677055,0.001953762],"genre_scores_gemma":[0.4299006,0.00002054869,0.5684486,0.0007985369,0.0007234195,0.000005153061,0.00008588379,0.00001470562,0.000002585828],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5847,"threshold_uncertainty_score":0.9998233,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04045594888347175,"score_gpt":0.2974806485560413,"score_spread":0.2570246996725696,"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."}}