{"id":"W2313149118","doi":"10.1109/itwksps.2010.5503171","title":"A message-passing algorithm for counting short cycles in a graph","year":2010,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Bipartite graph; Message passing; Algorithm; Computer science; Graph; Combinatorics; Computational complexity theory; Mathematics; Theoretical computer science; Parallel computing","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.001519427,0.001579823,0.001341515,0.003403507,0.001467617,0.001588677,0.002754941,0.001507961,0.002831822],"category_scores_gemma":[0.007031634,0.0006456594,0.001012017,0.00290952,0.001171663,0.003231177,0.00172773,0.001754635,0.001413704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001294621,"about_ca_system_score_gemma":0.002345183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00323413,"about_ca_topic_score_gemma":0.003067323,"domain_scores_codex":[0.9980704,0.0004498125,0.0001652963,0.0004423349,0.0006888109,0.0001834748],"domain_scores_gemma":[0.9960362,0.001414849,0.0004341796,0.001001966,0.0009413383,0.0001714633],"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.0004813685,0.0002082402,0.001653037,0.0003345208,0.0001617621,0.0002102292,0.0004865699,0.1663531,0.02579896,0.09612893,0.007659083,0.7005241],"study_design_scores_gemma":[0.0001249326,0.0002136473,0.0004017862,0.00005375086,0.00007023114,0.0003487531,0.00007365828,0.8687332,0.02978833,0.08530589,0.01480297,0.00008284576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004382291,0.00009921026,0.9937571,0.00006479228,0.00003979551,0.00008604515,0.00006176429,0.0009800049,0.000529019],"genre_scores_gemma":[0.06633943,0.0002161162,0.9298599,0.00007908056,0.00007413729,0.0002957422,0.000387504,0.000180638,0.002567452],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003403507,"threshold_uncertainty_score":0.009473383,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02839889863794161,"score_gpt":0.309361538903159,"score_spread":0.2809626402652174,"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."}}