{"id":"W2498735781","doi":"10.1109/mdm.2016.44","title":"K-Closest Pairs Queries in Road Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tree traversal; Search engine indexing; Traverse; Pruning; Computer science; Tree (set theory); Metric (unit); Metric space; Breadth-first search; Theoretical computer science; Euclidean space; Algorithm; Mathematics; Combinatorics; Artificial intelligence; Discrete mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003111797,0.001209897,0.002604597,0.003391566,0.002132195,0.003024338,0.003206588,0.002956654,0.002317068],"category_scores_gemma":[0.01749082,0.0007453621,0.0008740221,0.006366345,0.001140842,0.009817963,0.003572803,0.001147004,0.0008901305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001662987,"about_ca_system_score_gemma":0.001508669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008780943,"about_ca_topic_score_gemma":0.008491063,"domain_scores_codex":[0.9945222,0.001670937,0.0006147039,0.001160755,0.001536053,0.0004954036],"domain_scores_gemma":[0.9911537,0.005595885,0.0006644587,0.001496621,0.0007474184,0.0003418513],"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.002284401,0.0006048047,0.01018635,0.001211039,0.0003318267,0.001193363,0.002237601,0.6190199,0.01364267,0.07741171,0.02412925,0.2477471],"study_design_scores_gemma":[0.0001262668,0.0001794587,0.001376139,0.00004376169,0.0000556699,0.0007020246,0.001673769,0.899883,0.009053424,0.07698289,0.009855933,0.0000675974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.358822,0.003877424,0.615484,0.001799643,0.0001686005,0.0007108481,0.005045805,0.004231024,0.009860621],"genre_scores_gemma":[0.6841745,0.000832425,0.3076153,0.0002079713,0.00007308701,0.0002158554,0.004488261,0.0002497145,0.00214277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008780943,"threshold_uncertainty_score":0.01745969,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01079559213885088,"score_gpt":0.2123146877493925,"score_spread":0.2015190956105417,"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."}}