{"id":"W4300182065","doi":"10.48550/arxiv.1701.02379","title":"On the Tanner Graph Cycle Distribution of Random LDPC, Random\\n Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles","year":2017,"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; Mathematics; Bipartite graph; Degree distribution; Poisson distribution; Random graph; Combinatorics; Discrete mathematics; Degree (music); Distribution (mathematics); Graph; Decoding methods; Algorithm; Statistics; Mathematical analysis; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.004483132,0.001540324,0.002264361,0.0008975915,0.002171503,0.0006793936,0.005314451,0.001023447,0.0000484124],"category_scores_gemma":[0.001716699,0.00136435,0.001654034,0.001529553,0.002548332,0.000793208,0.00210324,0.002120757,0.00002532048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003103401,"about_ca_system_score_gemma":0.0006507246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001252819,"about_ca_topic_score_gemma":0.000477016,"domain_scores_codex":[0.9907515,0.002685773,0.001312575,0.003273804,0.0006846386,0.001291723],"domain_scores_gemma":[0.9857726,0.004557662,0.003023407,0.005177617,0.0009748843,0.0004938116],"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.1353677,0.01167127,0.08584162,0.00515208,0.005824732,0.002276708,0.007475486,0.2374684,0.01033739,0.4641929,0.007775819,0.02661597],"study_design_scores_gemma":[0.06155525,0.001976471,0.004221274,0.004637719,0.001804692,0.0000541404,0.0003804651,0.7140563,0.03709935,0.1690538,0.001396488,0.003764072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4602103,0.0002121234,0.5316285,0.0004980352,0.0007433096,0.005191978,0.0001669776,0.0004712665,0.0008775513],"genre_scores_gemma":[0.9975457,0.0009223925,0.0006380209,0.0001289491,0.0001044656,0.0001076789,0.00007233663,0.00009008905,0.0003904309],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5373354,"threshold_uncertainty_score":0.9997345,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05085967309769279,"score_gpt":0.2128809689463731,"score_spread":0.1620212958486803,"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."}}