{"id":"W3125334338","doi":"","title":"1New Codes on Graphs Constructed by Connecting Spatially Coupled Chains","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Code (set theory); Chain (unit); Algorithm; Concatenated error correction code; Theoretical computer science; Tanner graph; Error floor; Block code; Physics","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.0001560889,0.0003342528,0.0002215801,0.0005475401,0.0005202239,0.0004526296,0.0004310949,0.0006194066,0.001440066],"category_scores_gemma":[0.001113917,0.0002105156,0.000237513,0.0004986937,0.0007314323,0.0006340007,0.0008224,0.0005660685,0.0003653365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003896544,"about_ca_system_score_gemma":0.0003397428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005477729,"about_ca_topic_score_gemma":0.0009684062,"domain_scores_codex":[0.9997609,0.00007127314,0.000009906932,0.00004655544,0.00008681484,0.00002463237],"domain_scores_gemma":[0.9993771,0.0001805661,0.0001014484,0.0001438989,0.0001448985,0.00005206515],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001743286,0.00008568683,0.001815725,0.0001820039,0.00005363177,0.0006262173,0.0003296563,0.3276385,0.1246398,0.5011557,0.001746899,0.04155178],"study_design_scores_gemma":[0.00001804874,0.0001094209,0.0009896803,0.00003073118,0.00002124209,0.0003517227,0.00004611704,0.7865316,0.03232746,0.1729418,0.006602602,0.00002954335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4299785,0.0003056917,0.5497917,0.0002526187,0.00009393012,0.00008825112,0.0002449831,0.0004671745,0.01877716],"genre_scores_gemma":[0.8872205,0.0002337947,0.1060264,0.00009585119,0.000033861,0.00008708319,0.0002653112,0.00008459637,0.005952544],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001440066,"threshold_uncertainty_score":0.004817545,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0180490201238683,"score_gpt":0.2669488572915603,"score_spread":0.248899837167692,"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."}}