{"id":"W2571737124","doi":"10.4230/lipics.isaac.2016.24","title":"All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Binary logarithm; Shortest path problem; Logarithm; Mathematics; Vertex (graph theory); Time complexity; Running time; Unit disk; Graph; Discrete mathematics; Log-log plot; Algorithm","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.0009165292,0.0003637791,0.0004115952,0.0008826211,0.0001306079,0.0002676288,0.00102528,0.0001833607,0.00004270657],"category_scores_gemma":[0.0001274051,0.0002855238,0.0001612894,0.001076625,0.00007369925,0.002476874,0.0002940582,0.0002385281,0.0003019354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001653442,"about_ca_system_score_gemma":0.0001535845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001925952,"about_ca_topic_score_gemma":0.0001354653,"domain_scores_codex":[0.9970363,0.00008644893,0.001247112,0.0003745474,0.0005229997,0.0007326287],"domain_scores_gemma":[0.9983069,0.0003703136,0.0002859184,0.0006447629,0.0001992608,0.0001928617],"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.0005601986,0.00430571,0.244615,0.001060493,0.0005200303,0.0002069535,0.04342811,0.01140685,0.005763405,0.3397894,0.01788864,0.3304552],"study_design_scores_gemma":[0.01365899,0.001022686,0.0730136,0.0009623014,0.00004826476,0.000157033,0.0006142292,0.8039148,0.004936729,0.04014193,0.05902942,0.002500047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7516265,0.00007594621,0.2413681,0.001598016,0.0008461737,0.001343213,0.0001549008,0.000233779,0.002753353],"genre_scores_gemma":[0.9863228,0.00004340503,0.01190363,0.0009509464,0.00006837254,0.0001324342,0.0002112539,0.00002501568,0.0003422053],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7925079,"threshold_uncertainty_score":0.9999597,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01558402400576505,"score_gpt":0.2481013665065303,"score_spread":0.2325173425007652,"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."}}