{"id":"W2120769788","doi":"10.1142/s0129626403001446","title":"TRADE-OFFS BETWEEN LOAD AND DEGREE IN VIRTUAL PATH LAYOUTS","year":2003,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Network packet; Degree (music); Computer science; Upper and lower bounds; Path (computing); Routing (electronic design automation); Path length; Topology (electrical circuits); Mathematics; Distributed computing; Computer network; Combinatorics","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.0005153001,0.0001669338,0.0002259016,0.00009082718,0.0001356844,0.0002773067,0.0002996961,0.00007507953,0.000002880208],"category_scores_gemma":[0.00003027818,0.0001517823,0.00003713458,0.0002774323,0.00005074189,0.0004782548,0.0000417082,0.0002093697,0.00001135545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007005351,"about_ca_system_score_gemma":0.00005995169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002966257,"about_ca_topic_score_gemma":0.00001525117,"domain_scores_codex":[0.9985418,0.0001344363,0.0003051236,0.0004154856,0.0002468222,0.0003562993],"domain_scores_gemma":[0.9995278,0.00006553158,0.00009901491,0.000202653,0.00001958719,0.00008537982],"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.00007279876,0.0003412919,0.2078851,0.0005554592,0.0001551987,0.00059078,0.0505537,0.01427407,0.00533514,0.03733781,0.02474389,0.6581547],"study_design_scores_gemma":[0.01613431,0.001230197,0.3051215,0.003238256,0.0001060658,0.00128296,0.002691901,0.518514,0.001598447,0.008036136,0.1348522,0.007194047],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2282241,0.0005187492,0.764764,0.00320973,0.0003379544,0.0001619894,6.688331e-7,0.0001252941,0.002657617],"genre_scores_gemma":[0.9931219,0.000005128846,0.004870227,0.001791556,0.0001083844,0.00001466897,7.791157e-7,0.00001151446,0.000075809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7648979,"threshold_uncertainty_score":0.6189502,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03055834650736004,"score_gpt":0.2420784705909871,"score_spread":0.2115201240836271,"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."}}