{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001058065,0.0001403195,0.000155928,0.00003064929,0.00004962937,0.00003854459,0.00009809854,0.0001218071,0.00002909886],"category_scores_gemma":[0.00000129269,0.0001144752,0.00004158622,0.0001599882,0.00003853541,0.00005418867,0.000009994626,0.0002062946,0.00002323597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001606049,"about_ca_system_score_gemma":0.000003473242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001784334,"about_ca_topic_score_gemma":0.00003051778,"domain_scores_codex":[0.9992631,0.00001526785,0.0001673825,0.0001312773,0.0001112085,0.0003117652],"domain_scores_gemma":[0.9997077,0.00003747921,0.00001755356,0.0001663194,0.0000160477,0.00005487391],"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.00003172724,0.00002019093,0.005452085,0.00002188347,0.0000305969,0.00003468035,0.00006405059,0.979857,0.0001388854,0.006997321,0.005690248,0.00166129],"study_design_scores_gemma":[0.0007325246,0.00005925608,0.0120157,0.0001179265,0.00002509734,0.00006305514,0.0000841774,0.976029,0.0002429146,0.0005912549,0.009631994,0.0004070285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8345331,0.0005449635,0.1036715,0.00002106713,0.0004914483,0.0001485353,0.000001237943,0.0004773923,0.06011077],"genre_scores_gemma":[0.9989954,0.000002492016,0.0001297227,0.00003060705,0.0004833843,0.00001460073,0.000006977655,0.00003258975,0.0003042333],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1644623,"threshold_uncertainty_score":0.4668162,"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."}}