{"id":"W2084297766","doi":"10.5555/1283383.1283481","title":"A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths","year":2007,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Shortest path problem; Computer science; Spanning tree; Mathematics; Discrete mathematics; Graph","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.0007303391,0.0003704241,0.0003597639,0.0004036685,0.0004071742,0.0003699839,0.001126089,0.0001319274,0.00003634174],"category_scores_gemma":[0.00002857894,0.0002965195,0.0001904077,0.001349391,0.0002008962,0.0005791303,0.0002306215,0.0002523169,0.00002144478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006579144,"about_ca_system_score_gemma":0.0001350413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001379369,"about_ca_topic_score_gemma":0.0006613057,"domain_scores_codex":[0.9972997,0.00004576025,0.0004145721,0.0008244503,0.0004966334,0.0009189199],"domain_scores_gemma":[0.9979994,0.0004318112,0.0001171717,0.0008666294,0.0003007995,0.0002841816],"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.00004557765,0.0005547921,0.0009556882,0.00001876254,0.000175054,0.000111544,0.001084601,0.000009156343,0.0001655479,0.1592485,0.002492471,0.8351383],"study_design_scores_gemma":[0.008288416,0.003995551,0.02064156,0.0002315715,0.0001832489,0.0009313018,0.0008506976,0.6947274,0.01064733,0.1846711,0.07079045,0.004041324],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007331586,0.0001205937,0.9835367,0.0002547764,0.0005594122,0.0006700676,0.0000138734,0.0007557526,0.006757228],"genre_scores_gemma":[0.1570854,0.00001058997,0.8400905,0.0008364752,0.0001673577,0.00006951764,0.00002137903,0.00004054498,0.001678286],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.831097,"threshold_uncertainty_score":0.9999487,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01822120311081693,"score_gpt":0.2519232261339546,"score_spread":0.2337020230231377,"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."}}