{"id":"W2011204371","doi":"10.1145/2229163.2229166","title":"I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Combinatorics; Mathematics; Binary logarithm; Shortest path problem; Undirected graph; Spanning tree; Minimum spanning tree; Random graph; Path (computing); Bounded function; Enhanced Data Rates for GSM Evolution; Time complexity; Shortest-path tree; Discrete mathematics; Algorithm; Graph; 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","sts"],"consensus_categories":[],"category_scores_codex":[0.0007974449,0.0006671331,0.0006623306,0.0005930588,0.001305452,0.0003389537,0.001797139,0.0002306597,0.00012453],"category_scores_gemma":[0.0001387374,0.0005152323,0.0004353035,0.00207462,0.0003197579,0.0006032939,0.00005130658,0.0005851569,0.00006114025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001639281,"about_ca_system_score_gemma":0.0002357205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008145265,"about_ca_topic_score_gemma":0.00006462154,"domain_scores_codex":[0.99594,0.0001738182,0.0006361727,0.00102016,0.0008419721,0.001387915],"domain_scores_gemma":[0.9956047,0.001254277,0.0001949413,0.001903722,0.0004715419,0.0005708016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009698032,0.004924691,0.0001008103,0.00007117003,0.0007523999,0.00004311824,0.002497594,0.0050067,0.0001308317,0.01258451,0.0008577661,0.9720606],"study_design_scores_gemma":[0.02228042,0.004465521,0.003312289,0.0004170753,0.0006420577,0.0006236488,0.0009576351,0.8825264,0.00849716,0.015838,0.05631311,0.004126646],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003138039,0.0002833134,0.990168,0.0006419224,0.002901438,0.001465135,0.0001510876,0.0009448955,0.0003061959],"genre_scores_gemma":[0.2750584,0.0001029769,0.7221321,0.000506149,0.0004435268,0.000886934,0.0000355396,0.0001056769,0.0007287336],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.967934,"threshold_uncertainty_score":0.9999947,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04606075865658251,"score_gpt":0.2855441878667008,"score_spread":0.2394834292101183,"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."}}