{"id":"W2514571107","doi":"10.1109/isit.2016.7541754","title":"Minimal characterization and provably efficient exhaustive search algorithm for elementary trapping sets of variable-regular LDPC codes","year":2016,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Characterization (materials science); Algorithm; Low-density parity-check code; Computer science; Code (set theory); Mathematics; Discrete mathematics; Decoding methods","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.0006830646,0.0001340415,0.0001849278,0.0001507422,0.0000890949,0.00004174541,0.0003293872,0.00005542534,0.000009917088],"category_scores_gemma":[0.00002963958,0.00009876564,0.00003393646,0.0002380551,0.00006760402,0.0002739815,0.0002007686,0.00004625252,8.202718e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005086686,"about_ca_system_score_gemma":0.00007449571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003100105,"about_ca_topic_score_gemma":0.000001492479,"domain_scores_codex":[0.9987513,0.00004730012,0.0002759913,0.0004122388,0.0002358103,0.0002773018],"domain_scores_gemma":[0.999157,0.0001743567,0.0001097281,0.0002702773,0.0002306242,0.00005806648],"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.00001702015,0.00008917748,0.0004812212,0.00005580963,0.00002838572,0.000001228815,0.0006194109,0.000004395526,0.4856202,0.00432581,0.00007851717,0.5086788],"study_design_scores_gemma":[0.0006524114,0.0005192192,0.003066837,0.0002018217,0.0000143564,0.00001418365,0.0001022907,0.3566853,0.6378293,0.0004088794,0.000263159,0.0002422213],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1545485,0.000009616083,0.844164,0.0002763155,0.00008470919,0.0006180381,0.00002860191,0.000199711,0.00007049825],"genre_scores_gemma":[0.3553315,0.000005836853,0.6442999,0.00006356102,0.00002587193,0.00006850284,0.000009271927,0.00001148412,0.0001840791],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5084366,"threshold_uncertainty_score":0.4027546,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01737341084421058,"score_gpt":0.2660837653291956,"score_spread":0.2487103544849851,"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."}}