{"id":"W3168672666","doi":"10.48550/arxiv.2008.11924","title":"Routing and Wavelength Assignment with Protection: A Quadratic Unconstrained Binary Optimization Approach","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Binary number; Quadratic equation; Routing (electronic design automation); Mathematical optimization; Wavelength; Routing and wavelength assignment; Computer science; Mathematics; Computer network; Materials science; Wavelength-division multiplexing; Optoelectronics; Arithmetic","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.001219674,0.001239462,0.001243887,0.0006746073,0.0003960755,0.001440876,0.001422784,0.001527087,0.00672954],"category_scores_gemma":[0.002729375,0.0006667763,0.0007333611,0.001252081,0.0007188531,0.00110566,0.001094569,0.001842088,0.0006108382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001074446,"about_ca_system_score_gemma":0.001749477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005842395,"about_ca_topic_score_gemma":0.004817505,"domain_scores_codex":[0.9992564,0.000318549,0.00001913308,0.0001219296,0.0001675423,0.0001163927],"domain_scores_gemma":[0.9988571,0.0008443189,0.00008553957,0.00004618996,0.0001079932,0.00005890081],"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.00004238694,0.00005864853,0.0001776757,0.0001077431,0.00002189906,0.00004102934,0.00002207261,0.9659722,0.000390239,0.01647501,0.001971108,0.01471999],"study_design_scores_gemma":[0.00001447353,0.00001735242,0.0000564707,0.00000907366,0.000004944332,0.00001106221,0.000008866725,0.9933308,0.00008829962,0.005566254,0.0008894029,0.000002987015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02066801,0.001285139,0.958097,0.001075125,0.0001324887,0.0001325413,0.0003662425,0.0003190837,0.0179243],"genre_scores_gemma":[0.4116654,0.001231745,0.5691032,0.0007394789,0.000171712,0.0005155841,0.0009723823,0.0003310902,0.01526954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00672954,"threshold_uncertainty_score":0.02251256,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04847092664388439,"score_gpt":0.1571429970220285,"score_spread":0.1086720703781441,"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."}}