{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00126361,0.000400325,0.0008770014,0.001304691,0.0008429234,0.002613857,0.001250769,0.001194767,0.003509348],"category_scores_gemma":[0.01716221,0.0004655169,0.0005639876,0.001008888,0.001585034,0.003146347,0.00146875,0.001163593,0.0002662409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002288602,"about_ca_system_score_gemma":0.0009505701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001730346,"about_ca_topic_score_gemma":0.001008576,"domain_scores_codex":[0.9981646,0.000480724,0.00010692,0.0003070455,0.0006419692,0.0002987549],"domain_scores_gemma":[0.979937,0.01418184,0.002520883,0.001558748,0.001125019,0.000676405],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002882281,0.00004213717,0.004191459,0.0002007123,0.00006857289,0.0003532649,0.0002458586,0.828584,0.005608404,0.1411652,0.003155862,0.01609631],"study_design_scores_gemma":[0.00002495799,0.000027841,0.0009184146,0.00001307757,0.00001801901,0.0001727722,0.00006200156,0.800266,0.001449376,0.1959642,0.001068251,0.00001495071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7490353,0.001034373,0.2322907,0.004089332,0.00009732676,0.0001132867,0.0008951177,0.0005849709,0.01185965],"genre_scores_gemma":[0.9830303,0.0003934018,0.01402481,0.000128946,0.00006352781,0.00008868005,0.0004074797,0.00007375541,0.001789032],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003509348,"threshold_uncertainty_score":0.01660502,"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."}}