{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008252516,0.001105922,0.0011217,0.0007749759,0.0006332724,0.001644869,0.001867497,0.001826341,0.006641988],"category_scores_gemma":[0.00311367,0.0006014491,0.0007362394,0.001072764,0.0006345118,0.00164235,0.002133884,0.001709126,0.001062173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001070249,"about_ca_system_score_gemma":0.002305991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00240533,"about_ca_topic_score_gemma":0.004439184,"domain_scores_codex":[0.9992811,0.0001677674,0.00003066182,0.0001334918,0.0002566315,0.000130438],"domain_scores_gemma":[0.9992974,0.0003072708,0.00005381199,0.000124877,0.0001633681,0.00005331003],"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.0001129114,0.0001765169,0.0002996583,0.0002096598,0.00006056114,0.0001040514,0.00009386425,0.7506986,0.00940644,0.08890361,0.01263993,0.1372941],"study_design_scores_gemma":[0.00001142548,0.00001241055,0.00004598354,0.000007416393,0.000005682778,0.00001954321,0.00002418709,0.9721414,0.0004258966,0.02615565,0.001146655,0.00000365137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008095092,0.0002700551,0.9854715,0.0004259659,0.0001075333,0.00006055306,0.0001003052,0.0003948349,0.005074025],"genre_scores_gemma":[0.2062883,0.0003869083,0.7863872,0.0002217401,0.0001573379,0.0002250341,0.0003068991,0.0001695319,0.005856947],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006641988,"threshold_uncertainty_score":0.02221966,"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."}}