{"id":"W2772479553","doi":"10.1109/tit.2019.2904988","title":"Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Subcategory; Additive white Gaussian noise; Trapping; Decoding methods; Error floor; Gaussian; Code (set theory); Mathematics; Channel (broadcasting); Discrete mathematics; Computer science; Algorithm; Combinatorics; Physics; Telecommunications; Biology","routes":{"ca_aff":true,"ca_fund":true,"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.001984632,0.0004521854,0.0004943979,0.001056582,0.0003091679,0.0002243585,0.0009434813,0.0002906999,0.00002172875],"category_scores_gemma":[0.0000246505,0.0004814315,0.0001914044,0.0003007334,0.00008848799,0.00157654,0.0000525161,0.001069782,0.00003153476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002715492,"about_ca_system_score_gemma":0.0001571609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000975553,"about_ca_topic_score_gemma":0.00002181757,"domain_scores_codex":[0.9970171,0.0002939165,0.001199748,0.0005037687,0.0006171297,0.0003683124],"domain_scores_gemma":[0.997196,0.0005775396,0.0008893973,0.001075042,0.0001715549,0.00009045381],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001129311,0.0003943336,0.00005377395,0.00242545,0.0006376815,0.000006081364,0.04319599,0.220611,0.0007821211,0.005830482,0.002387519,0.7225463],"study_design_scores_gemma":[0.006405197,0.001984915,0.001162608,0.01209626,0.0004367318,0.0001170823,0.01061465,0.4156514,0.5151662,0.02996708,0.00215865,0.004239245],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07988714,0.00002522125,0.91308,0.0002125865,0.002277007,0.0009795722,0.0004065254,0.0005501505,0.002581812],"genre_scores_gemma":[0.9837018,0.0001221978,0.01528238,0.0005684697,0.00001982457,0.0001156444,0.0001010151,0.000025668,0.00006298348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9038147,"threshold_uncertainty_score":0.9997637,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02640080365658309,"score_gpt":0.2843982716759575,"score_spread":0.2579974680193744,"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."}}