{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004583381,0.0001011375,0.0001148147,0.00002659602,0.0005000863,0.0001146728,0.0005355053,0.00003716847,0.00001221952],"category_scores_gemma":[0.00001417249,0.00005861124,0.00009353933,0.0001489535,0.0000303454,0.0001337249,0.00006931955,0.00007461829,0.00001910527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002886056,"about_ca_system_score_gemma":0.00002660857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001064011,"about_ca_topic_score_gemma":0.00001912402,"domain_scores_codex":[0.9990143,0.00004237688,0.0002235627,0.0002886393,0.0001716988,0.0002594818],"domain_scores_gemma":[0.999105,0.0001960544,0.00004569059,0.0004876134,0.00009973423,0.00006594796],"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.000004994837,0.0003477399,0.0006463921,0.000005837093,0.00005590391,0.00003208349,0.006128523,0.06649636,0.0003890007,0.1317506,0.007794098,0.7863484],"study_design_scores_gemma":[0.0001091571,0.0000953117,0.0007805632,0.00000604778,0.000002310832,0.0001259532,0.0001920041,0.995926,0.0001648857,0.0000401073,0.002454156,0.0001035272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009329491,0.00006138413,0.9875945,0.0002820192,0.001263129,0.0002833771,0.000001604232,0.0001653545,0.001019155],"genre_scores_gemma":[0.9699832,0.000005208587,0.02867885,0.000391555,0.0004165455,0.00004537005,0.000001242431,0.000007865348,0.0004702185],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9606537,"threshold_uncertainty_score":0.384631,"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."}}