{"id":"W2140591634","doi":"10.1007/11523468_46","title":"Cache-Oblivious Planar Shortest Paths","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Cache; Parallel computing; Planar; Operating system","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","open_science"],"consensus_categories":[],"category_scores_codex":[0.000949687,0.0008148996,0.000746516,0.001276353,0.000463015,0.0008559882,0.006183362,0.0004584377,0.00006847311],"category_scores_gemma":[0.0000740453,0.00077918,0.0002620215,0.0009827,0.001091759,0.0008073878,0.001592204,0.001442546,0.0001540579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003634063,"about_ca_system_score_gemma":0.0006455495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005032367,"about_ca_topic_score_gemma":0.0003301305,"domain_scores_codex":[0.9944145,0.00004306442,0.0007162346,0.002224711,0.001495089,0.001106365],"domain_scores_gemma":[0.9962382,0.0005775489,0.0003025314,0.00230893,0.0002345827,0.0003381751],"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.000002998222,0.00005980955,0.00005310966,0.00001818603,0.00001559979,0.000281186,0.0006099781,0.006807722,0.00003831034,0.06124154,0.0001175706,0.930754],"study_design_scores_gemma":[0.0004122007,0.0003432826,0.0003308755,0.0004982636,0.00001759455,0.0004548414,2.588568e-7,0.5520685,0.000505941,0.4210595,0.02250435,0.00180431],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004547694,0.00104233,0.9841623,0.001247988,0.002405135,0.000388639,0.00001784076,0.0003924966,0.01029778],"genre_scores_gemma":[0.08787392,0.0002254288,0.9032658,0.004642187,0.002398232,0.00002149005,0.00002152507,0.00009420489,0.001457236],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9289497,"threshold_uncertainty_score":0.9994659,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02048433727542831,"score_gpt":0.2387099918039188,"score_spread":0.2182256545284905,"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."}}