{"id":"W2154993501","doi":"10.1109/tcomm.2012.100912.120503","title":"Message-Passing Algorithms for Counting Short Cycles in a Graph","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Bipartite graph; Message passing; Algorithm; Computer science; Computational complexity theory; Graph theory; Matrix multiplication; Graph; Theoretical computer science; Mathematics; Combinatorics; 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":[],"consensus_categories":[],"category_scores_codex":[0.0008204199,0.0001582134,0.0001713725,0.0003738466,0.0006168523,0.0001088399,0.00162433,0.00009299326,0.000003772896],"category_scores_gemma":[0.00001984994,0.0001772992,0.0001248908,0.0006908819,0.00009140813,0.0006876707,0.00001732949,0.000414799,0.000009045026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001390171,"about_ca_system_score_gemma":0.00005082155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001349991,"about_ca_topic_score_gemma":0.0003058579,"domain_scores_codex":[0.9987159,0.0001498391,0.00034006,0.0002336551,0.0001746703,0.0003858643],"domain_scores_gemma":[0.9971169,0.0007577802,0.00007165779,0.001874596,0.00009869385,0.00008036749],"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.00002216267,0.003172329,0.002242759,0.00006912654,0.0001178399,0.000001547832,0.01062813,0.002778336,0.009620173,0.02374589,0.0009349199,0.9466668],"study_design_scores_gemma":[0.001367752,0.0003215733,0.005646778,0.0007828554,0.0001655895,0.0001173112,0.001457782,0.8350626,0.1176726,0.0162916,0.01893053,0.002183062],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001974742,0.0002003463,0.9933039,0.001399611,0.0004007453,0.0004154151,0.000009489047,0.0006569863,0.001638757],"genre_scores_gemma":[0.6910633,0.0000705474,0.3082938,0.00009823385,0.00001799783,0.0003867862,0.000002011039,0.00001712721,0.00005015631],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9444837,"threshold_uncertainty_score":0.7230052,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08365801311970401,"score_gpt":0.3494965390896761,"score_spread":0.2658385259699721,"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."}}