{"id":"W4245416987","doi":"10.1002/net.20119","title":"Fault‐tolerant routings with minimum optical index","year":2006,"lang":"en","type":"article","venue":"Networks","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Fault tolerance; Graph; Construct (python library); Context (archaeology); Directed graph; Property (philosophy); Mathematics; Combinatorics; Algorithm; Theoretical computer science; Distributed 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.0004854468,0.000477473,0.000777363,0.00116203,0.000779879,0.001491735,0.0008745693,0.0007095213,0.001190879],"category_scores_gemma":[0.002578659,0.0004112508,0.000488978,0.0006604512,0.000707342,0.001596716,0.0008461992,0.0006136403,0.0002264547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009928145,"about_ca_system_score_gemma":0.0004418269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004918456,"about_ca_topic_score_gemma":0.000526834,"domain_scores_codex":[0.9993694,0.0001220631,0.00005295637,0.000105089,0.0002489272,0.0001015254],"domain_scores_gemma":[0.998674,0.0003439107,0.0003712601,0.0002992085,0.0002155412,0.00009623719],"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.0007562519,0.0002870128,0.002684188,0.0003287321,0.0001436151,0.0004209599,0.0004268317,0.4644022,0.05741818,0.352638,0.006696795,0.1137972],"study_design_scores_gemma":[0.00009699706,0.0002182534,0.001464849,0.00008945278,0.00007011125,0.0004127873,0.0001024404,0.6062453,0.03250309,0.3491725,0.009560475,0.0000637189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5618639,0.001006371,0.4169324,0.0007049027,0.0001254321,0.0001058196,0.00040234,0.0004178423,0.0184409],"genre_scores_gemma":[0.9140528,0.0002739861,0.08271547,0.0001465454,0.00005326346,0.00008190186,0.0003959715,0.00005412082,0.002225918],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001491735,"threshold_uncertainty_score":0.00720346,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.002279041484176839,"score_gpt":0.1524712854950641,"score_spread":0.1501922440108872,"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."}}