{"id":"W2949161139","doi":"10.48550/arxiv.1308.1259","title":"On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Tanner graph; Node (physics); Variable (mathematics); Graph; Computer science; Set (abstract data type); Characterization (materials science); Coding (social sciences); Simple (philosophy); Code (set theory); Class (philosophy); Mathematics; Discrete mathematics; Combinatorics; Error floor; Algorithm; Decoding methods; Statistics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002581528,0.0003561742,0.0004350245,0.001357881,0.0008298292,0.0008305763,0.0007133095,0.0005264379,0.003224424],"category_scores_gemma":[0.002532208,0.0003152484,0.0005427154,0.0008275707,0.001358985,0.00130669,0.0008518639,0.0009049139,0.0002481234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005858302,"about_ca_system_score_gemma":0.0004269191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009057689,"about_ca_topic_score_gemma":0.0007743506,"domain_scores_codex":[0.9996395,0.000060595,0.0000214486,0.0001034214,0.0001026376,0.00007242637],"domain_scores_gemma":[0.9980293,0.000975579,0.0003840067,0.000188302,0.0002267014,0.0001960774],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001829562,0.0001266389,0.009521578,0.0002957365,0.00004716072,0.0007616103,0.001014828,0.08923594,0.03319588,0.8367674,0.00188548,0.0269647],"study_design_scores_gemma":[0.00003972289,0.0001686008,0.005579028,0.00007637629,0.00003978442,0.001075882,0.0003727973,0.4656084,0.01222447,0.5093133,0.005436895,0.00006477515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6862433,0.0004165975,0.2964355,0.0002614491,0.0000314714,0.0001177318,0.0005478633,0.0002607374,0.01568525],"genre_scores_gemma":[0.9639828,0.0002743592,0.03139723,0.0001100304,0.00004159415,0.0001137542,0.0005972552,0.00007942158,0.003403603],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003224424,"threshold_uncertainty_score":0.01078677,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04591237933680283,"score_gpt":0.1890738693604568,"score_spread":0.1431614900236539,"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."}}