{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001645474,0.00006280396,0.0000635813,0.00005519651,0.00002373724,0.00009972369,0.0005914116,0.00001864404,0.00007633669],"category_scores_gemma":[0.00001118221,0.00003721598,0.00001737197,0.0001984698,0.00002429832,0.0009823571,0.0003356425,0.0000263758,0.0001419562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001236803,"about_ca_system_score_gemma":0.000006793928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007614424,"about_ca_topic_score_gemma":0.0001105421,"domain_scores_codex":[0.9993943,0.00001834783,0.0001014193,0.0002040184,0.00009155831,0.0001903351],"domain_scores_gemma":[0.9995556,0.00002805786,0.00001888312,0.0003564663,0.000008951294,0.00003196854],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001013684,0.00002229597,0.004145781,0.000001401232,0.000003408134,0.00001832563,0.00002534605,0.00001311695,0.00001020453,0.1669589,0.01233412,0.8164661],"study_design_scores_gemma":[0.002292471,0.0002281805,0.2255824,0.0001645231,0.000006286357,0.000008236289,0.0001163267,0.2937691,0.0006095546,0.02158736,0.4544353,0.001200365],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00138161,0.00004037241,0.9679074,0.003150421,0.0003115485,0.00006460262,6.050946e-7,0.0001678826,0.02697559],"genre_scores_gemma":[0.9395959,0.0001454041,0.0389531,0.0009216315,0.0001482113,0.00001831727,0.000002723476,0.000008040232,0.02020666],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9382143,"threshold_uncertainty_score":0.1824607,"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."}}