{"id":"W2339624507","doi":"10.1109/allerton.2015.7447126","title":"Erasure adversarial wiretap channels","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Code word; Secrecy; Computer science; Erasure; Upper and lower bounds; Adversary; Code (set theory); Channel (broadcasting); Decoding methods; Erasure code; Binary erasure channel; Constant (computer programming); Fraction (chemistry); Theoretical computer science; Algorithm; Computer network; Mathematics; Channel capacity; Computer security","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.00009487171,0.00007042184,0.00007839999,0.00003797219,0.00001341001,0.00002172389,0.000183718,0.00005156151,0.00004972979],"category_scores_gemma":[0.000008930533,0.00006139652,0.0000147639,0.00009377277,0.00001851609,0.0001281742,0.00002965708,0.00009730979,0.00007247725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003576121,"about_ca_system_score_gemma":0.00001246468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002217206,"about_ca_topic_score_gemma":0.00001985072,"domain_scores_codex":[0.9996371,0.00001278976,0.00007812175,0.0000566284,0.0001160696,0.00009933322],"domain_scores_gemma":[0.9995466,0.00001359392,0.000007576331,0.000309929,0.00005235148,0.00006987535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001575862,0.0002656424,0.003154546,0.0001710221,0.0004625733,0.00004685786,0.02111686,0.07449104,0.01063017,0.1253841,0.7096983,0.05442126],"study_design_scores_gemma":[0.002462291,0.0002559354,0.0005133088,0.00008081045,0.00003427339,0.00004659133,0.0008345376,0.1894196,0.1427838,0.006531456,0.6557678,0.001269612],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.196458,0.0008831318,0.2141932,0.001502595,0.0009558052,0.0006230836,0.000007652532,0.01240064,0.5729759],"genre_scores_gemma":[0.9914306,0.00001678666,0.008215668,0.00004842071,0.00006249373,0.00001748363,0.000005344078,0.00001903129,0.0001841713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7949726,"threshold_uncertainty_score":0.2503677,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03639348240407562,"score_gpt":0.238814332068982,"score_spread":0.2024208496649064,"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."}}