{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00157917,0.001685107,0.001936178,0.001208458,0.001572962,0.003602009,0.003319439,0.001574991,0.01137524],"category_scores_gemma":[0.01020994,0.0008668152,0.001263287,0.003353222,0.001655858,0.01043339,0.003122112,0.002421819,0.003164256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002755377,"about_ca_system_score_gemma":0.002021172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00489004,"about_ca_topic_score_gemma":0.008210505,"domain_scores_codex":[0.9969399,0.0008626091,0.0001593053,0.0008968847,0.0006691168,0.0004722849],"domain_scores_gemma":[0.9941076,0.003960632,0.0004352352,0.0009120011,0.0003181447,0.0002662897],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002688989,0.0005301082,0.002929011,0.001895332,0.0002406252,0.0005001934,0.001236132,0.4768464,0.01607309,0.1671319,0.03804258,0.2918857],"study_design_scores_gemma":[0.0003420758,0.0001766682,0.0007096305,0.00004994965,0.00009037521,0.0003119219,0.0003077803,0.6984363,0.004680454,0.2846149,0.0102441,0.00003588705],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2206414,0.002456769,0.741227,0.002983963,0.0002619445,0.0003457615,0.001616128,0.004899655,0.02556726],"genre_scores_gemma":[0.4143993,0.001047655,0.5645488,0.0005767369,0.0002704327,0.0003330256,0.002984996,0.001527595,0.01431143],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01137524,"threshold_uncertainty_score":0.03805399,"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."}}