{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007493018,0.0006490096,0.000725658,0.0003904484,0.000242867,0.0004242042,0.002770116,0.0005443887,0.0001066923],"category_scores_gemma":[0.0005378844,0.0005331853,0.0002488964,0.000307391,0.0001407971,0.000181496,0.002245852,0.000968605,0.00005520559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001986058,"about_ca_system_score_gemma":0.0003109362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007312523,"about_ca_topic_score_gemma":0.0002392359,"domain_scores_codex":[0.9962975,0.0002306157,0.0006755507,0.001518451,0.0006390671,0.0006387605],"domain_scores_gemma":[0.9958879,0.0008791472,0.0006669381,0.001991346,0.0003722416,0.0002023725],"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.00008265134,0.0003964819,0.002982109,0.0003400653,0.0004961765,0.0001286008,0.002013076,0.0001394282,0.04921729,0.7622181,0.03907826,0.1429078],"study_design_scores_gemma":[0.002555992,0.001213804,0.000509927,0.004685958,0.0001106336,0.0002171638,0.0001689814,0.369607,0.2756227,0.3357791,0.00348608,0.006042615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03980618,0.00008346089,0.9295555,0.001467151,0.002243962,0.0007967511,0.00004409395,0.005897919,0.02010499],"genre_scores_gemma":[0.8963417,0.00005247079,0.1019673,0.0007731903,0.0001054496,0.00007748361,0.00002765763,0.00006505904,0.0005896746],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8565356,"threshold_uncertainty_score":0.999712,"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."}}