{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003469138,0.00008765759,0.000148304,0.00006230973,0.00004889333,0.00002341522,0.0002777529,0.00002429393,0.000031162],"category_scores_gemma":[0.00001687884,0.00005445513,0.00003219916,0.0002490721,0.000107703,0.00009201957,0.0001555689,0.00008914358,0.000004324745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006962801,"about_ca_system_score_gemma":0.00002268882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006618171,"about_ca_topic_score_gemma":0.0001056585,"domain_scores_codex":[0.999245,0.0000529108,0.0001622988,0.000197129,0.0002137183,0.0001288772],"domain_scores_gemma":[0.9991606,0.0003510609,0.00008695552,0.0002911071,0.0000859998,0.00002425537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001032866,0.00005637403,0.2325417,0.00001850692,0.00001560889,8.64301e-7,0.0004202678,0.0001045363,0.0002069732,0.7661176,0.0000751984,0.0004320728],"study_design_scores_gemma":[0.0006193043,0.0006007885,0.4628083,0.0003602086,0.00001649413,0.00009282875,0.0002336936,0.2393815,0.01933256,0.2760141,0.0000954138,0.0004447923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7898057,0.000003464611,0.2060704,0.0001489688,0.00002421976,0.0001480418,0.000002992036,0.00008277904,0.003713495],"genre_scores_gemma":[0.8965389,7.672586e-7,0.1033019,0.0001123509,0.00000193951,0.000003542017,0.000001020963,0.000004749972,0.00003477182],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4901035,"threshold_uncertainty_score":0.2220616,"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."}}