{"id":"W2010344279","doi":"10.1109/icc.2012.6364482","title":"Connecting spatially coupled LDPC code chains","year":2012,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Computer science; Code (set theory); Parallel computing; Theoretical computer science; Algorithm; Programming language; Decoding methods","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002076072,0.0003810149,0.0002966028,0.0005331491,0.000648742,0.0006268779,0.0005608102,0.0007922012,0.001755399],"category_scores_gemma":[0.00147197,0.0002808264,0.000265828,0.0006258941,0.0007255238,0.0006438065,0.0009865452,0.000530705,0.0003436877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003773567,"about_ca_system_score_gemma":0.000443848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005558507,"about_ca_topic_score_gemma":0.000826458,"domain_scores_codex":[0.9997725,0.00007123679,0.00001047397,0.00003724159,0.00008303301,0.00002546038],"domain_scores_gemma":[0.9992907,0.0003032378,0.00009383044,0.0001276489,0.0001297207,0.00005475483],"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.0002132969,0.0001065522,0.001702778,0.000231264,0.0000851275,0.0007227865,0.0003459333,0.5938236,0.09918131,0.2744105,0.0007792263,0.02839774],"study_design_scores_gemma":[0.00002687595,0.00009553257,0.000365961,0.00002556483,0.00002814283,0.0001542724,0.00004247783,0.9207374,0.01946049,0.05683142,0.002199752,0.00003217781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5819464,0.0002860539,0.3999568,0.0002248034,0.00008010825,0.0001324085,0.0001629263,0.0003414239,0.01686911],"genre_scores_gemma":[0.9450271,0.000195196,0.05167646,0.00006200664,0.00001551451,0.0001287155,0.0001214848,0.00003282888,0.002740749],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001755399,"threshold_uncertainty_score":0.005872369,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03010798511094407,"score_gpt":0.283424880378686,"score_spread":0.2533168952677419,"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."}}