{"id":"W1998766420","doi":"10.1117/12.568640","title":"Linear programming as an optimization tool in survivable optical networks","year":2004,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Routing and wavelength assignment; Computer science; Integer programming; Routing (electronic design automation); Linear programming; Wavelength-division multiplexing; Computer network; Survivability; Assignment problem; Mathematical optimization; Distributed computing; Path (computing); Wavelength; Algorithm; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005671695,0.0004380809,0.0005284785,0.0001584706,0.00007323917,0.0001244883,0.001015525,0.00043289,0.00000850329],"category_scores_gemma":[0.0006570814,0.0004055862,0.000363573,0.0007510996,0.0002881626,0.001026706,0.0001776688,0.0006726775,0.000001859679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003535556,"about_ca_system_score_gemma":0.00002896305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008145532,"about_ca_topic_score_gemma":6.862032e-7,"domain_scores_codex":[0.9973245,1.662244e-8,0.0008870572,0.0004681272,0.0005940853,0.0007262757],"domain_scores_gemma":[0.9986804,0.0001323435,0.0001728579,0.0001044455,0.0007856398,0.0001243894],"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.00005551594,0.0001273136,0.0001438736,0.00020169,0.0001277076,4.012029e-7,0.00005502216,0.602797,0.02043874,0.3748788,0.00006474416,0.001109211],"study_design_scores_gemma":[0.001585885,0.0004819632,0.0002134309,0.0004415932,0.000083239,0.0000229627,0.0008818284,0.9649233,0.0246311,0.005368782,0.0007038175,0.000662119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.9883049,0.0001594043,0.008326665,0.0006049235,0.0002353917,0.000766513,0.000008938059,0.0005711245,0.001022163],"genre_scores_gemma":[0.3267969,0.0002510962,0.6722347,0.00003909582,0.0003092453,0.000216076,0.00001536587,0.0001127991,0.00002474335],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6639081,"threshold_uncertainty_score":0.9998396,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008911643802335107,"score_gpt":0.2264761610301753,"score_spread":0.2175645172278402,"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."}}