{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001495737,0.0007970568,0.0007981981,0.002722476,0.00125817,0.001702735,0.001088261,0.001094267,0.003857181],"category_scores_gemma":[0.009591888,0.0006131828,0.0007311218,0.003678787,0.002188143,0.003757216,0.001903451,0.001635953,0.0008087592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001494001,"about_ca_system_score_gemma":0.001229913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002965991,"about_ca_topic_score_gemma":0.003772283,"domain_scores_codex":[0.9979808,0.0008019118,0.0001097059,0.0003459844,0.0004835153,0.0002781596],"domain_scores_gemma":[0.9934891,0.004451509,0.0005857989,0.0007490789,0.0005345503,0.0001898567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003044217,0.0001309511,0.002446772,0.0003695533,0.00003467544,0.0002951243,0.0005148209,0.2344203,0.009193741,0.6402674,0.003544647,0.1084775],"study_design_scores_gemma":[0.00002295498,0.00004996236,0.0004815708,0.00006345149,0.00001180509,0.0001755376,0.00009908002,0.3036974,0.004062839,0.6879522,0.003351232,0.00003198591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1190914,0.00076853,0.8669537,0.0005459104,0.00005471928,0.0001612054,0.0004421879,0.0006765806,0.01130568],"genre_scores_gemma":[0.5391959,0.001890517,0.4481387,0.0004541729,0.0001484964,0.0004269938,0.001477633,0.0004647895,0.007802767],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003857181,"threshold_uncertainty_score":0.01290363,"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."}}