{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0005134786,0.001007277,0.001324342,0.0003751771,0.0005849918,0.002331262,0.005612273,0.0006667014,0.0000260994],"category_scores_gemma":[0.000152674,0.0009037728,0.0003806923,0.0002264474,0.0002205468,0.003143555,0.01050548,0.0008632218,0.000005584618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001259306,"about_ca_system_score_gemma":0.0005060338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002602237,"about_ca_topic_score_gemma":0.0002688668,"domain_scores_codex":[0.9955182,0.000087869,0.00135128,0.00125986,0.0007778593,0.001004901],"domain_scores_gemma":[0.9940155,0.0005216746,0.0009299464,0.003652757,0.0003549402,0.0005251899],"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.00191697,0.00114033,0.003117266,0.005853039,0.002880419,0.00009113294,0.04139351,0.008358068,0.0002599767,0.0066601,0.2040462,0.724283],"study_design_scores_gemma":[0.00677583,0.0003182453,0.001413635,0.0005177474,0.0002533027,0.00008669955,0.002162495,0.8452858,0.0002881624,0.0004908548,0.1411365,0.001270778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03692203,0.0009104336,0.9507645,0.0004800735,0.001821356,0.002062343,0.006323019,0.0003383164,0.0003779496],"genre_scores_gemma":[0.08961643,0.0004650049,0.8825107,0.000737804,0.001026788,0.000136372,0.02449145,0.0001645272,0.0008509739],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8369277,"threshold_uncertainty_score":0.9997678,"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."}}