{"id":"W2971715728","doi":"10.1109/twc.2020.3018472","title":"Two-Layer Coded Channel Access With Collision Resolution: Design and Analysis","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Wireless Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Computer science; Decoding methods; Low-density parity-check code; Collision; Erasure; Binary erasure channel; Concatenated error correction code; Channel (broadcasting); Coding (social sciences); Random access; Algorithm; Transmission (telecommunications); Code (set theory); Computer network; Channel capacity; Block code; Telecommunications; Mathematics; 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","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0002248916,0.0006592786,0.0008906961,0.0009723091,0.0008041607,0.0002889266,0.003480345,0.0004819695,0.00001773302],"category_scores_gemma":[0.0000109928,0.0006904507,0.0002272217,0.002216342,0.000602659,0.0003899632,0.0001968925,0.002441621,0.00001792525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003174115,"about_ca_system_score_gemma":0.0001134408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001034085,"about_ca_topic_score_gemma":0.0004405066,"domain_scores_codex":[0.9974805,0.0003540472,0.0007090406,0.0006773873,0.0003835083,0.0003955872],"domain_scores_gemma":[0.9929839,0.0007588373,0.0002673275,0.005524495,0.0002717724,0.0001936549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006153143,0.0001368497,0.000008083167,0.00008245115,0.001139624,0.000002164415,0.0003498721,0.9916648,0.0004813047,0.0004865222,0.00008878591,0.005498013],"study_design_scores_gemma":[0.0006099788,0.00006952332,0.00008919721,0.0002466691,0.0008259321,0.000006025316,0.0002312711,0.9798872,0.01595469,0.001075748,0.0002433548,0.0007603501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003136958,0.001429853,0.9883166,0.002446431,0.0001467921,0.00121915,0.0003200734,0.002625924,0.0003582056],"genre_scores_gemma":[0.8870264,0.01640092,0.09459704,0.00008018295,0.00001356125,0.001544744,0.0001718702,0.0001311455,0.00003414124],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8937196,"threshold_uncertainty_score":0.9998598,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07659806777027618,"score_gpt":0.3092777321358041,"score_spread":0.2326796643655279,"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."}}