{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000565615,0.0006262754,0.0007746595,0.0005996001,0.0008231555,0.0008046819,0.0008788003,0.0006459604,0.002239236],"category_scores_gemma":[0.00102895,0.0002876044,0.0005028649,0.001301489,0.0005248052,0.001764756,0.001093035,0.0005317939,0.0003569153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008118141,"about_ca_system_score_gemma":0.0008324276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002142505,"about_ca_topic_score_gemma":0.001570494,"domain_scores_codex":[0.9994301,0.0002364222,0.0000275091,0.00009146059,0.0001360419,0.00007840173],"domain_scores_gemma":[0.9996067,0.000158016,0.00005563213,0.00006525502,0.00007465987,0.00003974033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003303062,0.0001172835,0.000715146,0.0003701685,0.00006498113,0.0004265676,0.0002291659,0.8175061,0.0179151,0.05672917,0.005780539,0.09981554],"study_design_scores_gemma":[0.00005038293,0.0001048859,0.0002337474,0.00001252618,0.00001169387,0.0001097124,0.00009472646,0.9637938,0.003922491,0.02760275,0.004044032,0.00001919585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1003157,0.001227234,0.8867636,0.0009714057,0.0001554049,0.0003029876,0.0003889625,0.0007039652,0.009170787],"genre_scores_gemma":[0.4205036,0.001442457,0.5691159,0.0001381405,0.0001108866,0.0003912371,0.000682179,0.0001052685,0.007510305],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002239236,"threshold_uncertainty_score":0.007490933,"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."}}