{"id":"W2068360111","doi":"10.48550/arxiv.1303.2735","title":"Efficient Codes for Limited View Adversarial Channels","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Code word; Decoding methods; Computer science; List decoding; Code (set theory); Adversary; Adversary model; Construct (python library); Adversarial system; Theoretical computer science; Error detection and correction; Algorithm; Concatenated error correction code; Block code; Computer network; Computer security; Artificial intelligence","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.002268499,0.0009916697,0.0009490285,0.0009384074,0.0007614212,0.001871703,0.001856616,0.001377262,0.003296241],"category_scores_gemma":[0.01300407,0.0005519934,0.0006919242,0.00106211,0.002340344,0.003061593,0.002858326,0.002914023,0.0009488417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002037114,"about_ca_system_score_gemma":0.002333941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001383191,"about_ca_topic_score_gemma":0.001377001,"domain_scores_codex":[0.9967666,0.001040661,0.000147539,0.000372652,0.00115327,0.0005192541],"domain_scores_gemma":[0.9863697,0.007204318,0.001725823,0.002606326,0.001674582,0.000419216],"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.0001304928,0.00003691785,0.0002645338,0.00007930135,0.00002275641,0.0001132151,0.0001701983,0.2340355,0.003502904,0.7391114,0.002003538,0.0205292],"study_design_scores_gemma":[0.00003780102,0.00007756503,0.00007978534,0.00004569582,0.00001291741,0.00009221042,0.0000300454,0.7485661,0.002571802,0.2445501,0.003902525,0.00003346348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01407741,0.0003028498,0.9796023,0.000388113,0.00005983552,0.00008413797,0.0001436512,0.0002572607,0.005084494],"genre_scores_gemma":[0.7145554,0.001066731,0.270015,0.0004952722,0.0002262435,0.0006617812,0.0004385087,0.0002235287,0.01231752],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003296241,"threshold_uncertainty_score":0.01478034,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1232927831643639,"score_gpt":0.2235186055312706,"score_spread":0.1002258223669067,"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."}}