{"id":"W2107454418","doi":"10.1109/ipps.1995.395892","title":"Efficient routing and message bounds for optimal parallel algorithms","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Computer science; Routing algorithm; Routing (electronic design automation); Parallel algorithm; Algorithm; Ranking (information retrieval); Parallel computing; Message passing; Distributed computing; Theoretical computer science; Computer network; Routing protocol; Artificial intelligence","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.0002864979,0.00008385353,0.0001117675,0.00003520779,0.0001937503,0.0002547426,0.0001935448,0.0000408239,0.00003250963],"category_scores_gemma":[0.00001105158,0.00006687899,0.00004810517,0.00009248155,0.00001731215,0.00007988021,0.00008041813,0.00004765107,0.00001398224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001683382,"about_ca_system_score_gemma":0.000003591911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001650261,"about_ca_topic_score_gemma":0.00000310509,"domain_scores_codex":[0.9992138,0.00002175943,0.0001723312,0.0002580006,0.000103723,0.0002303674],"domain_scores_gemma":[0.9995978,0.00007785129,0.00004253889,0.0001784478,0.00004441307,0.00005894271],"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.000009351853,0.000174074,0.0002077349,0.00003840338,0.00006678096,0.00001551423,0.005010955,0.08770381,0.0001221473,0.7845652,0.02812097,0.09396513],"study_design_scores_gemma":[0.0002884736,0.00006855261,0.00003959578,0.000009321149,0.000001695979,0.0000298332,0.00007495444,0.9922671,0.00001988617,0.00007665338,0.007023927,0.000100053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007479092,0.0002106973,0.9839368,0.0004694179,0.0005132431,0.0001602251,5.887397e-7,0.0001098159,0.007120078],"genre_scores_gemma":[0.9077134,0.00000351435,0.0858807,0.0001603752,0.000146372,0.0000246008,2.985192e-7,0.00000533164,0.006065433],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9045632,"threshold_uncertainty_score":0.2727246,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02560494294952462,"score_gpt":0.2396294557583928,"score_spread":0.2140245128088682,"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."}}