{"id":"W1841647363","doi":"","title":"k-Nearest Neighbors Queries in Time-Dependent Road Networks","year":2012,"lang":"en","type":"article","venue":"Cadernos de Linguística e Teoria da Literatura (Universidade Federal de Minas Gerais)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Correctness; Pruning; k-nearest neighbors algorithm; Speedup; Effi; Data mining; Constant (computer programming); Algorithm; Artificial intelligence; Database","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"],"consensus_categories":[],"category_scores_codex":[0.0007870761,0.0004939734,0.0004485676,0.0004580011,0.0004134331,0.003332916,0.001884709,0.0003375129,0.0001583312],"category_scores_gemma":[0.0001916721,0.0005330097,0.0001584943,0.0009182659,0.000137928,0.003272752,0.0009376945,0.0008509968,0.0002198248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000413446,"about_ca_system_score_gemma":0.0001172923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001508144,"about_ca_topic_score_gemma":0.000007912357,"domain_scores_codex":[0.9964413,0.0002768853,0.000424466,0.0007419626,0.0005148466,0.001600518],"domain_scores_gemma":[0.998112,0.0002468539,0.0001774346,0.0008157387,0.00009900238,0.0005490225],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006016188,0.001795351,0.0624449,0.0004224338,0.0006084476,0.004852375,0.04562496,0.002801324,0.005882396,0.698862,0.03980089,0.1363033],"study_design_scores_gemma":[0.006569466,0.0006984487,0.1090149,0.0009468604,0.0002269309,0.0006001504,0.002458856,0.6611213,0.001001552,0.006370913,0.2061488,0.004841793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3659107,0.007193335,0.5824152,0.006427406,0.006514108,0.001819233,0.0001406812,0.001867798,0.02771152],"genre_scores_gemma":[0.9703544,0.00004975036,0.02160585,0.0009839331,0.001224694,0.00002072253,0.0001253613,0.00005195714,0.005583289],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6924911,"threshold_uncertainty_score":0.9997122,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009278389424483256,"score_gpt":0.227092016744194,"score_spread":0.2178136273197107,"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."}}