{"id":"W2463059319","doi":"10.1007/978-1-4615-1169-4_8","title":"Survivable Routing with Dynamic Traffic","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Spare part; Computer science; Disjoint sets; Computer network; Control reconfiguration; Path (computing); Routing (electronic design automation); Selection (genetic algorithm); Node (physics); Distributed computing; Connection (principal bundle); Adaptive routing; Computation; Mathematical optimization; Static routing; Algorithm; Routing protocol; Engineering; Mathematics; Operations management","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.0001129804,0.0008409888,0.0002921252,0.000486474,0.0003729017,0.0009559304,0.0006247039,0.0005138299,0.01233336],"category_scores_gemma":[0.0003026622,0.0003285354,0.0001937892,0.0007022865,0.0003884616,0.001706016,0.0005435067,0.001130776,0.004054117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005339599,"about_ca_system_score_gemma":0.0004028251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006692398,"about_ca_topic_score_gemma":0.001212136,"domain_scores_codex":[0.9999262,0.000006311962,0.000002540042,0.00001322669,0.00004492605,0.000006801792],"domain_scores_gemma":[0.9999132,0.00002812477,0.000004976318,0.00002446971,0.00002416436,0.000004928423],"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.0000256787,0.00004748104,0.00006760172,0.0002112543,0.00001081598,0.000128551,0.000138852,0.02018128,0.006902514,0.3111867,0.09426471,0.5668346],"study_design_scores_gemma":[0.000008126097,0.00003573693,0.0001386895,0.0001449322,0.00001885918,0.0004238324,0.00005426201,0.04739025,0.006512671,0.3156474,0.6296059,0.00001920819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.005368066,0.01110872,0.4349337,0.001583793,0.002082655,0.00007926658,0.0002208485,0.001861908,0.5427611],"genre_scores_gemma":[0.06641292,0.02304182,0.1459209,0.0007221253,0.0008318165,0.0001526684,0.0005864422,0.0006226879,0.7617086],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01233336,"threshold_uncertainty_score":0.04125923,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006932783765221108,"score_gpt":0.183779163968654,"score_spread":0.1768463802034329,"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."}}