{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001738671,0.001255652,0.0009090711,0.001193997,0.0007463404,0.001809871,0.0023403,0.001650318,0.004780655],"category_scores_gemma":[0.0056044,0.0004565498,0.0009865937,0.001500132,0.002422581,0.002834804,0.003045625,0.003607871,0.0008045431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002255381,"about_ca_system_score_gemma":0.00132898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002008271,"about_ca_topic_score_gemma":0.001838127,"domain_scores_codex":[0.9980996,0.000837738,0.00007552495,0.0002893086,0.0005026349,0.0001951705],"domain_scores_gemma":[0.9968188,0.001987096,0.0002859106,0.0005281439,0.0002616455,0.0001184133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001827831,0.00001167987,0.00008666346,0.00004615365,0.00001466795,0.00007701328,0.00004433586,0.1977088,0.0006531532,0.7907222,0.001943477,0.008673586],"study_design_scores_gemma":[0.000006409826,0.00001919923,0.00004933347,0.00003122061,0.000009308782,0.00009120263,0.00001815207,0.6362861,0.0004013903,0.3571722,0.005897927,0.00001758202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001956141,0.0002838697,0.9873106,0.0003390821,0.0000741184,0.00004753604,0.0001851046,0.00007718863,0.009726254],"genre_scores_gemma":[0.5772312,0.003199582,0.3920929,0.0008298282,0.0004721669,0.001144038,0.0008696438,0.000158132,0.02400247],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004780655,"threshold_uncertainty_score":0.01636398,"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."}}