{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001182338,0.001037018,0.00131744,0.001137719,0.001545213,0.003377657,0.002470096,0.001782265,0.004214147],"category_scores_gemma":[0.01238649,0.0007575589,0.001392643,0.001741004,0.00250442,0.006966721,0.002941869,0.003461331,0.0006119959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001388507,"about_ca_system_score_gemma":0.001088412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001385683,"about_ca_topic_score_gemma":0.001197655,"domain_scores_codex":[0.9983197,0.0003531241,0.0001144594,0.0004738037,0.0004843802,0.0002544681],"domain_scores_gemma":[0.978696,0.01799064,0.0009340139,0.001394498,0.0005147206,0.0004700348],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001334427,0.0006485559,0.009261091,0.002103163,0.000383548,0.001208632,0.001940569,0.4617521,0.02224635,0.3900013,0.02310113,0.08601912],"study_design_scores_gemma":[0.0001231384,0.0001220868,0.001844878,0.0000858793,0.00008703509,0.0006647509,0.000340521,0.4444953,0.006916721,0.5401268,0.005132644,0.00006027284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3610014,0.001924495,0.5999994,0.004549005,0.0001316191,0.0002709506,0.004102942,0.0009485313,0.02707173],"genre_scores_gemma":[0.8868568,0.001680981,0.1000468,0.0007335088,0.0003785995,0.0003781859,0.003453084,0.0002448262,0.006227175],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004214147,"threshold_uncertainty_score":0.01409769,"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."}}