{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001706641,0.001935389,0.001768765,0.003426284,0.001899001,0.002533461,0.003182419,0.002139253,0.005857742],"category_scores_gemma":[0.007974204,0.001047355,0.002679814,0.003398287,0.001639899,0.008928562,0.003271849,0.003040236,0.001718803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001474976,"about_ca_system_score_gemma":0.00212404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002695268,"about_ca_topic_score_gemma":0.002511583,"domain_scores_codex":[0.9966389,0.0007671391,0.0002526125,0.0008089447,0.001144312,0.0003880434],"domain_scores_gemma":[0.9928532,0.004081478,0.0005005923,0.001454158,0.0008172857,0.0002932927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009698229,0.0007387152,0.004207856,0.001726054,0.0003651713,0.0005000852,0.0006965612,0.09045961,0.03728449,0.1902233,0.03115754,0.6416708],"study_design_scores_gemma":[0.0002472574,0.0003299653,0.001417191,0.0001395454,0.0001903688,0.001283187,0.000261805,0.631323,0.01641466,0.3284951,0.01972523,0.0001724589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01741834,0.0008598768,0.9744932,0.00102381,0.0001562666,0.0003526364,0.0003759946,0.001543399,0.003776418],"genre_scores_gemma":[0.1257161,0.001304279,0.8641293,0.0007283046,0.0004135252,0.0007517008,0.001577998,0.0006394351,0.004739306],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005857742,"threshold_uncertainty_score":0.0195961,"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."}}