{"id":"W1591816673","doi":"10.1007/978-3-540-39658-1_40","title":"I/O-Efficient Undirected Shortest Paths","year":2003,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Computer science","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.000363524,0.001176132,0.0009890622,0.001183324,0.0009630233,0.001367986,0.002203424,0.0008567391,0.01073831],"category_scores_gemma":[0.003311669,0.0004229715,0.0005852696,0.002495796,0.0005163978,0.002001254,0.001983532,0.001007254,0.001714012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009816113,"about_ca_system_score_gemma":0.001597063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003313604,"about_ca_topic_score_gemma":0.007507436,"domain_scores_codex":[0.9993733,0.00009456289,0.00003092882,0.0001663216,0.0001594689,0.0001753376],"domain_scores_gemma":[0.998421,0.0006305212,0.000181166,0.0004155566,0.0001968209,0.0001549573],"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.001502097,0.0007134351,0.001769569,0.0008288645,0.00007459879,0.0003096121,0.0003138894,0.3579191,0.03158713,0.04898956,0.04497628,0.5110158],"study_design_scores_gemma":[0.0002431706,0.0003152901,0.0008946966,0.00005826623,0.00008805215,0.0002252257,0.0002970324,0.8685405,0.01671791,0.1006205,0.01196125,0.00003812392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2613412,0.00131009,0.6428105,0.001446261,0.000389232,0.0006222203,0.003459528,0.0064529,0.08216801],"genre_scores_gemma":[0.6285536,0.0006470989,0.3415829,0.0002572376,0.0001055717,0.0002561437,0.002895448,0.0008848784,0.02481716],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01073831,"threshold_uncertainty_score":0.03592324,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01292407772804119,"score_gpt":0.2385294829690806,"score_spread":0.2256054052410394,"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."}}