{"id":"W3000733996","doi":"10.1109/tii.2020.2965952","title":"Spatially Coupled Codes via Partial and Recursive Superposition for Industrial IoT With High Trustworthiness","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"National Science Foundation, United Arab Emirates; Ministry of Science, ICT and Future Planning; National Natural Science Foundation of China","keywords":"Low-density parity-check code; Computer science; Superposition principle; Transmission (telecommunications); Computational complexity theory; Encoding (memory); Algorithm; Block (permutation group theory); Reduction (mathematics); Reliability (semiconductor); Code (set theory); Forward error correction; Theoretical computer science; Computer engineering; Decoding methods; Telecommunications; Mathematics; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000336612,0.0003139881,0.0004077268,0.0001666719,0.000374255,0.0002699823,0.0004564193,0.0004078592,0.0000123172],"category_scores_gemma":[0.00005212599,0.0002847266,0.00008553253,0.0006100824,0.0001081604,0.0007756461,0.000007877176,0.0007472729,0.000006281834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009694794,"about_ca_system_score_gemma":0.0002684605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000186394,"about_ca_topic_score_gemma":0.00005544118,"domain_scores_codex":[0.99819,0.00007669803,0.0006885459,0.000277746,0.0004117273,0.0003552625],"domain_scores_gemma":[0.9985083,0.0003819708,0.0003112981,0.0003293855,0.0002311825,0.0002378827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0110527,0.001047248,0.0003113824,0.0003499326,0.00106774,0.00003597177,0.04672195,0.2024818,0.003323798,0.006695183,0.006553365,0.7203589],"study_design_scores_gemma":[0.008738053,0.006085881,0.000009873157,0.0002729417,0.0002540568,0.00006144882,0.0005285227,0.865813,0.1151878,0.0004678361,0.001573012,0.00100756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1061349,0.000002303574,0.8895802,0.001586603,0.0008999142,0.001211573,0.00005335068,0.0005058093,0.00002527386],"genre_scores_gemma":[0.9500701,0.000007542851,0.04852206,0.0007331924,0.0004227172,0.0001892983,0.00001691516,0.00002754845,0.00001065886],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8439351,"threshold_uncertainty_score":0.9999605,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04816081336348197,"score_gpt":0.2489109470355923,"score_spread":0.2007501336721103,"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."}}