{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007261967,0.00008852412,0.000114982,0.000205989,0.0004395232,0.0004818352,0.0008817388,0.00002430559,0.00007730811],"category_scores_gemma":[0.00003083768,0.00006639583,0.00003086463,0.00136259,0.0002488601,0.0007403022,0.0001679047,0.0002345343,0.00007418875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002315143,"about_ca_system_score_gemma":0.00008887121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002135824,"about_ca_topic_score_gemma":0.00005340626,"domain_scores_codex":[0.9982347,0.0003760323,0.0001675867,0.0002686421,0.0005467423,0.0004062497],"domain_scores_gemma":[0.9989115,0.0002674258,0.00001666697,0.0004985426,0.000215984,0.00008986922],"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.000007086809,0.00003148758,0.00004097098,0.00001346775,0.0000292806,0.00001029317,0.0008771527,0.9475952,0.001493159,0.01124541,0.02934495,0.009311496],"study_design_scores_gemma":[0.0002443909,0.0002518466,0.0005083938,0.00004785057,0.000002708756,0.00001091324,0.00009103047,0.9965477,0.0003928004,0.000628026,0.001114667,0.0001596672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09799498,0.0000885107,0.8821607,0.01886964,0.00005333855,0.0006110819,0.000003099445,0.00005822644,0.0001604684],"genre_scores_gemma":[0.5761396,0.00001852647,0.4230166,0.0004051831,0.0001144714,0.0001790151,0.000004924443,0.00000871306,0.0001129598],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4781446,"threshold_uncertainty_score":0.4646348,"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."}}