{"id":"W2044936698","doi":"10.1016/j.comgeo.2012.09.007","title":"An in-place min–max priority search tree","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Optimal binary search tree; Heap (data structure); Range tree; Binary search tree; Interval tree; Self-balancing binary search tree; K-ary tree; Binary tree; Tree (set theory); Combinatorics; Search tree; Segment tree; Mathematics; Tree traversal; Data structure; Ternary search tree; Set (abstract data type); Point (geometry); Computer science; Depth-first search; Algorithm; Search algorithm; Tree structure","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":[],"consensus_categories":[],"category_scores_codex":[0.001166445,0.0001928949,0.0001983812,0.0007656862,0.0001700086,0.0001713345,0.0005356358,0.00009576832,0.00006373275],"category_scores_gemma":[0.00008181017,0.0002093632,0.00006884699,0.002110407,0.000044606,0.001678482,0.0001774302,0.000243464,0.0002243159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001417918,"about_ca_system_score_gemma":0.000209139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002033467,"about_ca_topic_score_gemma":0.000008916777,"domain_scores_codex":[0.9977105,0.0002211499,0.0003668522,0.0004489684,0.0007352463,0.0005173297],"domain_scores_gemma":[0.9986111,0.0004149891,0.00007798034,0.0003631402,0.0002329379,0.0002998441],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003260302,0.001285449,0.05928289,0.00004703429,0.00003591485,0.00002282375,0.001912485,0.5679345,0.001049759,0.2076989,0.001340367,0.1593573],"study_design_scores_gemma":[0.0006426681,0.00009054099,0.4796374,0.00001259969,0.000004341832,0.00006959516,0.00004776567,0.5091994,0.0006793177,0.006846777,0.002417031,0.000352521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4508454,0.0003366209,0.5469641,0.0003393836,0.0004720519,0.0001356876,0.000004398149,0.00009668355,0.0008056907],"genre_scores_gemma":[0.8737637,0.000004856591,0.1252216,0.0003807685,0.0003617254,0.00001280294,0.00009127455,0.00001082421,0.0001524433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4229183,"threshold_uncertainty_score":0.8537583,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02506329569885934,"score_gpt":0.302463652275976,"score_spread":0.2774003565771166,"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."}}