{"id":"W2927674350","doi":"10.1016/j.jctb.2019.03.003","title":"Tools for counting odd cycles in graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Vertex (graph theory); Graph; Chordal graph; Discrete mathematics","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.002752072,0.0001739242,0.0005263981,0.0001974972,0.0001127269,0.00009317272,0.0003930148,0.000136788,0.0001142395],"category_scores_gemma":[0.001469902,0.0001340661,0.000270068,0.0001628904,0.00009762105,0.000740396,0.00007039023,0.0003044455,0.000001394488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004547214,"about_ca_system_score_gemma":0.00006079686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.623179e-7,"about_ca_topic_score_gemma":7.77381e-7,"domain_scores_codex":[0.9984052,0.0001998808,0.0007119331,0.0001207665,0.00030142,0.000260838],"domain_scores_gemma":[0.996384,0.002478888,0.0005861506,0.0002398652,0.0002532024,0.00005790326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001451663,0.00006539734,0.001182833,0.00009764685,0.00007519547,0.000007418551,0.0009371593,0.000005995757,0.000519726,0.9943478,0.0002526602,0.00105648],"study_design_scores_gemma":[0.00209368,0.0004216201,0.0004377628,0.0001255685,0.00003637882,0.00004604858,0.001098641,0.000003149608,0.001877991,0.9886669,0.005028831,0.0001634169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9873154,0.0001817817,0.0001783432,0.00006742883,0.008213163,0.0003104976,0.000006550552,0.00001691089,0.003709945],"genre_scores_gemma":[0.9973652,0.00003705279,0.001864305,0.00005627375,0.0004509826,0.000004548765,7.576459e-7,0.00003156109,0.0001892733],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01004987,"threshold_uncertainty_score":0.5467058,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02308518115610329,"score_gpt":0.2887943576930201,"score_spread":0.2657091765369168,"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."}}