{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002919613,0.0001225578,0.0001264839,0.0001693264,0.0001353968,0.00006236852,0.0001942437,0.0000522599,0.00002116113],"category_scores_gemma":[0.00001214962,0.0001055398,0.00004731217,0.0003958637,0.00004474175,0.0009049398,0.000003649131,0.0001968821,0.00002884904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001644941,"about_ca_system_score_gemma":0.00002565276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004754494,"about_ca_topic_score_gemma":0.00000725579,"domain_scores_codex":[0.99923,0.00005860848,0.0002475874,0.0001311744,0.0001854294,0.0001471899],"domain_scores_gemma":[0.9993696,0.0001709123,0.00009332507,0.0002295377,0.00006389801,0.00007275232],"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.0008159356,0.0003214089,0.001069104,0.0003378972,0.0001879757,0.000009728426,0.04555527,0.009043006,0.0008547996,0.631398,0.0002911269,0.3101158],"study_design_scores_gemma":[0.004551098,0.004480091,0.00363718,0.00139295,0.00021795,0.0004007925,0.004383195,0.2644386,0.6204546,0.0891851,0.004110013,0.002748457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1339535,0.000002307093,0.8634325,0.0001305559,0.00007713055,0.0001527375,0.00001197666,0.0003389333,0.001900393],"genre_scores_gemma":[0.9850008,0.000009405002,0.01425012,0.0006881878,0.000003992119,0.00002619912,0.000001257465,0.000006903477,0.00001316343],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8510473,"threshold_uncertainty_score":0.4303788,"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."}}