{"id":"W1616062690","doi":"10.1109/hicss.1997.667213","title":"Graph algorithms with small communication costs","year":2002,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Computer science; Implementation; Workstation; Focus (optics); Parallel algorithm; Shortest path problem; Cost efficiency; Graph theory; Theoretical computer science; Graph; Communications system; Analysis of parallel algorithms; Algorithm design; Dijkstra's algorithm; Algorithm; Distributed computing; Parallel computing; Mathematics; Computer network","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.002689772,0.001271411,0.00113144,0.001235616,0.001258825,0.001887915,0.001646351,0.001348864,0.003639118],"category_scores_gemma":[0.01765688,0.0009088884,0.0008267975,0.002305021,0.001911092,0.005844101,0.001452024,0.002520568,0.0009249041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00211163,"about_ca_system_score_gemma":0.002569273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001566879,"about_ca_topic_score_gemma":0.002236599,"domain_scores_codex":[0.9961464,0.00142019,0.0002196611,0.0006898686,0.001132111,0.0003915902],"domain_scores_gemma":[0.9869483,0.008752982,0.0007843848,0.002502588,0.000784221,0.0002274964],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004797904,0.0003703105,0.001410893,0.0006409984,0.0001314475,0.00006410787,0.0001715243,0.615852,0.009112992,0.2116632,0.005710155,0.1543926],"study_design_scores_gemma":[0.0002419671,0.00023975,0.0004971693,0.00004403355,0.00008292558,0.00007997479,0.00007462274,0.7485561,0.006862215,0.2323533,0.01093771,0.00003022658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06831339,0.003109107,0.9106916,0.002157445,0.0001638433,0.000263232,0.00008850182,0.0008372474,0.01437569],"genre_scores_gemma":[0.3770405,0.002931203,0.6120391,0.0005733643,0.0003165307,0.0007119473,0.0003154735,0.000514246,0.005557558],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003639118,"threshold_uncertainty_score":0.01532102,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03267049712825272,"score_gpt":0.2221342725873624,"score_spread":0.1894637754591097,"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."}}