{"id":"W2950033884","doi":"10.1109/tit.2019.2923198","title":"Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles","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; Mathematics; Multiplicity (mathematics); Tanner graph; Code (set theory); Infinity; Block (permutation group theory); Combinatorics; Discrete mathematics; Trapping; Decoding methods; Algorithm; Error floor; Set (abstract data type); Computer science; Geometry; Mathematical analysis","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.001278363,0.0004279651,0.0007557817,0.0008989742,0.0001591173,0.0001399067,0.0005094458,0.0003598784,0.000004743635],"category_scores_gemma":[0.00005514846,0.0004093223,0.0001370276,0.000229584,0.0001890268,0.0009545992,0.00005430083,0.0007910465,6.296871e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001060104,"about_ca_system_score_gemma":0.0001347658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001409947,"about_ca_topic_score_gemma":0.00006670884,"domain_scores_codex":[0.9973882,0.000388061,0.001138311,0.0003956214,0.000426985,0.000262754],"domain_scores_gemma":[0.9974326,0.0006635268,0.0009007325,0.0007606862,0.0001709956,0.00007145124],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009306697,0.0002091832,0.0006558389,0.006951826,0.0004951881,0.000005788223,0.1432788,0.7123519,0.007175414,0.02080758,0.00002500598,0.1071127],"study_design_scores_gemma":[0.003277206,0.0002136905,0.004837987,0.002923081,0.0001311539,0.0000832572,0.002641412,0.6436266,0.2581935,0.08299883,0.000007484584,0.001065752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4252324,0.0001053099,0.5733413,0.00002764674,0.0004356002,0.0005980085,0.00004920647,0.0001711278,0.00003947574],"genre_scores_gemma":[0.9911109,0.00016469,0.008578362,0.0000443491,0.000005202642,0.00005443747,0.00001480525,0.00001936044,0.000007926854],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5658785,"threshold_uncertainty_score":0.9998358,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01341138576530478,"score_gpt":0.2421701643216751,"score_spread":0.2287587785563703,"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."}}