{"id":"W98190632","doi":"10.1007/s00453-003-1018-5","title":"Multicast Pull Scheduling: When Fairness Is Fine","year":2003,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Multicast; Unicast; Scheduling (production processes); Computer network; Distributed computing; Competitive analysis; Approximation algorithm; Parallel computing; Algorithm; Mathematical optimization; Upper and lower bounds; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01047113,0.0007076623,0.002127018,0.0008622733,0.002974586,0.005290375,0.002570725,0.003366233,0.008556717],"category_scores_gemma":[0.05685393,0.0008891379,0.0006001685,0.001047871,0.002867926,0.01090815,0.003728499,0.004200865,0.0006271605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001931338,"about_ca_system_score_gemma":0.00256876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001639388,"about_ca_topic_score_gemma":0.001858252,"domain_scores_codex":[0.996213,0.001426756,0.0001488901,0.0006889659,0.0005867255,0.0009356777],"domain_scores_gemma":[0.9740089,0.01849602,0.001383883,0.003030714,0.001414031,0.001666402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001862058,0.0003391448,0.005853156,0.0002506352,0.0001314472,0.0004360499,0.000803915,0.122654,0.003029058,0.7558997,0.02213622,0.0866045],"study_design_scores_gemma":[0.00008801359,0.00005581545,0.0005098386,0.000029048,0.00004060556,0.0001284813,0.0002779429,0.2346875,0.0008058666,0.7594009,0.003955331,0.00002065911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1927713,0.001520029,0.7419857,0.0156756,0.00147735,0.0001731818,0.0003352091,0.000892712,0.04516882],"genre_scores_gemma":[0.9581061,0.0002352347,0.03149791,0.0007503857,0.0005963668,0.00007760296,0.00005837407,0.0002012708,0.008476768],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01047113,"threshold_uncertainty_score":0.05537724,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02439670081495226,"score_gpt":0.2598636974486351,"score_spread":0.2354669966336828,"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."}}