{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001329092,0.0002362792,0.0003780819,0.0002207534,0.0002181295,0.00007515995,0.001454999,0.00008225577,0.00001809511],"category_scores_gemma":[0.0001789015,0.0001814287,0.0001083542,0.0007661667,0.000188542,0.0002589037,0.0005493046,0.0002403432,0.000006698527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008141591,"about_ca_system_score_gemma":0.00008525905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007871469,"about_ca_topic_score_gemma":0.001897255,"domain_scores_codex":[0.9976116,0.0003696819,0.0006372496,0.000533091,0.0003884296,0.0004598952],"domain_scores_gemma":[0.9977524,0.0008938244,0.0002572648,0.0008642595,0.000175287,0.00005702076],"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.0005086473,0.001574291,0.148846,0.0004246761,0.0004392767,0.0001085383,0.0893774,0.001924712,0.4501043,0.02139007,0.00779933,0.2775027],"study_design_scores_gemma":[0.002624037,0.000234675,0.02703118,0.000437818,0.00001874939,0.00004533784,0.001385022,0.5749636,0.3909948,0.001533745,0.0001805782,0.0005504014],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5613282,0.00004429429,0.4365439,0.0003406515,0.000175123,0.0003530809,8.834054e-7,0.0004088922,0.0008049145],"genre_scores_gemma":[0.9326227,0.00000515582,0.06695306,0.0003059875,0.00005779886,0.00001350122,0.000001747062,0.00001630727,0.00002371417],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5730389,"threshold_uncertainty_score":0.7398449,"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."}}