{"id":"W2998239782","doi":"10.1109/tcomm.2019.2962397","title":"Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Complete bipartite graph; Algorithm; Graph; Discrete mathematics; Mathematics; Computer science","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.0006408462,0.0001884213,0.0002182378,0.0005362279,0.0003279519,0.000152751,0.001598436,0.0001185178,0.000006427008],"category_scores_gemma":[0.00001075259,0.0002073713,0.00007510868,0.001125839,0.0001319659,0.0005915985,0.00003884612,0.0006413095,0.00002478849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009099852,"about_ca_system_score_gemma":0.00006195895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003095024,"about_ca_topic_score_gemma":0.0004645185,"domain_scores_codex":[0.9985005,0.0002037274,0.0003880212,0.0004141039,0.0002201009,0.0002736044],"domain_scores_gemma":[0.9969468,0.0003171928,0.00007999068,0.002469146,0.0001188883,0.00006799627],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004335635,0.002188117,0.004719799,0.0001274994,0.0001363698,0.00001473196,0.01098425,0.000990055,0.06065896,0.01268584,0.000412213,0.9070388],"study_design_scores_gemma":[0.001264833,0.0005495182,0.006561518,0.00155944,0.00007249141,0.0002581863,0.001402724,0.776712,0.1925632,0.0105774,0.006518931,0.001959771],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01024675,0.0001055041,0.9847209,0.001049443,0.0002323161,0.0007169673,0.00001530392,0.0008275217,0.002085228],"genre_scores_gemma":[0.7866508,0.0002493239,0.2124826,0.00008951896,0.00000463206,0.0004054229,0.000002196226,0.00001907663,0.00009636865],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9050791,"threshold_uncertainty_score":0.8456354,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02737860117143568,"score_gpt":0.2921835513328338,"score_spread":0.2648049501613981,"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."}}