{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005465054,0.0007213304,0.001020948,0.0008205434,0.001177832,0.001682331,0.002628701,0.001154578,0.01158533],"category_scores_gemma":[0.004320752,0.0006374947,0.0005476546,0.002800846,0.0008595274,0.005252604,0.002391809,0.001922572,0.002809994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001622605,"about_ca_system_score_gemma":0.001733552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001968321,"about_ca_topic_score_gemma":0.003843579,"domain_scores_codex":[0.9992342,0.0001204211,0.00003059051,0.0001483372,0.000305872,0.0001605079],"domain_scores_gemma":[0.9979163,0.0008076406,0.0001377982,0.0008718672,0.0001913914,0.00007503306],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001102404,0.0002935331,0.0007462205,0.001049808,0.0001132077,0.0001667237,0.0004822287,0.2222126,0.01380399,0.3482197,0.08090376,0.3309059],"study_design_scores_gemma":[0.0002134945,0.0002005431,0.0004407942,0.00009827721,0.00009596365,0.0002707888,0.0001687644,0.3285713,0.01186343,0.6224373,0.03560336,0.0000359932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1587141,0.003005777,0.6801125,0.002941411,0.0003948575,0.0004286235,0.003398911,0.007779997,0.1432237],"genre_scores_gemma":[0.6577505,0.00263819,0.2613766,0.0005656817,0.0002585233,0.0005057018,0.003916661,0.001251197,0.0717369],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01158533,"threshold_uncertainty_score":0.03875679,"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."}}