{"id":"W2913328603","doi":"10.1109/istc.2018.8625374","title":"Computing the Asymptotic Expected Multiplicity of Elementary Trapping Sets (ETSs) in Random LDPC Code Ensembles","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Multiplicity (mathematics); Low-density parity-check code; Computation; Catalan number; Mathematics; Counting problem; Generalization; Decoding methods; Discrete mathematics; Code (set theory); Computer science; Combinatorics; Algorithm","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.001093742,0.0001821902,0.0002894273,0.0001829162,0.0001745574,0.0000576582,0.001168104,0.00006071542,0.00001811553],"category_scores_gemma":[0.0001998997,0.000135852,0.00008282422,0.0006666971,0.0001277155,0.0002201551,0.000458465,0.0001983139,0.000006643056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006389186,"about_ca_system_score_gemma":0.00007331864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008473314,"about_ca_topic_score_gemma":0.002187879,"domain_scores_codex":[0.9980981,0.0002750388,0.0005387532,0.0004170666,0.0002986394,0.000372393],"domain_scores_gemma":[0.9979789,0.0009646346,0.0002086691,0.0006663732,0.0001370905,0.00004430178],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004357253,0.00136776,0.248711,0.0002823692,0.000342998,0.00007100137,0.1101803,0.001155294,0.3491482,0.01593185,0.008852586,0.2635209],"study_design_scores_gemma":[0.002358774,0.000259473,0.03379332,0.0003274216,0.00001318361,0.0000356859,0.001064041,0.6350139,0.3250353,0.001511465,0.0001359808,0.0004515168],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5695042,0.00002816904,0.4279589,0.0002759437,0.0001578803,0.0003097681,7.113863e-7,0.0003973791,0.001367055],"genre_scores_gemma":[0.9173006,0.000004434407,0.08227137,0.000339025,0.00004597081,0.000009722566,0.000001061188,0.00001111381,0.00001665865],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6338586,"threshold_uncertainty_score":0.5539882,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02303872413220732,"score_gpt":0.2900871196368367,"score_spread":0.2670483955046294,"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."}}