{"id":"W2886278004","doi":"10.1109/isit.2018.8437485","title":"Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes is Hard","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Additive white Gaussian noise; Subcategory; Decoding methods; Error floor; Trapping; Code (set theory); Gaussian; Computer science; Mathematics; Discrete mathematics; Channel (broadcasting); Algorithm; Combinatorics; Physics; Set (abstract data type); Telecommunications; Biology","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.0006882045,0.0002097237,0.0002615654,0.0002332359,0.0002230787,0.00009708511,0.0007016938,0.00006282638,0.0001311269],"category_scores_gemma":[0.00002033881,0.0002078282,0.0000609668,0.0003313679,0.0001169616,0.0006066248,0.0005429543,0.0001536498,0.000009756552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006081847,"about_ca_system_score_gemma":0.00003969064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004109016,"about_ca_topic_score_gemma":0.0001896015,"domain_scores_codex":[0.9982331,0.00006642878,0.0004261433,0.0005477114,0.0003283433,0.0003982166],"domain_scores_gemma":[0.9989725,0.000129313,0.0001840134,0.000529389,0.00009937296,0.00008544766],"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.00005708386,0.0002921182,0.151807,0.0004542218,0.0003820257,0.00005149076,0.03242898,0.000009687648,0.1845414,0.006318233,0.075304,0.5483537],"study_design_scores_gemma":[0.0007500309,0.0006756809,0.0138483,0.0005167522,0.00004227312,0.00007771498,0.001712514,0.05314467,0.9217606,0.004511694,0.002127294,0.0008324677],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8511555,0.00008931291,0.1441817,0.0008097189,0.0002729687,0.0002547982,0.000008560258,0.0004959529,0.002731505],"genre_scores_gemma":[0.7959406,0.0000258283,0.2027565,0.001126836,0.00003920112,0.000009149396,0.000003428608,0.00001433864,0.00008416808],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7372192,"threshold_uncertainty_score":0.8474989,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04150145517598843,"score_gpt":0.310448073592786,"score_spread":0.2689466184167976,"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."}}