{"id":"W2798468821","doi":"10.4230/lipics.socg.2018.24","title":"Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Binary logarithm; Unit disk; Bounded function; Upper and lower bounds; Time complexity; Metric space; Graph; Oracle; Discrete mathematics; 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.001012814,0.001485156,0.00176975,0.001476817,0.0007239373,0.00231628,0.004297673,0.00172988,0.006296665],"category_scores_gemma":[0.01156676,0.00069862,0.0009160967,0.003576866,0.001021994,0.009055033,0.003523301,0.002158451,0.002034408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001705564,"about_ca_system_score_gemma":0.0008987148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003047047,"about_ca_topic_score_gemma":0.003621594,"domain_scores_codex":[0.9974068,0.0005760009,0.0001984897,0.0007243383,0.0008230143,0.0002714],"domain_scores_gemma":[0.9950526,0.002246108,0.0005407151,0.001577951,0.0003622405,0.0002204395],"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.002612932,0.0004334786,0.004025789,0.001293206,0.0001998915,0.0003461607,0.000594379,0.3925565,0.01875103,0.150039,0.02067009,0.4084775],"study_design_scores_gemma":[0.0001355365,0.0001934082,0.0007798657,0.00003839094,0.00004438435,0.0003505117,0.0001684422,0.8146656,0.008130988,0.1686838,0.006768909,0.00004008652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09848199,0.001854367,0.8861956,0.001018789,0.0001187208,0.0001570167,0.001575117,0.004218126,0.00638026],"genre_scores_gemma":[0.4929958,0.0009274324,0.495472,0.0002890609,0.000161635,0.0002596671,0.003673238,0.000553548,0.005667707],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006296665,"threshold_uncertainty_score":0.02106446,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01431332347726334,"score_gpt":0.2540391938587569,"score_spread":0.2397258703814936,"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."}}