{"id":"W1509547215","doi":"10.1023/a:1011454709330","title":"A Heuristic-Based Wormhole Routing Algorithm for Hypercube Multicomputer Networks","year":2001,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"King Fahd University of Petroleum and Minerals; University of Toronto; University of Saskatchewan","keywords":"Computer science; Hypercube; Node (physics); Routing (electronic design automation); Fault tolerance; Path (computing); Fault (geology); Routing algorithm; Adaptive routing; Algorithm; Parallel computing; Distributed computing; Computer network; Link-state routing protocol; Routing protocol","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006921735,0.0004250787,0.0007654743,0.0008261753,0.0008388746,0.0006569358,0.001531143,0.0008206555,0.002197355],"category_scores_gemma":[0.001889845,0.0003838114,0.0003001596,0.0009325204,0.0004627791,0.001025798,0.0007578557,0.0004626801,0.0002713204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006346633,"about_ca_system_score_gemma":0.001052122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002962881,"about_ca_topic_score_gemma":0.004627697,"domain_scores_codex":[0.999731,0.00008427437,0.00001328529,0.00003547794,0.00009384225,0.00004222768],"domain_scores_gemma":[0.9994293,0.0002163524,0.0000585426,0.00008124061,0.0001701225,0.00004443373],"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.000467193,0.0001690225,0.000798994,0.0001701675,0.00008892162,0.00009159131,0.000100911,0.6612029,0.008177295,0.02012821,0.005193383,0.3034113],"study_design_scores_gemma":[0.00005588817,0.00008243274,0.000129859,0.000007231891,0.00001817355,0.00003738114,0.00002069109,0.9914437,0.001523838,0.005264136,0.001404802,0.00001174544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05733782,0.000657031,0.9353577,0.0003490374,0.0002436088,0.0001963171,0.00007326801,0.001042988,0.004742239],"genre_scores_gemma":[0.4559712,0.0003436677,0.538816,0.0001601166,0.00007598197,0.0002428278,0.0002131904,0.0001112547,0.004065647],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002962881,"threshold_uncertainty_score":0.007350862,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01812805781582818,"score_gpt":0.2501036426428538,"score_spread":0.2319755848270256,"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."}}