{"id":"W2792983298","doi":"10.1016/j.endm.2018.02.008","title":"Towards Optimal and Scalable Solution for Routing and Spectrum Allocation","year":2018,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Scalability; Computer science; Column generation; Routing (electronic design automation); Provisioning; Frequency allocation; Context (archaeology); Path (computing); Shortest path problem; Slicing; Mathematical optimization; Spectrum (functional analysis); Process (computing); Distributed computing; Computer network; Mathematics; Theoretical computer science","routes":{"ca_aff":true,"ca_fund":true,"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.0001940013,0.0001307786,0.000163268,0.00005270454,0.0000630549,0.00003112587,0.00008024903,0.00009049869,0.000003561104],"category_scores_gemma":[0.000221354,0.0001264936,0.00001562962,0.0001283295,0.0001306942,0.0001183319,0.00005942599,0.0001464997,0.000001961399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001174063,"about_ca_system_score_gemma":0.00001210843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002498955,"about_ca_topic_score_gemma":0.0000448155,"domain_scores_codex":[0.9991372,0.000004494448,0.0001922553,0.0001540208,0.00006544052,0.0004466156],"domain_scores_gemma":[0.9996543,0.0001340581,0.00002929224,0.0001425118,0.00001517516,0.00002468843],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005794262,0.00007747737,0.000419212,0.0009804537,0.0001280611,0.000001838448,0.001988548,0.02028193,0.01769406,0.8044628,0.0001015198,0.1538061],"study_design_scores_gemma":[0.0002048138,0.000137674,0.00006426698,0.00006098062,0.00001186137,0.000006449626,0.00005393998,0.8404213,0.008891921,0.1499275,0.000073024,0.0001462727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.215007,0.0005730519,0.7834391,0.0002372412,0.00003048575,0.0002410752,0.000001567636,0.0002272899,0.0002432437],"genre_scores_gemma":[0.7550951,0.0001584151,0.2446267,0.000005525997,0.00005018334,0.00002801489,0.000002591283,0.00002330535,0.00001010355],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8201393,"threshold_uncertainty_score":0.5158257,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00955144964890719,"score_gpt":0.2462729523968635,"score_spread":0.2367215027479563,"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."}}