{"id":"W4301303211","doi":"10.48550/arxiv.1308.1259","title":"On Characterization of Elementary Trapping Sets of Variable-Regular LDPC\\n Codes","year":2013,"lang":"","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; Node (physics); Tanner graph; Variable (mathematics); Graph; Set (abstract data type); Computer science; Characterization (materials science); Coding (social sciences); Simple (philosophy); Class (philosophy); Code (set theory); 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.0002437301,0.0003495097,0.0003637133,0.001248889,0.0007789644,0.000849963,0.000751053,0.0004964035,0.003311091],"category_scores_gemma":[0.002247055,0.0003290341,0.0005410943,0.0006394631,0.001498112,0.00114065,0.0008515226,0.0008876928,0.0002457586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006367918,"about_ca_system_score_gemma":0.0003781102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009560799,"about_ca_topic_score_gemma":0.000923881,"domain_scores_codex":[0.999694,0.00005132397,0.00001665016,0.00009427866,0.00008665997,0.00005705701],"domain_scores_gemma":[0.9982948,0.0008965684,0.0003084915,0.0001576168,0.0001673641,0.0001752362],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001390649,0.0001047368,0.007195509,0.0001990556,0.00003519492,0.0005807079,0.0009212622,0.05734213,0.02165536,0.8898735,0.001676909,0.02027657],"study_design_scores_gemma":[0.00003689357,0.0001478246,0.004223562,0.00007801651,0.00003504,0.0008542317,0.0003643425,0.3943748,0.01138175,0.5831844,0.005258201,0.00006106854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.7398311,0.0003417629,0.241322,0.0002453304,0.00003471674,0.00009229939,0.0003765059,0.0002063375,0.01754998],"genre_scores_gemma":[0.9717106,0.0002501887,0.02284443,0.0001118948,0.00004553403,0.00009185942,0.0004338559,0.00007917115,0.004432673],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.003311091,"threshold_uncertainty_score":0.01107675,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05129862370862853,"score_gpt":0.1912948531553252,"score_spread":0.1399962294466966,"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."}}