{"id":"W2673438180","doi":"10.1109/tit.2018.2865936","title":"Adversarial Network Coding","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Adversarial system; Linear network coding; Computer science; Coding (social sciences); Hamming distance; Theoretical computer science; Point (geometry); Topology (electrical circuits); Algorithm; Mathematics; Computer network; Artificial intelligence; Combinatorics; Statistics","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.001158553,0.0002949251,0.000256577,0.0002903742,0.0007186522,0.0005048221,0.001548144,0.0002728614,0.0003214094],"category_scores_gemma":[0.00001879729,0.0003016903,0.0001999409,0.000409426,0.0001076893,0.001410072,0.00005997001,0.0009146826,0.0007759341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001770212,"about_ca_system_score_gemma":0.0002142684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002276279,"about_ca_topic_score_gemma":0.000005559466,"domain_scores_codex":[0.9981039,0.0003912631,0.0005972657,0.0002631894,0.0003339777,0.0003103628],"domain_scores_gemma":[0.9975585,0.0003013021,0.0003336621,0.001379248,0.0003182535,0.0001090292],"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.0001324056,0.00008465088,0.000001179457,0.00007057833,0.0001963684,9.41906e-7,0.005716766,0.273049,0.00001207162,0.2673016,0.01168733,0.4417471],"study_design_scores_gemma":[0.001666829,0.0002688961,0.00006756341,0.0008892227,0.0001038529,0.00002040538,0.0001895954,0.8237149,0.003533296,0.08064064,0.08724862,0.001656148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001151189,0.00005512296,0.9769335,0.0003699633,0.005914278,0.0003974718,0.00001992752,0.0005222285,0.01567235],"genre_scores_gemma":[0.9722313,0.00103214,0.02271816,0.002672717,0.0005370448,0.0001971731,0.00004313966,0.00002191265,0.0005464643],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9721161,"threshold_uncertainty_score":0.9999435,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02514351872247739,"score_gpt":0.2619332901767696,"score_spread":0.2367897714542923,"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."}}