{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002627719,0.0001298309,0.0001355554,0.00008921467,0.0001348916,0.0001914906,0.0005906733,0.00006603821,0.0003930113],"category_scores_gemma":[0.0001051015,0.0001207101,0.00005475723,0.0003240176,0.00004660517,0.0003619666,0.0001259711,0.0001571643,0.0006197652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000256121,"about_ca_system_score_gemma":0.00008376113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001317853,"about_ca_topic_score_gemma":0.000001589168,"domain_scores_codex":[0.9986951,0.0000813308,0.0002007937,0.0003834466,0.000285194,0.0003541522],"domain_scores_gemma":[0.999054,0.00005942712,0.00004715906,0.0005140632,0.0001554942,0.0001698635],"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.00000929311,0.0008088188,0.0006254005,0.00005871537,0.0001282489,0.0001294965,0.006939395,0.004198412,0.001101968,0.5542776,0.01913022,0.4125924],"study_design_scores_gemma":[0.0008318786,0.00007603442,0.00006870527,0.00001737321,0.00000500604,0.00004658143,0.00004120799,0.8748618,0.006249796,0.01127043,0.1061873,0.0003438458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000386855,0.00009360493,0.9861565,0.003274118,0.0002561272,0.0001674588,0.000003850191,0.0001731553,0.009488311],"genre_scores_gemma":[0.1070411,0.00001663478,0.8881649,0.001183097,0.00005453116,0.00002154303,0.000005654853,0.00001686606,0.003495657],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8706634,"threshold_uncertainty_score":0.7966034,"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."}}