{"id":"W2619905542","doi":"10.1109/lcomm.2017.2707553","title":"Lower Bounds on the Size of Smallest Elementary and Non-Elementary Trapping Sets in Variable-Regular LDPC Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Low-density parity-check code; Elementary proof; Mathematics; Elementary function; Computer science; Decoding methods; Discrete mathematics; Combinatorics; Algorithm","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":[],"consensus_categories":[],"category_scores_codex":[0.001009583,0.0001542053,0.0001891273,0.0001103134,0.0007071058,0.0001917967,0.004311125,0.00004254662,0.000008243133],"category_scores_gemma":[0.0000835687,0.0001379811,0.00004779198,0.0001622645,0.0003730033,0.0003114867,0.0008834709,0.0003351101,0.000001962803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007700639,"about_ca_system_score_gemma":0.00003824858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000961631,"about_ca_topic_score_gemma":0.0007914695,"domain_scores_codex":[0.9987749,0.0001978876,0.0003452541,0.0002618837,0.0001933173,0.0002267502],"domain_scores_gemma":[0.9944224,0.000774804,0.0002848461,0.004438651,0.00004378116,0.00003549163],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0001175732,0.001840342,0.1736405,0.0002156496,0.0006114484,0.00005598514,0.01734339,0.0008375844,0.630204,0.04617887,0.08863592,0.04031875],"study_design_scores_gemma":[0.007029829,0.001537969,0.573173,0.00505731,0.0002983497,0.0001257265,0.003189481,0.1970397,0.1405999,0.02655642,0.0408569,0.004535313],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9123604,0.00008671807,0.02777094,0.05713937,0.0002270611,0.0005208566,0.00001302536,0.0001088319,0.001772795],"genre_scores_gemma":[0.910073,0.00008581332,0.0858577,0.003874697,0.00001313939,0.00006979383,0.000004594221,0.00001117231,0.00001004508],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4896041,"threshold_uncertainty_score":0.8011215,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03360030439567426,"score_gpt":0.2900901780064645,"score_spread":0.2564898736107902,"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."}}