{"id":"W2019604498","doi":"10.1117/12.774902","title":"<title>On meeting P2P streaming bandwidth demand with limited supplies</title>","year":2008,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Bandwidth (computing); Computer network; Bandwidth allocation; Server; Dynamic bandwidth allocation; Upload; Peer-to-peer; Overlay; Overlay network; Distributed computing; The Internet; Operating system","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005518626,0.0004005588,0.0005938182,0.0003244198,0.0005976716,0.0006565427,0.0007250386,0.0007170981,0.003061467],"category_scores_gemma":[0.001959481,0.0001192724,0.0001573066,0.0006852827,0.0004794514,0.001464784,0.0006336747,0.0006774318,0.001568343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004899474,"about_ca_system_score_gemma":0.0006181335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002494553,"about_ca_topic_score_gemma":0.001909485,"domain_scores_codex":[0.999718,0.00008060423,0.00001194376,0.00005058686,0.000104009,0.00003485076],"domain_scores_gemma":[0.9992151,0.0004316444,0.00004323282,0.00009666158,0.0001635152,0.00004976945],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003034821,0.0001478556,0.001084175,0.0003987661,0.0000268734,0.0003290299,0.0001600897,0.348939,0.03400527,0.05004795,0.03340958,0.531148],"study_design_scores_gemma":[0.00003285297,0.0001237467,0.0003180605,0.00002448829,0.000009712513,0.0001350997,0.00005145839,0.9621913,0.005658847,0.01274892,0.01868546,0.0000199842],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.04225334,0.002810947,0.9261282,0.001859064,0.0005141593,0.0001741173,0.00008728939,0.001620381,0.02455248],"genre_scores_gemma":[0.6899633,0.004850397,0.2795539,0.0005407872,0.0008674039,0.0002780219,0.0002797268,0.0004908415,0.02317569],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9969385,"threshold_uncertainty_score":0.01024163,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0108589330769297,"score_gpt":0.2083974745285193,"score_spread":0.1975385414515896,"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."}}