{"id":"W2105050988","doi":"10.1109/ismvl.2012.35","title":"Asynchronous Stochastic Decoding of Low-Density Parity-Check Codes","year":2012,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Asynchronous communication; Computer science; Decoding methods; Decodes; Low-density parity-check code; Algorithm; Computation; Scheduling (production processes); Parallel computing; Theoretical computer science; Mathematics; Computer network; Mathematical optimization","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":[],"consensus_categories":[],"category_scores_codex":[0.0006606704,0.0001341725,0.0002187,0.0001025453,0.00008569161,0.00003837591,0.0006399407,0.00007311919,0.00002198033],"category_scores_gemma":[0.0002135789,0.0001257215,0.00006769397,0.0002529942,0.0000531997,0.0005065422,0.0004070649,0.0001545846,0.00004471668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006788183,"about_ca_system_score_gemma":0.00004581169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001811663,"about_ca_topic_score_gemma":0.00006242192,"domain_scores_codex":[0.9988512,0.00006129782,0.0002454811,0.0002290792,0.0002353084,0.0003776807],"domain_scores_gemma":[0.9988259,0.0002383971,0.0001256478,0.0005887783,0.0001051893,0.0001161012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003915024,0.001634189,0.1789966,0.0003984401,0.0001528157,0.00001960955,0.01152997,0.0004696476,0.06684344,0.5773293,0.006003316,0.1565836],"study_design_scores_gemma":[0.0006327978,0.0004076556,0.05681923,0.0003667474,0.00005182105,0.0002369754,0.0003642208,0.1989776,0.7250564,0.01550091,0.0001239173,0.001461724],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2380712,0.00005986241,0.7581692,0.00005587907,0.0003220956,0.0000988907,3.53226e-7,0.0005696376,0.002652971],"genre_scores_gemma":[0.7948983,0.000001734503,0.2049138,0.00008108894,0.00004634745,0.00000505109,3.588146e-7,0.000007666586,0.00004573666],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6582129,"threshold_uncertainty_score":0.5126776,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02041635535331025,"score_gpt":0.2716427372605129,"score_spread":0.2512263819072026,"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."}}