{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000483967,0.0002574324,0.0003390209,0.0003664666,0.0001333619,0.00004923041,0.0008723256,0.0001867155,0.000004487953],"category_scores_gemma":[0.0000162614,0.0002739012,0.0001231567,0.0002938583,0.0001344716,0.0002044265,0.001283875,0.0002242648,0.000001475698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001752578,"about_ca_system_score_gemma":0.0001266777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004267193,"about_ca_topic_score_gemma":0.000004516538,"domain_scores_codex":[0.9983102,0.0001019995,0.0002347567,0.0009232791,0.0001189511,0.0003108141],"domain_scores_gemma":[0.9985133,0.0001504202,0.0002947099,0.0006401153,0.0003066729,0.00009475891],"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.0003748086,0.001278112,0.01360171,0.002746244,0.001423762,0.0003608102,0.01059028,0.0236801,0.1310604,0.1358077,0.0003736469,0.6787024],"study_design_scores_gemma":[0.0005020635,0.0001493238,0.002201417,0.0004299498,0.00006858952,0.000004762117,0.000120278,0.9516079,0.03918559,0.005248357,0.00006708088,0.0004146172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3479128,0.000016128,0.6510235,0.00004552629,0.0001776413,0.0005331727,0.00007791654,0.0001700615,0.00004321122],"genre_scores_gemma":[0.9648983,0.00007196427,0.03473384,0.0000252473,0.00003756045,0.000004979594,0.00004803626,0.00001943035,0.0001606458],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9279279,"threshold_uncertainty_score":0.9999713,"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."}}