{"id":"W4360844228","doi":"10.1080/24725854.2023.2193835","title":"Routing and wavelength assignment with protection: A quadratic unconstrained binary optimization approach enabled by Digital Annealer technology","year":2023,"lang":"en","type":"article","venue":"IISE Transactions","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Quadratic unconstrained binary optimization; Heuristics; Computer science; Routing and wavelength assignment; Suite; Integer programming; Mathematical optimization; Routing (electronic design automation); Set (abstract data type); Quantum computer; Algorithm; Computer network; Mathematics; Wavelength-division multiplexing; Quantum","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.0007009382,0.0006147798,0.0006826278,0.0003895116,0.0002980533,0.0008158572,0.0008698297,0.0007080751,0.002669398],"category_scores_gemma":[0.001279442,0.0003697521,0.0004898623,0.000579044,0.0005575981,0.0008903858,0.0007818908,0.00132736,0.0001812781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008089857,"about_ca_system_score_gemma":0.0009819991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003925642,"about_ca_topic_score_gemma":0.003816884,"domain_scores_codex":[0.999678,0.0001257063,0.000008462551,0.00005506086,0.00008056965,0.0000521834],"domain_scores_gemma":[0.9995219,0.000329427,0.00005023812,0.00002930115,0.00004208197,0.00002703777],"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.00003868599,0.0000394446,0.0001644877,0.00006212133,0.00001387472,0.000033017,0.00002546832,0.9619605,0.001320215,0.01933294,0.0007014815,0.01630783],"study_design_scores_gemma":[0.000006940151,0.00002115324,0.00004564265,0.000004809191,0.000003549949,0.00000869297,0.000006732343,0.9955147,0.0002790047,0.003343664,0.0007623007,0.000002805283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0694445,0.0008511321,0.9120372,0.0006781908,0.00007440408,0.0000993439,0.0001411688,0.0002772801,0.0163969],"genre_scores_gemma":[0.6217754,0.000533202,0.368575,0.000227646,0.00003307364,0.0001641943,0.0001850853,0.0001056813,0.00840077],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003925642,"threshold_uncertainty_score":0.008930027,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008127095850712583,"score_gpt":0.1841998493555504,"score_spread":0.1760727535048378,"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."}}