{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001040046,0.001934839,0.001764512,0.001043492,0.001405077,0.002528977,0.003225016,0.00205734,0.01345424],"category_scores_gemma":[0.004628018,0.0005598993,0.001061025,0.00166566,0.0009108316,0.002445492,0.001884299,0.002130665,0.003445564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002983345,"about_ca_system_score_gemma":0.004475419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005699818,"about_ca_topic_score_gemma":0.008545438,"domain_scores_codex":[0.9984706,0.0003089068,0.0000842633,0.000409962,0.0002504516,0.0004757856],"domain_scores_gemma":[0.9975544,0.001498893,0.0002343286,0.0003420711,0.0001921483,0.0001781683],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001757562,0.001175711,0.001880903,0.001525493,0.0001921677,0.000375202,0.0005642067,0.4265328,0.01607399,0.06464458,0.05835298,0.4269244],"study_design_scores_gemma":[0.0006010776,0.0002315301,0.0005196432,0.00005273803,0.0000611549,0.0002678593,0.000329247,0.9209237,0.002706348,0.06753576,0.006741152,0.00002977633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08695958,0.00157883,0.8589406,0.00288428,0.0003413534,0.001054761,0.001644075,0.00858087,0.03801577],"genre_scores_gemma":[0.4631504,0.0005312455,0.523913,0.0004669549,0.0001496905,0.0005623556,0.002764996,0.0006058743,0.007855544],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01345424,"threshold_uncertainty_score":0.0450089,"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."}}