{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001601442,0.0003855451,0.0004890606,0.0005443315,0.0001336401,0.0006086885,0.002154533,0.0005632004,0.000005406414],"category_scores_gemma":[0.0001511942,0.0003897886,0.0002331984,0.0003150679,0.00005912124,0.0002499365,0.00218259,0.001419438,0.000002395748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001171336,"about_ca_system_score_gemma":0.0002312064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006846954,"about_ca_topic_score_gemma":0.0008879658,"domain_scores_codex":[0.9973688,0.00006551862,0.0005479372,0.001113169,0.0003640749,0.0005404881],"domain_scores_gemma":[0.9979846,0.0003222865,0.0001985423,0.00121814,0.0002005409,0.00007588624],"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.000002235966,0.0001027491,0.001493389,0.0001410168,0.00002632187,0.00002959234,0.0008537584,0.00007112819,0.001401997,0.004521551,0.001399674,0.9899566],"study_design_scores_gemma":[0.0001590502,0.00003717421,0.0009620483,0.0005498581,0.00001711443,0.00002924882,0.00005203806,0.8991264,0.01315068,0.08381721,0.001215915,0.0008832884],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008155491,0.0000732052,0.9829958,0.0004130256,0.001490317,0.0008759092,0.000005461648,0.001842952,0.004147843],"genre_scores_gemma":[0.1151882,0.00001045493,0.8838679,0.0001630771,0.0001839677,0.0003937729,0.000007526689,0.00004086249,0.0001442234],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9890733,"threshold_uncertainty_score":0.9998554,"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."}}