{"id":"W2119604283","doi":"10.1109/tit.2013.2251395","title":"On the Girth of Quasi-Cyclic Protograph LDPC Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Girth (graph theory); Low-density parity-check code; Mathematics; Tanner graph; Combinatorics; Upper and lower bounds; Discrete mathematics; Odd graph; Base (topology); Degree (music); Graph; Decoding methods; Chordal graph; Algorithm; 1-planar graph; Error floor","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":[],"consensus_categories":[],"category_scores_codex":[0.0006909975,0.0001446618,0.0001293599,0.0003555777,0.0002312381,0.0001197861,0.0007056858,0.00007272594,0.000147378],"category_scores_gemma":[0.00003601498,0.0001009815,0.0001202496,0.0005295725,0.0001051793,0.001515968,0.000003494702,0.0002823229,0.0003316481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003354402,"about_ca_system_score_gemma":0.00003810453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005338656,"about_ca_topic_score_gemma":0.000005313957,"domain_scores_codex":[0.9988109,0.0001878662,0.0003889538,0.000117566,0.0003180985,0.000176563],"domain_scores_gemma":[0.9982134,0.0006677457,0.0002160152,0.0006888994,0.0001689706,0.00004496071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007167336,0.0003723988,0.00001672147,0.00007860008,0.00007375521,2.476553e-7,0.009581912,0.002975225,0.001115942,0.6077703,0.002105017,0.3758382],"study_design_scores_gemma":[0.0007944753,0.001710477,0.0006921522,0.0003688295,0.00003170237,0.00002890192,0.001901975,0.06820802,0.5706623,0.3531726,0.001639,0.000789565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01891744,0.000002740466,0.9723917,0.0004424506,0.0002958877,0.001046801,0.000005817163,0.0004806738,0.006416513],"genre_scores_gemma":[0.9941199,0.000007514696,0.004273445,0.0008406134,0.000006311333,0.0006385617,7.779039e-7,0.000006996162,0.000105899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9752024,"threshold_uncertainty_score":0.4262776,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009495993991673227,"score_gpt":0.2240988473380092,"score_spread":0.2146028533463359,"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."}}