{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001878176,0.000509826,0.0004386053,0.0009717613,0.0005074537,0.0007225715,0.0007065897,0.0009630155,0.0007449542],"category_scores_gemma":[0.01580678,0.0003156782,0.0003288516,0.0007295919,0.001627998,0.002472508,0.000986816,0.0009109569,0.00007404149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001944369,"about_ca_system_score_gemma":0.0009710912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005464883,"about_ca_topic_score_gemma":0.002684585,"domain_scores_codex":[0.9992177,0.000306717,0.0000214001,0.00007050355,0.0002066212,0.0001769017],"domain_scores_gemma":[0.9829383,0.01475403,0.0009925544,0.000552875,0.0005275717,0.0002346846],"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.00005190478,0.00003118836,0.0009084782,0.00003120023,0.0000132266,0.00006288336,0.00005800671,0.9694937,0.002239499,0.02379929,0.0002347113,0.003075974],"study_design_scores_gemma":[0.000003571831,0.00001585774,0.0002893561,0.000003144645,0.000003547136,0.00001922306,0.00001890558,0.9909222,0.0004012761,0.00825551,0.00006209807,0.00000520416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6740409,0.0009257226,0.3150003,0.001959295,0.00005256779,0.0000601231,0.0001385195,0.0001792696,0.00764342],"genre_scores_gemma":[0.9930703,0.000251221,0.006133051,0.0000321015,0.0000181443,0.00002076611,0.00002451574,0.00001476239,0.0004351332],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005464883,"threshold_uncertainty_score":0.01410741,"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."}}