{"id":"W2945033151","doi":"10.1109/tit.2019.2917222","title":"Code Design Based on Connecting Spatially Coupled Graph Chains","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Low-density parity-check code; Decoding methods; Code (set theory); Computer science; Block (permutation group theory); Chain (unit); Concatenated error correction code; Algorithm; Block code; Theoretical computer science; Mathematics; Combinatorics; Physics","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":[],"consensus_categories":[],"category_scores_codex":[0.001321976,0.0002207305,0.0001863019,0.0006271107,0.0002991648,0.0001829322,0.0006257521,0.0001240762,0.0001277623],"category_scores_gemma":[0.00004379773,0.00021823,0.0001287538,0.0005369631,0.0000308172,0.001436929,0.00000295013,0.0003810462,0.0005514108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001275716,"about_ca_system_score_gemma":0.0001161737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001447348,"about_ca_topic_score_gemma":0.000007373311,"domain_scores_codex":[0.9984186,0.0002349703,0.0004214918,0.0002322301,0.0004142823,0.0002784132],"domain_scores_gemma":[0.9977817,0.0009844416,0.0002394535,0.000748555,0.0001652427,0.00008062718],"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.0002750305,0.0001486879,0.000006552183,0.00004752386,0.00003267249,0.00000160701,0.003971136,0.8752794,0.001122819,0.03291111,0.00009880395,0.0861046],"study_design_scores_gemma":[0.0006143371,0.0004897389,0.00001681922,0.00009255591,0.000009042652,0.000006702953,0.0001316444,0.9392313,0.05620213,0.002704453,0.0002153067,0.0002859285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003209006,0.00000181864,0.989665,0.0001843684,0.001189559,0.0006568785,0.000009548593,0.001521155,0.003562717],"genre_scores_gemma":[0.9544153,0.000002574694,0.04364278,0.001725791,0.00001239509,0.00007026806,0.000003517749,0.00001648038,0.0001109612],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9512062,"threshold_uncertainty_score":0.8899161,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01446241130644318,"score_gpt":0.2347008881455863,"score_spread":0.2202384768391431,"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."}}