{"id":"W2611822227","doi":"10.48550/arxiv.1705.01596","title":"Capacity of Burst Noise-Erasure Channels With and Without Feedback and Input Cost","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Erasure; Binary erasure channel; Channel capacity; Entropy (arrow of time); Channel (broadcasting); Upper and lower bounds; Markov chain; Noise (video); Control theory (sociology); Markov process; Computer science; Mathematics; Topology (electrical circuits); Telecommunications; Combinatorics; Physics; Statistics","routes":{"ca_aff":true,"ca_fund":true,"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.000156718,0.0003006409,0.0004534361,0.0001719949,0.0001149765,0.00007227725,0.0006067429,0.0003220445,0.000005972287],"category_scores_gemma":[0.0000174067,0.000336839,0.00004656844,0.00009216167,0.0004467973,0.0002124417,0.0006428655,0.0006267131,0.000002019271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008562235,"about_ca_system_score_gemma":0.00003413163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002954034,"about_ca_topic_score_gemma":0.0001976459,"domain_scores_codex":[0.9991382,0.00005204484,0.0001512139,0.0004008249,0.00006768326,0.000190083],"domain_scores_gemma":[0.9982796,0.00004027484,0.0001904664,0.001210488,0.000153945,0.0001252625],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005721213,0.0004334215,0.6191863,0.007583676,0.002402479,0.0001422468,0.008984463,0.2957203,0.003987876,0.05460512,0.0008619126,0.005520065],"study_design_scores_gemma":[0.006462981,0.0004707014,0.1561184,0.0066132,0.001274204,0.0001088136,0.0008915692,0.756287,0.02606475,0.03401473,0.006211088,0.005482606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9791813,0.0002411235,0.01748639,0.00003800739,0.00007091317,0.000448449,0.00006848336,0.0003095904,0.002155725],"genre_scores_gemma":[0.9971148,0.0018587,0.0007943823,0.000007798062,0.00002417863,0.000002956145,0.00001609277,0.00004167699,0.0001394296],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4630679,"threshold_uncertainty_score":0.9999084,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06700782821878426,"score_gpt":0.1967173244308889,"score_spread":0.1297094962121046,"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."}}