{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001802656,0.00182785,0.001108823,0.003394455,0.001202845,0.002094264,0.002683026,0.00143073,0.00323083],"category_scores_gemma":[0.009092033,0.0006239259,0.0009406825,0.003616721,0.001139658,0.004160475,0.001761694,0.001925125,0.001399873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001532716,"about_ca_system_score_gemma":0.002108838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002612624,"about_ca_topic_score_gemma":0.003114504,"domain_scores_codex":[0.9978641,0.0006050911,0.0001964458,0.0003563811,0.0007487528,0.0002293475],"domain_scores_gemma":[0.9945773,0.002290587,0.0006896883,0.001077602,0.001173271,0.0001915573],"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.0003478211,0.0001535026,0.001218865,0.0003355577,0.0001083731,0.0001411031,0.0004688258,0.2445532,0.01224116,0.2127399,0.006951694,0.5207399],"study_design_scores_gemma":[0.00006033232,0.0001309153,0.0002171693,0.00005150874,0.00004277207,0.000192427,0.00006489475,0.8270379,0.0146815,0.1478585,0.009609111,0.00005305443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002725198,0.0001155899,0.9957748,0.00005499321,0.00002618856,0.00006744241,0.0000422575,0.0006424237,0.0005511428],"genre_scores_gemma":[0.06824709,0.0004113705,0.927599,0.00008186499,0.00009368813,0.0003874726,0.0003156532,0.0001702103,0.002693531],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003394455,"threshold_uncertainty_score":0.01112068,"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."}}