{"id":"W3005925191","doi":"10.1109/itw44776.2019.8989134","title":"On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth","year":2019,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Tanner graph; Degree (music); Discrete mathematics; Low-density parity-check code; Girth (graph theory); Time complexity; Partition (number theory); Frequency partition of a graph; Sequence (biology); Graph; Algorithm; Line graph; Graph power; Decoding methods","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.001767752,0.001001813,0.00137655,0.00110965,0.001376639,0.003753277,0.001851173,0.001497427,0.008851136],"category_scores_gemma":[0.0123016,0.0006784264,0.001306944,0.001996656,0.002171139,0.006157645,0.001938181,0.002434709,0.001132121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002600187,"about_ca_system_score_gemma":0.003190479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009020267,"about_ca_topic_score_gemma":0.01259999,"domain_scores_codex":[0.998201,0.0005155146,0.0000856952,0.0005264271,0.0002946788,0.0003767077],"domain_scores_gemma":[0.9805205,0.01712272,0.0007566097,0.0008860422,0.0003550227,0.0003590646],"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.002969667,0.0007178026,0.009288707,0.0009834121,0.0002816255,0.0005783393,0.0006390275,0.7379335,0.01381391,0.06500444,0.01781027,0.1499793],"study_design_scores_gemma":[0.0002817349,0.0001367087,0.001680739,0.00003909194,0.00006669021,0.0001872361,0.0002232391,0.9129287,0.002852309,0.08008421,0.001486836,0.00003239162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6737467,0.001840771,0.2847637,0.00826833,0.0002393548,0.0005090617,0.002711204,0.002899382,0.02502155],"genre_scores_gemma":[0.8151601,0.00114283,0.1716769,0.0006984994,0.0002593502,0.0004710278,0.003170029,0.0003842005,0.00703702],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009020267,"threshold_uncertainty_score":0.02961004,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04781591141259137,"score_gpt":0.2855087417540977,"score_spread":0.2376928303415064,"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."}}