{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001917302,0.001032494,0.002057195,0.001443141,0.0007770942,0.003510662,0.003853829,0.002830602,0.009432733],"category_scores_gemma":[0.01945715,0.0006607396,0.001018173,0.003667217,0.001446231,0.01147832,0.004148768,0.002707966,0.002247015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00245693,"about_ca_system_score_gemma":0.001375671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002501934,"about_ca_topic_score_gemma":0.003282195,"domain_scores_codex":[0.9958198,0.0007984762,0.0003716536,0.0009671316,0.001432443,0.0006103446],"domain_scores_gemma":[0.9874173,0.006646919,0.0008869871,0.00391506,0.0007041226,0.0004295833],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003224331,0.0005558708,0.005249197,0.0009515873,0.0001748605,0.0003516025,0.000618097,0.4272511,0.01159394,0.2203882,0.02804728,0.301594],"study_design_scores_gemma":[0.0001796467,0.0001420569,0.0007654519,0.00004040283,0.00004002218,0.0003023432,0.0001813958,0.7686484,0.005027493,0.220028,0.004610915,0.00003388478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1517911,0.001956278,0.8214183,0.002790351,0.0001424689,0.0002032403,0.004221537,0.007859988,0.009616667],"genre_scores_gemma":[0.7373523,0.0008253185,0.2461541,0.0005201155,0.0002565541,0.0002885032,0.008609942,0.0005308743,0.005462378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009432733,"threshold_uncertainty_score":0.03155565,"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."}}