{"id":"W2051229026","doi":"10.1016/j.orl.2013.04.011","title":"Network design with a discrete set of traffic matrices","year":2013,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Variety (cybernetics); Set (abstract data type); Scheme (mathematics); Time complexity; Computer science; Approximation algorithm; Network planning and design; Computational complexity theory; Polynomial; Mathematical optimization; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence; Computer network","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.001296419,0.0008606464,0.0009396681,0.0009903508,0.0006032285,0.002431656,0.002069448,0.001483107,0.002693101],"category_scores_gemma":[0.005656525,0.0007198052,0.0006646395,0.001061926,0.001093889,0.002224534,0.001262671,0.001688172,0.0004579825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001824246,"about_ca_system_score_gemma":0.001124094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001266286,"about_ca_topic_score_gemma":0.001591971,"domain_scores_codex":[0.9982475,0.000705414,0.00005816437,0.0003366885,0.0004644453,0.0001878226],"domain_scores_gemma":[0.996287,0.001941781,0.0004455044,0.0005013275,0.0005138934,0.0003105516],"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.0001675688,0.0001157635,0.0004151063,0.0001013346,0.00005315752,0.0001310893,0.00005385655,0.698648,0.004857791,0.2761223,0.001759636,0.01757447],"study_design_scores_gemma":[0.00002904199,0.00003049833,0.00005280671,0.000005990455,0.00001040368,0.00003758072,0.000008588971,0.9434586,0.0006054134,0.05522349,0.0005285619,0.000009116044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05736671,0.0001710423,0.9318622,0.0009068028,0.0001467461,0.00008380758,0.0002217395,0.0001525454,0.009088395],"genre_scores_gemma":[0.8584936,0.0003657326,0.133601,0.0002125333,0.0001854107,0.0001719757,0.0001399509,0.00004092401,0.006788834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002693101,"threshold_uncertainty_score":0.01323587,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07737951602445946,"score_gpt":0.3222089761203714,"score_spread":0.2448294600959119,"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."}}