{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004074824,0.00180315,0.00137253,0.002389915,0.001889945,0.005288651,0.002704383,0.001828746,0.01062903],"category_scores_gemma":[0.03371528,0.001216128,0.0008643286,0.00287916,0.002544264,0.008726076,0.004025551,0.003677525,0.003125273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003743686,"about_ca_system_score_gemma":0.002967982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001935457,"about_ca_topic_score_gemma":0.00270396,"domain_scores_codex":[0.9933596,0.002055547,0.0003888058,0.0006551722,0.002698222,0.0008426766],"domain_scores_gemma":[0.9819795,0.0115879,0.001075828,0.002895678,0.002087987,0.0003730905],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004366111,0.0001607033,0.0004235794,0.0002721251,0.00003335789,0.0000633501,0.0001739869,0.3656782,0.004719648,0.5150111,0.01080581,0.1022215],"study_design_scores_gemma":[0.00007123806,0.00004928534,0.0001128026,0.00004245381,0.00002182319,0.000036352,0.00003889556,0.6693686,0.002977234,0.3193693,0.007894266,0.00001767776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01673876,0.001397613,0.9545177,0.001225039,0.0001666441,0.0001320606,0.0001772676,0.001704521,0.0239404],"genre_scores_gemma":[0.27616,0.001560661,0.7042523,0.0005562098,0.0006057104,0.001185194,0.0008311725,0.001635265,0.01321361],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01062903,"threshold_uncertainty_score":0.03555763,"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."}}