{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004676364,0.001110441,0.001088571,0.001116065,0.0009712757,0.0009914964,0.002300548,0.00116135,0.00406077],"category_scores_gemma":[0.003127553,0.0006209962,0.0007440537,0.002056188,0.000654405,0.003478433,0.001840147,0.001212478,0.001720616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009724364,"about_ca_system_score_gemma":0.001697898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003671748,"about_ca_topic_score_gemma":0.005332509,"domain_scores_codex":[0.9993021,0.0001337969,0.00004411774,0.0001973268,0.0002240501,0.0000985615],"domain_scores_gemma":[0.9982353,0.0006673029,0.0001642127,0.0005886971,0.0002648072,0.00007967038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006413388,0.000375859,0.00174009,0.0007616355,0.0002143323,0.0003393227,0.0005492108,0.3236852,0.03997788,0.04934356,0.02634701,0.5560246],"study_design_scores_gemma":[0.0002545684,0.0002144018,0.0004355835,0.00004097131,0.00006948219,0.0003340269,0.00007723037,0.9080908,0.0130607,0.06468395,0.01267574,0.00006249131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0303464,0.0006696267,0.9605221,0.0003451433,0.00006711844,0.0001298662,0.0003764822,0.004221247,0.003322059],"genre_scores_gemma":[0.1624195,0.0003677275,0.8313239,0.0001579951,0.00006336143,0.0002922975,0.00132726,0.0004195825,0.003628423],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00406077,"threshold_uncertainty_score":0.01358467,"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."}}