{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002810546,0.0001360055,0.0001220753,0.00002009521,0.0004586146,0.0004317397,0.0002217856,0.00003298492,0.000004012665],"category_scores_gemma":[0.0001456889,0.00008754537,0.00001584049,0.0002386912,0.0000871379,0.000646436,0.00006078755,0.0001765828,0.00000516283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008062011,"about_ca_system_score_gemma":0.00003116088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000022192,"about_ca_topic_score_gemma":9.411929e-7,"domain_scores_codex":[0.9988147,0.0001708702,0.0002001413,0.0004257646,0.0002227971,0.0001657396],"domain_scores_gemma":[0.9989415,0.0005029561,0.0001419578,0.0001583937,0.0001372023,0.0001179745],"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.0002135586,0.0004178076,0.003258172,0.00003777392,0.00006410597,0.0001019193,0.2950883,0.09207137,0.0008915562,0.3552165,0.0004924766,0.2521465],"study_design_scores_gemma":[0.0001913749,0.0004516452,0.0006314924,0.00005171722,0.000007150279,0.00009539253,0.01044265,0.9864402,0.0001063061,0.00004115383,0.001377537,0.0001634279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5139677,0.0002188003,0.4819774,0.002716829,0.0001935394,0.0001488282,8.568903e-7,0.00007947245,0.0006966272],"genre_scores_gemma":[0.9958741,0.00003010563,0.001185544,0.002784237,0.00009509326,0.00002163656,0.000001382106,0.000004971458,0.000002897171],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8943688,"threshold_uncertainty_score":0.4163275,"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."}}