{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005095346,0.0002795563,0.0002858253,0.0003899231,0.0003218351,0.0004190186,0.0006022977,0.0001207302,0.000009902144],"category_scores_gemma":[0.00005374206,0.000256342,0.00007690272,0.0008540256,0.0001644807,0.00176806,0.0002889358,0.0002008753,0.0000301351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004628533,"about_ca_system_score_gemma":0.00006539116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001158132,"about_ca_topic_score_gemma":0.0001087146,"domain_scores_codex":[0.9980488,0.00004018807,0.0007515149,0.0003129516,0.0003525994,0.0004939514],"domain_scores_gemma":[0.9987275,0.0001120103,0.0002402207,0.0004677422,0.0002950802,0.0001574544],"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.0002705857,0.001011022,0.06973624,0.0007422476,0.0001804612,0.00002304281,0.0258838,0.0004674972,0.0004385752,0.6891161,0.003362044,0.2087684],"study_design_scores_gemma":[0.002611784,0.0004160754,0.01690286,0.00017452,0.00001842209,0.00006425707,0.0005230227,0.9093397,0.001674734,0.02675767,0.04078367,0.0007333208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4149405,0.00008704757,0.5817621,0.000213225,0.0006131019,0.0006182165,0.0001269622,0.000144395,0.001494395],"genre_scores_gemma":[0.9462523,0.00004991057,0.05261425,0.0005371018,0.0001048,0.00006822023,0.0002453932,0.00001763267,0.0001103759],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9088722,"threshold_uncertainty_score":0.9999889,"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."}}