{"id":"W4242395338","doi":"10.1109/icppw.2004.1328030","title":"Constrained cost minimization for multipoint communication groups","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Minification; Span (engineering); Routing (electronic design automation); Range (aeronautics); Distributed computing; Quality of service; Path (computing); Mathematical optimization; Core (optical fiber); Computer network; Mathematics; Telecommunications; Engineering","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.0001799443,0.0000720789,0.00008356635,0.00003337603,0.0001212816,0.00008525607,0.0003942699,0.00004033298,0.00003478332],"category_scores_gemma":[0.00003248074,0.00006634695,0.000041237,0.0001012609,0.00003384698,0.0003070474,0.00004324863,0.00004349901,0.00003734466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002659808,"about_ca_system_score_gemma":0.00003178702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002362202,"about_ca_topic_score_gemma":0.0000425599,"domain_scores_codex":[0.9993954,0.00003793198,0.0001793551,0.0001646041,0.00008086826,0.0001418979],"domain_scores_gemma":[0.9991942,0.0002220625,0.00006032585,0.0003561267,0.0001131837,0.00005407609],"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.000006190532,0.00003366155,0.00001784721,0.000001308502,0.000005631323,6.871109e-8,0.0001103436,0.003376605,0.0000256244,0.2919607,0.003767905,0.7006941],"study_design_scores_gemma":[0.0009767349,0.0000227814,0.00009560191,0.000005602235,0.000003889572,0.000003030352,0.00002287436,0.9476171,0.0001209885,0.000596535,0.05044579,0.00008903511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004346112,0.00007858956,0.9850946,0.01011152,0.00008491903,0.0005111195,0.000001620211,0.0002490982,0.003433883],"genre_scores_gemma":[0.7414273,0.00001429264,0.2566703,0.001140247,0.0000734866,0.0001120509,0.00001363991,0.000003781604,0.0005448533],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9442405,"threshold_uncertainty_score":0.270555,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0152147214526496,"score_gpt":0.242980700357911,"score_spread":0.2277659789052614,"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."}}