{"id":"W2907843763","doi":"10.1109/candar.2018.00013","title":"An Efficient Shortest Path Routing on the Hypercube with Blocking/Faulty Nodes","year":2018,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"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); Shortest Path Faster Algorithm; Path (computing); Routing (electronic design automation); Yen's algorithm; Euclidean shortest path; Equal-cost multi-path routing; Blocking (statistics); Longest path problem; Mathematics; Algorithm; Combinatorics; Theoretical computer science; Link-state routing protocol; Dijkstra's algorithm; Routing protocol; Computer network; 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.0005445575,0.0001196985,0.0001016554,0.00003221056,0.0003757027,0.0002789791,0.0005793259,0.00003621318,0.00004368195],"category_scores_gemma":[0.0000145562,0.00005810018,0.00003240262,0.0002370016,0.00005924165,0.00009927062,0.00006293519,0.0001076666,0.00008661126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002709301,"about_ca_system_score_gemma":0.00002202707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001147796,"about_ca_topic_score_gemma":0.00008693052,"domain_scores_codex":[0.9989111,0.00008647752,0.000157275,0.0003365234,0.0002542073,0.0002543533],"domain_scores_gemma":[0.9990044,0.0001098834,0.0000536811,0.0006317043,0.0001402045,0.00006011865],"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.0000420842,0.0004657744,0.007460111,0.000004272734,0.00006347978,0.00003194295,0.008680597,0.04884057,0.001634617,0.9066555,0.00461825,0.02150281],"study_design_scores_gemma":[0.00008690906,0.0004360505,0.001785491,0.00004727151,0.000002245689,0.00004124911,0.000357244,0.9951342,0.001041585,0.00003582001,0.0009013088,0.0001305679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5789075,0.000004324962,0.3991039,0.000430269,0.0004713495,0.000127223,3.808972e-7,0.000183197,0.02077175],"genre_scores_gemma":[0.9967008,2.91867e-7,0.001558759,0.001046497,0.0004127685,0.000008386583,3.559581e-7,0.000008092812,0.0002640699],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9462937,"threshold_uncertainty_score":0.2889639,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01792943788406481,"score_gpt":0.2375107327106215,"score_spread":0.2195812948265567,"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."}}