{"id":"W2140883685","doi":"10.1016/s0166-218x(02)00217-2","title":"An external memory data structure for shortest path queries","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Shortest path problem; Distance; sort; Planar graph; Data structure; Path (computing); Graph; Spanning tree; Binary logarithm; Binary tree; Discrete mathematics; Computer science; Arithmetic","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":[],"consensus_categories":[],"category_scores_codex":[0.0001587529,0.0002072781,0.0002356298,0.0000388025,0.0001954899,0.0003101599,0.002388377,0.00007486316,0.00007457419],"category_scores_gemma":[0.00001999792,0.0001598198,0.00003221767,0.0001069815,0.00005311574,0.0007749181,0.0006862063,0.0001136659,0.00001654944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001181167,"about_ca_system_score_gemma":0.00001445999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000377128,"about_ca_topic_score_gemma":0.000004090859,"domain_scores_codex":[0.9985785,0.00000885096,0.0002872891,0.0005241717,0.0003135563,0.000287665],"domain_scores_gemma":[0.9971618,0.00008861918,0.0001392978,0.002451173,0.00003498107,0.0001241236],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001499135,0.0004753124,0.00001894707,0.0003119907,0.00006096028,0.00002168631,0.00734432,0.0003191741,0.03175717,0.7330649,0.01784018,0.2087704],"study_design_scores_gemma":[0.0003086025,0.00005493961,0.0000297306,0.00003975571,0.00002023008,0.00001902912,0.0002803891,0.9445481,0.001919826,0.04952814,0.002932919,0.0003183784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003022889,0.0001130616,0.9944432,0.00006260783,0.0001384948,0.000377404,0.0004180833,0.0001726047,0.001251634],"genre_scores_gemma":[0.1525806,0.00001643868,0.8467531,0.000126894,0.0001843601,0.00003054046,0.0002149095,0.00002487384,0.00006822483],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9442289,"threshold_uncertainty_score":0.6517262,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03890792014784756,"score_gpt":0.2760937952615219,"score_spread":0.2371858751136744,"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."}}