{"id":"W2108310473","doi":"10.1023/a:1009859026994","title":"Graph Algorithms with Small Communication Costs","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Theory of computation; Focus (optics); Shortest path problem; Parallel algorithm; Theoretical computer science; Cost efficiency; Graph theory; Communication complexity; Mathematical optimization; Graph; Algorithm; Parallel computing; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.000473323,0.0001060301,0.0001650185,0.0002013455,0.0001488929,0.0001854955,0.0005000698,0.0000591178,0.00005472496],"category_scores_gemma":[0.00003377568,0.00009021143,0.00005979585,0.0007339766,0.00002715582,0.0008900643,0.00002754018,0.000154898,0.000005567696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007802907,"about_ca_system_score_gemma":0.000141247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005853691,"about_ca_topic_score_gemma":5.848806e-7,"domain_scores_codex":[0.9988328,0.0001515773,0.0003938696,0.0001205302,0.0003847023,0.0001164722],"domain_scores_gemma":[0.9985485,0.0001018804,0.0003387837,0.0002480255,0.0006736211,0.00008920625],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008481308,0.0001594569,0.00003700002,0.000003027175,0.00003080271,0.000006206974,0.0001667123,0.9070481,0.00002303528,0.02795669,0.000355989,0.06412818],"study_design_scores_gemma":[0.006795771,0.001918908,0.0009090464,0.00017713,0.0000785107,0.0004398838,0.00003773443,0.9424536,0.001902281,0.03068432,0.01405901,0.0005438337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00793347,0.000218275,0.988638,0.0006550012,0.0008125282,0.0001144606,5.561743e-7,0.00003336139,0.001594387],"genre_scores_gemma":[0.2037506,0.0003350552,0.7953225,0.0001482101,0.000290144,0.000003739255,0.00001562728,0.00001131484,0.0001228626],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1958171,"threshold_uncertainty_score":0.3678715,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009833638694845234,"score_gpt":0.2207930325220085,"score_spread":0.2109593938271632,"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."}}