{"id":"W2119888753","doi":"10.1109/icpads.2008.119","title":"An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Brock University","funders":"","keywords":"Disjoint sets; Hypercube; Algorithm; Routing (electronic design automation); Computer science; Combinatorics; Discrete mathematics; Mathematics; Computer network","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.0008582507,0.001460045,0.001020983,0.001245463,0.001170695,0.001728938,0.001879891,0.001191979,0.007659822],"category_scores_gemma":[0.002674252,0.000647278,0.001025586,0.001923057,0.000681004,0.004297908,0.002074876,0.001403215,0.003582765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001078656,"about_ca_system_score_gemma":0.002314539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00299715,"about_ca_topic_score_gemma":0.004099664,"domain_scores_codex":[0.9987615,0.0003208576,0.00009230164,0.0002929284,0.0004138203,0.00011855],"domain_scores_gemma":[0.9991492,0.0002468396,0.00007133871,0.00023636,0.0002432395,0.00005297511],"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.0005374367,0.0003006168,0.000630684,0.0008743606,0.0001794002,0.000277679,0.0002923461,0.2230791,0.01759005,0.06808029,0.04375739,0.6444006],"study_design_scores_gemma":[0.0003270431,0.0003709983,0.0003618933,0.00008430339,0.00008517333,0.000461843,0.0002110897,0.7928959,0.01448036,0.1064995,0.08411779,0.0001042013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008114768,0.001212156,0.9778685,0.0005410501,0.0002369369,0.0002434916,0.0004484943,0.003055828,0.008278836],"genre_scores_gemma":[0.04324193,0.0009571909,0.9471069,0.000166774,0.00009967406,0.0003585285,0.001228494,0.0003410701,0.006499531],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007659822,"threshold_uncertainty_score":0.02562463,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02663193620876906,"score_gpt":0.2457065118465992,"score_spread":0.2190745756378301,"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."}}