{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009317493,0.0003146659,0.0003968912,0.0001449813,0.0005671788,0.0005833771,0.0008823774,0.0001551684,0.000005780753],"category_scores_gemma":[0.00004426379,0.0002985042,0.000247341,0.0004402332,0.0000366705,0.0002803833,0.0003684154,0.0002815187,0.00002579233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001092052,"about_ca_system_score_gemma":0.00004319325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002819435,"about_ca_topic_score_gemma":0.000007054786,"domain_scores_codex":[0.9973657,0.0001614662,0.0006678608,0.0007419864,0.0002398155,0.0008232244],"domain_scores_gemma":[0.9979753,0.0007480803,0.0002445973,0.000616124,0.0002491495,0.0001666727],"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.00001429592,0.00009819967,0.0006495847,0.00002354946,0.00004216174,0.00003555704,0.0005257963,0.3872621,0.00001169828,0.001579364,0.002945773,0.6068119],"study_design_scores_gemma":[0.00122094,0.00009710078,0.0002047325,0.0001655856,0.000009794255,0.0001194894,0.00003583192,0.9896464,0.00001728868,0.0001051883,0.008002935,0.0003746622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00347586,0.0001026768,0.9907681,0.0004385712,0.003564209,0.0005369781,0.000001306515,0.0004982708,0.0006139912],"genre_scores_gemma":[0.6938377,0.000001036297,0.3021231,0.002059457,0.001735564,0.00001904504,0.000007888421,0.00003191454,0.0001842543],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6903619,"threshold_uncertainty_score":0.9999467,"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."}}