{"id":"W2911385876","doi":"10.1109/istc.2018.8625273","title":"Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Multiplicity (mathematics); Mathematics; Discrete mathematics; Combinatorics; Decoding methods; Algorithm; Geometry","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.0008655887,0.0002844032,0.0003528807,0.0009182999,0.0003842672,0.00065472,0.0007688111,0.000544995,0.000717867],"category_scores_gemma":[0.01355788,0.0002690243,0.0002613946,0.0006233004,0.0009590225,0.001277735,0.000768662,0.0005523312,0.0001183215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009516607,"about_ca_system_score_gemma":0.0005224763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009859209,"about_ca_topic_score_gemma":0.001625034,"domain_scores_codex":[0.9996102,0.0000779726,0.00002935921,0.00009066571,0.0001266787,0.00006513761],"domain_scores_gemma":[0.9941559,0.003789627,0.000738697,0.0005689001,0.0004872465,0.0002596354],"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.0003189686,0.00009333473,0.04266963,0.0001556212,0.00008402325,0.0005864649,0.0002165681,0.8476015,0.02815752,0.06164245,0.0006693703,0.01780446],"study_design_scores_gemma":[0.000005563504,0.00002746259,0.00320311,0.000009400629,0.000008777329,0.0001459578,0.0000277953,0.9777865,0.007779647,0.0108657,0.0001258228,0.00001425279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9125523,0.000136244,0.08525711,0.00009990409,0.00001067691,0.00001296699,0.000146619,0.000223615,0.001560523],"genre_scores_gemma":[0.9861179,0.00006449786,0.01314742,0.0000143918,0.000008572454,0.00002079212,0.0002212382,0.00003997246,0.000365264],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0009859209,"threshold_uncertainty_score":0.00690484,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02197544558387931,"score_gpt":0.2853517169949502,"score_spread":0.2633762714110709,"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."}}