{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001010523,0.00006180152,0.00005156739,0.00008427131,0.0001198548,0.0001040353,0.0003629458,0.00002047176,0.00006341706],"category_scores_gemma":[0.000006132175,0.00004957922,0.0000180425,0.0004779107,0.00001891327,0.0002672088,0.00006612535,0.0000533689,0.00008888247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001854275,"about_ca_system_score_gemma":0.00000827622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002106565,"about_ca_topic_score_gemma":0.00003873653,"domain_scores_codex":[0.99948,0.00003862031,0.00009096944,0.0001559585,0.0001370065,0.00009743032],"domain_scores_gemma":[0.9994095,0.00005757454,0.0000341529,0.0003570318,0.0000947232,0.00004702802],"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.000002743225,0.0001684901,0.0002700876,0.000003956267,0.00002195724,0.000004844486,0.0004586544,0.004801012,0.0001669845,0.3085836,0.006111449,0.6794062],"study_design_scores_gemma":[0.0007183121,0.0002068315,0.003843025,0.00001848959,0.000006546076,0.0000716343,0.00003082999,0.958599,0.002632836,0.006118219,0.02743104,0.0003232472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006921983,0.0002256908,0.9694459,0.001582065,0.00005459824,0.00008346483,3.334935e-7,0.0001354656,0.02155044],"genre_scores_gemma":[0.4928644,0.00005009022,0.5043781,0.0005984901,0.00002558808,0.00001221435,0.000007741599,0.00000349325,0.002059864],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.953798,"threshold_uncertainty_score":0.2021782,"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."}}