{"id":"W1987604403","doi":"10.1109/tpds.2011.53","title":"Analyzing the Resilience-Complexity Tradeoff of Network Coding in Dynamic P2P Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Coding (social sciences); Computer network; Distributed computing; Peer-to-peer; Theoretical computer science; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0006035183,0.0001659923,0.0002842544,0.00008533223,0.0004090281,0.00007890464,0.0006753888,0.00007783551,0.000009748302],"category_scores_gemma":[0.000005256223,0.0001274605,0.00007664997,0.0009177916,0.0001645865,0.0002127107,0.00001145445,0.000324081,0.000002164119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005078042,"about_ca_system_score_gemma":0.00003118818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001116013,"about_ca_topic_score_gemma":0.00037581,"domain_scores_codex":[0.9983978,0.0003830545,0.0004838739,0.0002933402,0.000135387,0.0003065442],"domain_scores_gemma":[0.9988747,0.0002251936,0.0001542218,0.000601867,0.00006486302,0.0000792086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005143444,0.0001391022,0.0008773131,0.00002051215,0.00004691571,0.000004118856,0.001021008,0.9702023,0.0000543729,0.01958585,0.0001335276,0.007863598],"study_design_scores_gemma":[0.0003599572,0.00006121112,0.00910688,0.0001388501,0.00001185066,0.00001270598,0.0001844645,0.9895204,0.00001422112,0.0003373234,0.00009301786,0.0001590578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006005453,0.001423236,0.9913766,0.0001599177,0.0003415316,0.0002808642,0.00001341075,0.00006128063,0.0003377182],"genre_scores_gemma":[0.9975545,0.001251193,0.001059758,0.00002447568,0.00001597738,0.00004725963,0.000005051354,0.000006257063,0.00003557566],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.991549,"threshold_uncertainty_score":0.519769,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05830951086884093,"score_gpt":0.2650884598372928,"score_spread":0.2067789489684519,"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."}}