{"id":"W1573036177","doi":"10.1007/3-540-45294-x_21","title":"I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; sort; Set (abstract data type); Point (geometry); Mathematics; Plane (geometry); Range (aeronautics); Left and right; Binary logarithm; Algorithm; Discrete mathematics; Computer science; Geometry; 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"],"consensus_categories":[],"category_scores_codex":[0.0009385102,0.0003752023,0.0003389767,0.0007660824,0.0003788215,0.0005078739,0.001317285,0.0001775204,0.00001022033],"category_scores_gemma":[0.00008485412,0.0003674316,0.00005999402,0.001178594,0.0001402286,0.0002868906,0.0009342213,0.0003987028,0.00004906255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002040858,"about_ca_system_score_gemma":0.0003446045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007587623,"about_ca_topic_score_gemma":0.00003262554,"domain_scores_codex":[0.9967805,0.00002499581,0.0004431043,0.001422756,0.0008480003,0.0004806697],"domain_scores_gemma":[0.9981837,0.0003217632,0.0002008148,0.0006327886,0.0004377782,0.0002231587],"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.000003052393,0.00004513638,0.00002386198,0.00006399638,0.000006807933,0.00001016866,0.0008193743,0.5201557,0.0003615805,0.05010036,0.00001053065,0.4283994],"study_design_scores_gemma":[0.0001882871,0.0000814037,0.0001466762,0.0001568587,0.000006182624,0.00006080715,1.407408e-7,0.9574083,0.0003485102,0.03419764,0.006922463,0.0004827294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005431639,0.0006658226,0.9937642,0.001147583,0.0004710454,0.001334523,0.000005240081,0.0001401825,0.00192826],"genre_scores_gemma":[0.5080178,0.00008559868,0.4857846,0.003544906,0.001210033,0.0002461645,0.00001816295,0.00005498313,0.001037772],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5079796,"threshold_uncertainty_score":0.9998778,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02337606576316631,"score_gpt":0.2532877619939588,"score_spread":0.2299116962307925,"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."}}