{"id":"W2951016211","doi":"10.48550/arxiv.1611.10014","title":"Characterization and Efficient Exhaustive Search Algorithm for Elementary Trapping Sets of Irregular LDPC Codes","year":2016,"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; Characterization (materials science); Computer science; Simple (philosophy); Node (physics); Variety (cybernetics); Variable (mathematics); Code (set theory); Algorithm; Graph; Theoretical computer science; Mathematics; Decoding methods; Engineering","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.0003174903,0.0005666553,0.0007223957,0.001112997,0.0005227809,0.0008240046,0.00111299,0.000645684,0.003188426],"category_scores_gemma":[0.002830466,0.000333125,0.0005921182,0.0009296409,0.000587496,0.00137979,0.001233458,0.0008087743,0.0006040533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006974636,"about_ca_system_score_gemma":0.001585732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00222226,"about_ca_topic_score_gemma":0.003279848,"domain_scores_codex":[0.999588,0.00007855932,0.00003280807,0.0001066165,0.0001131664,0.00008095124],"domain_scores_gemma":[0.9987844,0.0007127672,0.0001253082,0.0001737075,0.0001459812,0.00005790456],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006020571,0.0003226589,0.007622689,0.0007107418,0.0001248018,0.000407338,0.0008100034,0.4206057,0.0328069,0.1059415,0.008688668,0.421357],"study_design_scores_gemma":[0.00004836558,0.00007204554,0.0005299117,0.00002310897,0.00001976212,0.0001460133,0.0001029041,0.9507565,0.004803123,0.04151978,0.001961498,0.00001692339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1434966,0.0002909995,0.8469086,0.0003545306,0.00002781453,0.0003112374,0.0006312688,0.001181194,0.006797742],"genre_scores_gemma":[0.4704313,0.0001983737,0.5219225,0.0001658036,0.00002705498,0.0003881986,0.002459507,0.0002224005,0.004184975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003188426,"threshold_uncertainty_score":0.01066637,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05886455175116401,"score_gpt":0.2215206526523492,"score_spread":0.1626561009011852,"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."}}