{"id":"W2098374802","doi":"10.1109/icdcs.2011.49","title":"One More Weight is Enough: Toward the Optimal Traffic Engineering with OSPF","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Open Shortest Path First; Computer science; Traffic engineering; Maximization; Routing protocol; Mathematical optimization; Computer network; Routing (electronic design automation); Set (abstract data type); Distributed computing; Link-state routing protocol; Mathematics","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.0001164061,0.0001430781,0.0001338683,0.00003420897,0.00008130388,0.00007759495,0.0007721281,0.00004444698,0.0001630505],"category_scores_gemma":[0.000003056656,0.0000884416,0.00005097409,0.0002483149,0.00004508401,0.0002387197,0.00007366834,0.000152051,0.00007838556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001298042,"about_ca_system_score_gemma":0.00004324708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008917066,"about_ca_topic_score_gemma":0.000002802531,"domain_scores_codex":[0.9990367,0.00001546531,0.0001363293,0.0002860199,0.0002266421,0.0002988052],"domain_scores_gemma":[0.9993322,0.00004802415,0.0000338998,0.0004412408,0.0000523168,0.00009231667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006179381,0.0002490734,0.00009726744,0.00001702604,0.0002617568,0.00005327112,0.02346293,0.04132841,0.00004375529,0.1652322,0.004062927,0.7651296],"study_design_scores_gemma":[0.0005203497,0.000166161,0.001093926,0.00002042328,0.00002462226,0.00002795318,0.0001186349,0.9910908,0.0005038751,0.000024925,0.006135901,0.0002723968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0355248,0.0002574865,0.9516798,0.007660184,0.0002447576,0.000213419,7.10485e-7,0.0005522619,0.003866611],"genre_scores_gemma":[0.9348742,0.00001513823,0.06351848,0.000867999,0.0001223655,0.00002544281,3.739852e-7,0.00001075785,0.0005651847],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9497624,"threshold_uncertainty_score":0.3606544,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01844667453700867,"score_gpt":0.1805889414630052,"score_spread":0.1621422669259965,"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."}}