{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002382838,0.001446759,0.00114932,0.001783427,0.001088216,0.001542569,0.002471365,0.001292599,0.004087882],"category_scores_gemma":[0.01112714,0.000512883,0.0006602404,0.001599607,0.001794211,0.002838127,0.002794167,0.002020092,0.001004521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001582766,"about_ca_system_score_gemma":0.001636601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005170129,"about_ca_topic_score_gemma":0.001079341,"domain_scores_codex":[0.9970106,0.0007216033,0.0001608626,0.0005399474,0.001372606,0.0001943633],"domain_scores_gemma":[0.9952176,0.001481113,0.0005306153,0.001727357,0.0007715296,0.0002718492],"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.0006246171,0.0005049604,0.001723697,0.0004108691,0.0001524899,0.0001731768,0.0003513327,0.1456252,0.1086483,0.2040083,0.009626435,0.5281506],"study_design_scores_gemma":[0.0002328953,0.0004653937,0.001026404,0.00004083662,0.00007502772,0.0005731558,0.00007274358,0.8566124,0.04289579,0.07391515,0.02398101,0.0001092227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01101261,0.00009039226,0.9849209,0.0002835507,0.00008921282,0.0002276891,0.00003724249,0.0006193524,0.002719041],"genre_scores_gemma":[0.2274361,0.0001195513,0.7647278,0.0002041804,0.00009174387,0.0006529878,0.00008772079,0.000284121,0.006395654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004087882,"threshold_uncertainty_score":0.01367539,"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."}}