{"id":"W3196499363","doi":"10.4230/lipics.esa.2021.70","title":"Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Optimal binary search tree; Random binary tree; Ternary search tree; Binary tree; Range tree; Tree (set theory); Data structure; Binary search tree; K-ary tree; Weight-balanced tree; Interval tree; Range (aeronautics); Random access; Computer science; Mathematics; Combinatorics; Discrete mathematics; Binary number; Search tree; Algorithm; Tree structure; Search algorithm; Arithmetic","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.0007946062,0.0005833866,0.0007059514,0.001292511,0.0007060727,0.001303655,0.001285328,0.0008339015,0.004129289],"category_scores_gemma":[0.009421873,0.0003692399,0.0005323694,0.002298319,0.001271289,0.00376484,0.002977454,0.001616521,0.001688847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001331119,"about_ca_system_score_gemma":0.002309515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002227961,"about_ca_topic_score_gemma":0.003014188,"domain_scores_codex":[0.9982896,0.0001779888,0.000127141,0.000250422,0.0009591657,0.0001956551],"domain_scores_gemma":[0.9961398,0.001180894,0.0003149776,0.001311801,0.0009263378,0.0001261556],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005847721,0.0001690327,0.003077935,0.0003881503,0.00005041714,0.0003294519,0.0007427068,0.09184779,0.0331742,0.3614804,0.02494843,0.4832068],"study_design_scores_gemma":[0.00008045276,0.0001815792,0.0006056891,0.0001464535,0.00002793779,0.0005661901,0.0001923579,0.6588488,0.04711946,0.2680005,0.02413785,0.00009270791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.051026,0.0007262019,0.9358101,0.0006299094,0.0001313895,0.0001415762,0.001736367,0.004278633,0.005519894],"genre_scores_gemma":[0.4272989,0.0007213174,0.5567577,0.000747551,0.0001701778,0.0007794557,0.005169978,0.001781452,0.006573385],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004129289,"threshold_uncertainty_score":0.01381385,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03687785765634344,"score_gpt":0.274961936432509,"score_spread":0.2380840787761656,"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."}}