{"id":"W2401760951","doi":"10.1109/lcomm.2016.2571691","title":"Optimal Polynomial Time Algorithm for Restoring Multicast Cloud Services","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Qatar National Research Fund","keywords":"Multicast; Computer science; Computer network; Unicast; Cloud computing; Distributed computing; Source-specific multicast; Data center; Pragmatic General Multicast; Network topology; Protocol Independent Multicast; Xcast; Node (physics); Multicast address; 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.0003579519,0.0001459304,0.0001433271,0.0001145761,0.0004486408,0.0001404919,0.003370147,0.00004080556,0.000002527533],"category_scores_gemma":[0.00001196067,0.0001154073,0.0001037055,0.0001839301,0.0001094417,0.00006941246,0.000917493,0.00009667823,0.0001389755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009819277,"about_ca_system_score_gemma":0.00001539969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003813703,"about_ca_topic_score_gemma":0.000003276127,"domain_scores_codex":[0.9988217,0.0001081779,0.0002540578,0.0003208566,0.0001692908,0.0003259038],"domain_scores_gemma":[0.9967667,0.0004661099,0.000116517,0.002512767,0.00005686836,0.00008096242],"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.00001401975,0.0002829386,0.0001315166,0.0000364121,0.0001850713,0.000006847795,0.002331291,0.004298159,0.04966669,0.001318341,0.03628511,0.9054436],"study_design_scores_gemma":[0.0009958463,0.00005351487,0.0002513665,0.0001308276,0.0000218941,0.000009973151,0.00003394205,0.8099086,0.001283443,0.00002975404,0.1869183,0.0003625441],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1041425,0.00009650337,0.8509591,0.04303145,0.0007076945,0.0003336633,0.00001019799,0.0003972156,0.0003216812],"genre_scores_gemma":[0.2469791,0.00001553239,0.7488856,0.002274362,0.0006443055,0.000108135,0.000004716432,0.00003106743,0.0010572],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.905081,"threshold_uncertainty_score":0.6262627,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02075487320331355,"score_gpt":0.2586445345679753,"score_spread":0.2378896613646618,"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."}}