{"id":"W2949999231","doi":"10.1002/rsa.20163","title":"Routing complexity of faulty networks","year":2007,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Hypercube; Computer science; Routing (electronic design automation); Equal-cost multi-path routing; Static routing; Link-state routing protocol; Upper and lower bounds; Distributed computing; Theoretical computer science; Mathematics; Routing protocol; Parallel computing; 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.0004644616,0.0001401271,0.0003772738,0.00003048722,0.0001079564,0.00001959388,0.00009253845,0.00008494607,0.00004291059],"category_scores_gemma":[0.0005334249,0.0001039177,0.00005530315,0.0001001101,0.0001308708,0.00002783664,0.00005462136,0.00014834,2.20305e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008364193,"about_ca_system_score_gemma":0.00000976726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002563141,"about_ca_topic_score_gemma":0.00001289683,"domain_scores_codex":[0.9989825,0.00001888259,0.0003666285,0.0001762887,0.0001883942,0.0002673318],"domain_scores_gemma":[0.9986241,0.0009244729,0.0001480296,0.0001249955,0.00007884729,0.00009959617],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000213015,0.00002005337,0.00003161977,0.0001027177,0.00004157776,0.000009052524,0.0002001222,0.00002255208,0.0000837035,0.9205216,0.00007004882,0.07868396],"study_design_scores_gemma":[0.002460065,0.00007064737,0.0008933407,0.00003788746,0.00005089303,0.00003404419,0.0001687863,0.08806401,0.0004877011,0.9075334,0.00004765609,0.0001515492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01967974,0.0002473433,0.9791921,0.00002330768,0.0001901955,0.0001617269,0.00002846211,0.00003207851,0.0004450276],"genre_scores_gemma":[0.877288,0.00001868174,0.1224652,0.00003389452,0.000157579,0.000001447659,0.000004500522,0.00001234547,0.00001839599],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8576083,"threshold_uncertainty_score":0.4237643,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05136076555920528,"score_gpt":0.3298675291891993,"score_spread":0.278506763629994,"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."}}