{"id":"W1975248037","doi":"10.5555/545381.545489","title":"Approximate distance oracles for geometric graphs","year":2002,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Combinatorics; Enhanced Data Rates for GSM Evolution; Binary logarithm; Mathematics; Path (computing); Shortest path problem; Time complexity; Preprocessor; Graph; Data structure; Polynomial; Discrete mathematics; Computer science; Artificial intelligence","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.0001309438,0.00007157801,0.0000735811,0.0002276128,0.0001249713,0.0001217793,0.0002883972,0.00002250764,0.00005230328],"category_scores_gemma":[0.00004562014,0.00006321052,0.00005235333,0.001247822,0.00001191487,0.0003555094,0.00004338485,0.00002743904,0.00004336526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001231537,"about_ca_system_score_gemma":0.000005896909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001507833,"about_ca_topic_score_gemma":0.000002308996,"domain_scores_codex":[0.9993095,0.00001161794,0.0001302401,0.0002369637,0.0001534843,0.0001582266],"domain_scores_gemma":[0.9995098,0.0001152489,0.00004047737,0.0001964327,0.00008832031,0.00004978996],"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.000001727403,0.00007385611,0.00008672078,0.00001423602,0.000007411435,8.403456e-7,0.00006086542,0.001385,0.0001416199,0.77767,0.01053301,0.2100247],"study_design_scores_gemma":[0.0003077636,0.00006678155,0.0006067521,0.000003180226,0.000002957716,0.000006280758,0.000005276459,0.9028769,0.00237236,0.04563385,0.04794841,0.0001695177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002361775,0.0003912063,0.9923234,0.0005601304,0.0002292408,0.0001579698,0.000002824489,0.0001451013,0.003828353],"genre_scores_gemma":[0.7324571,0.00003041864,0.2636496,0.0003612334,0.00005451736,0.0000424887,0.000006608016,0.000004651302,0.003393452],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9014919,"threshold_uncertainty_score":0.257765,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03038832750984929,"score_gpt":0.2408986904983129,"score_spread":0.2105103629884637,"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."}}