{"id":"W2052373622","doi":"10.1145/1328911.1328921","title":"Approximate distance oracles for geometric spanners","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Shortest path problem; Constant (computer programming); Data structure; Euclidean space; Binary logarithm; Distance; Oracle; Path (computing); Discrete mathematics; Dilation (metric space); Computational geometry; Graph; Algorithm; Computer science","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.002141912,0.0008922347,0.002049929,0.001561542,0.0007743369,0.002912102,0.002922942,0.001980378,0.007088672],"category_scores_gemma":[0.02151931,0.0006107343,0.0009606261,0.003530355,0.001454008,0.01390883,0.0046507,0.002152062,0.002084702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001583391,"about_ca_system_score_gemma":0.001295871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001251357,"about_ca_topic_score_gemma":0.001518496,"domain_scores_codex":[0.995326,0.0007655684,0.0006650485,0.001159594,0.001608161,0.0004755377],"domain_scores_gemma":[0.9879563,0.005127537,0.001179913,0.004374572,0.0008597525,0.0005019464],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002425399,0.0005072534,0.00897964,0.00110283,0.000156012,0.0003576921,0.001219939,0.3034567,0.01764895,0.2808617,0.01941783,0.3638661],"study_design_scores_gemma":[0.0001473204,0.0003288218,0.00104355,0.00007496458,0.00004905338,0.0004793103,0.0004544287,0.5819937,0.01111514,0.3937987,0.01045441,0.00006069798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2122838,0.001679763,0.7631916,0.002249763,0.0001586722,0.0002356099,0.005671263,0.006352401,0.008177031],"genre_scores_gemma":[0.6894799,0.0007119971,0.2917631,0.0004530345,0.00025031,0.0004234419,0.01096032,0.0005367652,0.005421144],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007088672,"threshold_uncertainty_score":0.02371395,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03916038913989277,"score_gpt":0.2687088556867836,"score_spread":0.2295484665468908,"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."}}