{"id":"W3112004248","doi":"10.1002/cpe.6124","title":"An efficient shortest path routing on the hypercube with blocking/faulty nodes","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Brock University","funders":"","keywords":"Hypercube; Shortest path problem; K shortest path routing; Constrained Shortest Path First; Computer science; Node (physics); Path (computing); Routing (electronic design automation); Shortest Path Faster Algorithm; Blocking (statistics); Yen's algorithm; Equal-cost multi-path routing; Fault tolerance; Longest path problem; Floyd–Warshall algorithm; Algorithm; Mathematics; Mathematical optimization; Link-state routing protocol; Theoretical computer science; Distributed computing; Parallel computing; Dijkstra's algorithm; Computer network; Routing protocol; Graph","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.0006124145,0.0004129829,0.0006392728,0.0006215791,0.0007144205,0.0007548929,0.000752032,0.0005873283,0.002673694],"category_scores_gemma":[0.001210257,0.0002239572,0.0004140004,0.001107255,0.0004567493,0.001602351,0.0008761937,0.000484811,0.0004005872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008263253,"about_ca_system_score_gemma":0.0007033277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002393711,"about_ca_topic_score_gemma":0.00180802,"domain_scores_codex":[0.9994229,0.0002520761,0.00003279443,0.00007396458,0.0001388964,0.0000793836],"domain_scores_gemma":[0.9993773,0.0002589267,0.00006823888,0.0001170288,0.00012444,0.00005401219],"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.0004765307,0.0001045353,0.0009770383,0.0002772415,0.00006265345,0.000380736,0.000200627,0.8245135,0.01908705,0.04162394,0.006496907,0.1057992],"study_design_scores_gemma":[0.00004636055,0.00007249497,0.000248919,0.000009805757,0.00000852573,0.00007514418,0.00008768028,0.9675382,0.004088707,0.02452808,0.00328277,0.00001336181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2145011,0.001095786,0.7692949,0.001499126,0.0001809916,0.0002549648,0.0004958618,0.001028228,0.01164904],"genre_scores_gemma":[0.5876047,0.0007458911,0.4034926,0.0001150355,0.000080702,0.0002182987,0.0006383569,0.00009845725,0.007005836],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002673694,"threshold_uncertainty_score":0.008944392,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03460719488136469,"score_gpt":0.2939545604482098,"score_spread":0.2593473655668451,"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."}}