{"id":"W2579410364","doi":"10.1109/tit.2018.2805906","title":"On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Mathematics; Bipartite graph; Degree distribution; Poisson distribution; Random graph; Discrete mathematics; Combinatorics; Degree (music); Graph; Decoding methods; Algorithm; Statistics; Physics","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.001446817,0.0004492829,0.0005111232,0.001458962,0.0004653244,0.0008246707,0.0008192788,0.000725117,0.001545357],"category_scores_gemma":[0.009368339,0.0003673379,0.0003886601,0.0008775732,0.001474248,0.001885593,0.0006615981,0.0008782797,0.0002400237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001565725,"about_ca_system_score_gemma":0.0007614731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002771441,"about_ca_topic_score_gemma":0.002116863,"domain_scores_codex":[0.9993234,0.0002449275,0.00001567392,0.0001398779,0.0001693976,0.0001067677],"domain_scores_gemma":[0.9949443,0.003231771,0.0004822745,0.0005317475,0.0006191252,0.0001907799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002470622,0.00006045405,0.00651293,0.0001210062,0.00005500017,0.0003174901,0.0003184154,0.5566974,0.01184114,0.4082291,0.001504326,0.01409562],"study_design_scores_gemma":[0.000006934366,0.00002239415,0.001006636,0.00001247541,0.000006263065,0.00008766115,0.00002841656,0.9581459,0.001678828,0.03855084,0.0004350527,0.00001848362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6357741,0.0009301264,0.353247,0.0006602966,0.00004383229,0.00008469611,0.0004295346,0.0004066809,0.008423802],"genre_scores_gemma":[0.9880583,0.0004008824,0.009101832,0.00007561816,0.00002973305,0.0000503726,0.0001960617,0.00008109859,0.002006142],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002771441,"threshold_uncertainty_score":0.01136017,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00874073550674255,"score_gpt":0.2343911039441813,"score_spread":0.2256503684374387,"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."}}