{"id":"W3053432656","doi":"10.1109/tit.2020.3017127","title":"On Finding Bipartite Graphs With a Small Number of Short Cycles and Large Girth","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Mathematics; Tanner graph; Discrete mathematics; Degree (music); Low-density parity-check code; Girth (graph theory); Time complexity; Complete bipartite graph; Graph; Algorithm; Decoding methods","routes":{"ca_aff":true,"ca_fund":true,"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.0009489725,0.0008685481,0.0009114579,0.001116702,0.00101442,0.001304666,0.001021399,0.001125248,0.00303869],"category_scores_gemma":[0.008750354,0.0006313563,0.0007553847,0.00165119,0.002007101,0.003512181,0.00170415,0.001289586,0.000934515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007257423,"about_ca_system_score_gemma":0.001332252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001392842,"about_ca_topic_score_gemma":0.001885685,"domain_scores_codex":[0.9987541,0.0004173446,0.0000544302,0.0003386729,0.0002676612,0.0001677224],"domain_scores_gemma":[0.9920425,0.005927169,0.0007359616,0.0007802511,0.0003086369,0.000205456],"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.0008471811,0.0005869137,0.006310181,0.001170085,0.0001631534,0.0006597359,0.0008093208,0.4380918,0.06338632,0.1898124,0.008419032,0.2897439],"study_design_scores_gemma":[0.0001708557,0.0003738891,0.001826973,0.00008876303,0.00005719135,0.0008045541,0.0002758698,0.7259893,0.01723345,0.2464983,0.006626532,0.00005437298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1850277,0.0006505769,0.8043451,0.001038053,0.0000577196,0.0003393444,0.0004205112,0.0009445166,0.007176454],"genre_scores_gemma":[0.4898177,0.001371149,0.5004532,0.0004266055,0.0001267257,0.0004954918,0.00160202,0.0002670534,0.005440074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00303869,"threshold_uncertainty_score":0.01016545,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01832788079542303,"score_gpt":0.2476753376688909,"score_spread":0.2293474568734678,"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."}}