{"id":"W2143797026","doi":"10.1145/1099384.1099394","title":"Optimal peer selection for minimum-delay peer-to-peer streaming with rateless codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Peer-to-peer; Upload; Linear network coding; Computer network; Latency (audio); Scheme (mathematics); Live streaming; Bandwidth (computing); Selection (genetic algorithm); Distributed computing; Coding (social sciences); Telecommunications","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.0008562231,0.0004021894,0.0003861132,0.000404882,0.0002974889,0.0005243063,0.001581062,0.0002011958,0.0000269981],"category_scores_gemma":[0.0002730434,0.0003318138,0.00008594526,0.00130857,0.00006553568,0.0007877089,0.0004345252,0.000265995,0.0001505909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002202848,"about_ca_system_score_gemma":0.0001330491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006133379,"about_ca_topic_score_gemma":0.0006713885,"domain_scores_codex":[0.996452,0.00003557588,0.0003802048,0.0009841759,0.001194325,0.0009537065],"domain_scores_gemma":[0.9970827,0.0002050333,0.0001056583,0.0007635874,0.001601961,0.000241122],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002727779,0.0003621671,0.002180529,0.00003498554,0.0001993792,0.00002621073,0.002516348,0.2202875,0.006407743,0.02588968,0.4420444,0.2997783],"study_design_scores_gemma":[0.001448176,0.001617854,0.0009943135,0.00006648194,0.00004205527,0.000162253,0.0006336797,0.5157899,0.1052622,0.0003399157,0.3723122,0.001331044],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2260188,0.00001596979,0.7349996,0.03477619,0.0001830629,0.0006582083,0.00001024641,0.001464715,0.001873249],"genre_scores_gemma":[0.4620306,8.669841e-7,0.5133449,0.000623299,0.0001796939,0.0001565973,0.000009390493,0.00002869824,0.02362592],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2984473,"threshold_uncertainty_score":0.9999134,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01646000167033505,"score_gpt":0.2667493955411988,"score_spread":0.2502893938708637,"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."}}