{"id":"W2381997082","doi":"","title":"A Large-capacity Real-time Data Transmission Scheduling Algorithm for P2P Distribution Network","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Upload; Scheduling (production processes); Distributed computing; Computer network; Algorithm; Real-time computing; Mathematical optimization; Operating system","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005921757,0.000260693,0.0003167712,0.00004685829,0.001042853,0.0001792611,0.002352319,0.0001396814,0.000004632982],"category_scores_gemma":[0.000001121799,0.0002656208,0.0001290431,0.0006625924,0.00005208862,0.0003979834,0.0005370742,0.0001719118,0.000123302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007737209,"about_ca_system_score_gemma":0.0001185442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002221312,"about_ca_topic_score_gemma":8.468733e-7,"domain_scores_codex":[0.9975956,0.0000854934,0.0005020315,0.0009680122,0.0002234717,0.0006253611],"domain_scores_gemma":[0.9979109,0.0001833632,0.0001921699,0.001328594,0.0001945925,0.0001903859],"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.00001327413,0.001008895,0.0002011965,0.0001428985,0.0001950713,0.000009739471,0.0009604067,0.009154337,0.003037667,0.03537788,0.1748245,0.7750742],"study_design_scores_gemma":[0.0003480085,0.00001928383,0.0001676694,0.00002698297,0.000009299643,0.00005530681,0.000001992221,0.5393921,0.00008990238,0.001078857,0.4586095,0.0002010763],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004849457,0.0001420221,0.9962853,0.0003561646,0.0000612765,0.001192359,0.0007049285,0.0006256502,0.0001473436],"genre_scores_gemma":[0.01129377,0.00003865473,0.9831876,0.0001309578,0.0008575071,0.000251747,0.004076827,0.00002174242,0.0001412234],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7748731,"threshold_uncertainty_score":0.9999796,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03405736700109474,"score_gpt":0.2627456715146181,"score_spread":0.2286883045135234,"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."}}