{"id":"W2125430046","doi":"10.1109/tnet.2014.2310735","title":"Minimum-Delay Multicast Algorithms for Mesh Overlays","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Computer science; Latency (audio); Network delay; Overlay network; Overlay; Computer network; Algorithm; Node (physics); Overlay multicast; Time complexity; Set (abstract data type); Distributed computing; Source-specific multicast; Pragmatic General Multicast","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006194698,0.000394594,0.0004042333,0.0003525744,0.000563375,0.0002740189,0.002246268,0.0002592168,0.000008972824],"category_scores_gemma":[0.00006031315,0.0004045178,0.0002497461,0.001038961,0.00008417367,0.0003394962,0.00004717855,0.000450587,0.00009713756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001923157,"about_ca_system_score_gemma":0.00004251466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000214517,"about_ca_topic_score_gemma":0.00006577958,"domain_scores_codex":[0.9970956,0.00008486318,0.0004659579,0.0009455588,0.0004458396,0.0009621208],"domain_scores_gemma":[0.9966804,0.001013146,0.0001285749,0.001822226,0.0001360144,0.0002195942],"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.00003575901,0.0001474466,0.00001981769,0.000016001,0.00008165999,0.000008945407,0.0002952616,0.06052446,0.0005083783,0.002353242,0.004488762,0.9315203],"study_design_scores_gemma":[0.0009430537,0.0005165883,0.00006076492,0.0001484925,0.00004596509,0.00003779525,0.00004564128,0.8695837,0.00355772,0.005798583,0.1185509,0.0007107164],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00170302,0.00006147958,0.9884854,0.002673122,0.004256081,0.0006360821,0.00001202208,0.001493128,0.0006796471],"genre_scores_gemma":[0.6311736,0.0000270606,0.3666528,0.0008471301,0.0006316061,0.0002543262,0.000002578056,0.00004752706,0.0003633308],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9308096,"threshold_uncertainty_score":0.9998407,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03939137206230865,"score_gpt":0.2829817486959558,"score_spread":0.2435903766336471,"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."}}