{"id":"W2100899479","doi":"10.1109/icccn.2005.1523811","title":"A simple method for balancing network utilization and quality of routing","year":2006,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Routing (electronic design automation); Equal-cost multi-path routing; Path (computing); Shortest path problem; Simple (philosophy); Mathematical optimization; Static routing; Variation (astronomy); Path length; Computer network; Mathematics; Routing protocol; Theoretical computer science","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.0008929899,0.00005332992,0.0001253805,0.00002456006,0.000106418,0.00004073617,0.0001469056,0.00002369789,0.000003246428],"category_scores_gemma":[0.00004507702,0.00004943158,0.00003809136,0.0002294517,0.00001644722,0.0001282588,0.0001011288,0.00002568467,1.258747e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005706219,"about_ca_system_score_gemma":0.0000117058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005600476,"about_ca_topic_score_gemma":0.0001950261,"domain_scores_codex":[0.9993095,0.00006149575,0.0002252465,0.0001721674,0.00008737231,0.0001441567],"domain_scores_gemma":[0.9992639,0.0004139885,0.00008833591,0.0001590756,0.0000568334,0.00001785737],"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.000002112365,0.00001243197,0.005436702,0.0000214729,0.000003415614,5.54836e-8,0.00005792112,0.000798153,0.0002287047,0.9475353,0.0002217695,0.04568196],"study_design_scores_gemma":[0.000177843,0.00001975803,0.02542246,0.000007093141,0.000002070391,7.754862e-7,0.00001786403,0.7696336,0.001101134,0.2026761,0.0008725763,0.00006879299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004512618,0.00007634048,0.9937854,0.00006445798,0.00006557385,0.0001022475,0.00000191088,0.00005993739,0.001331519],"genre_scores_gemma":[0.3649324,0.000001357194,0.6349002,0.00006409299,0.00005573945,0.000003109397,0.000002769934,0.000001935532,0.00003831197],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7688354,"threshold_uncertainty_score":0.2015761,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07856902607221865,"score_gpt":0.3529619154026413,"score_spread":0.2743928893304227,"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."}}