{"id":"W2574730918","doi":"10.1109/tit.2017.2784839","title":"On Short Cycle Enumeration in Biregular Bipartite Graphs","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Girth (graph theory); Odd graph; Tanner graph; Discrete mathematics; Complete bipartite graph; Low-density parity-check code; Probability of error; Dense graph; Enumeration; Chordal graph; Graph; 1-planar graph; Decoding methods; Algorithm; 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.0007657832,0.0001449561,0.0001200196,0.0005375122,0.0005528097,0.0003774514,0.0007037729,0.00009642324,0.0000226699],"category_scores_gemma":[0.00003785497,0.0001456472,0.00008055304,0.0002041747,0.00006135133,0.003735803,0.000004461304,0.0002714232,0.0001898641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008697619,"about_ca_system_score_gemma":0.00003657204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000348475,"about_ca_topic_score_gemma":0.00004268042,"domain_scores_codex":[0.9989277,0.0000930828,0.0003359978,0.000169417,0.0002758987,0.0001978958],"domain_scores_gemma":[0.9986233,0.0001195251,0.0001375047,0.0009947517,0.00007086453,0.00005402701],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001164354,0.0001975405,0.00008843003,0.00002617663,0.00002497836,0.000004086894,0.004334872,0.03040305,0.0007999002,0.3378969,0.0002386109,0.625869],"study_design_scores_gemma":[0.001133371,0.0006297851,0.004338096,0.0003340367,0.00002202052,0.00003131565,0.0002130299,0.3001235,0.3825334,0.3082835,0.001367815,0.0009901657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05579438,0.000002541029,0.9366357,0.0002426799,0.0007766433,0.0002443679,0.000004411785,0.0004609587,0.005838321],"genre_scores_gemma":[0.9962541,0.000009303487,0.003161525,0.000386878,0.000009156405,0.000090902,0.00000178948,0.000007681863,0.00007863428],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9404597,"threshold_uncertainty_score":0.593932,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0114826723515545,"score_gpt":0.2578694124260678,"score_spread":0.2463867400745132,"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."}}