{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003017209,0.001704281,0.002060193,0.01393465,0.002783018,0.007613439,0.003884109,0.002216946,0.006490108],"category_scores_gemma":[0.01685126,0.001177586,0.001584793,0.007800155,0.007239659,0.0163471,0.006232062,0.004337348,0.000893426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002172305,"about_ca_system_score_gemma":0.0009965863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00148643,"about_ca_topic_score_gemma":0.001737822,"domain_scores_codex":[0.9983303,0.0005639603,0.0001572317,0.0003103758,0.0004513584,0.0001867342],"domain_scores_gemma":[0.9903316,0.006123906,0.0006861307,0.001033131,0.0008902161,0.00093488],"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.00001664028,0.00002133832,0.0003348868,0.00003832529,0.00000746617,0.00005849373,0.0002907907,0.000791207,0.000240602,0.9910289,0.0009837911,0.006187554],"study_design_scores_gemma":[0.000003344649,0.000002983446,0.00005429308,0.00001552634,0.000005597698,0.00003017623,0.00005024882,0.003529372,0.00009443647,0.9947912,0.001416628,0.000006350371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1893476,0.006355,0.7126157,0.003486815,0.001120255,0.0001705978,0.000662612,0.001088933,0.08515255],"genre_scores_gemma":[0.8255623,0.002546413,0.1527497,0.0007723505,0.001234176,0.0003555329,0.0005056098,0.0004741349,0.0157996],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01393465,"threshold_uncertainty_score":0.02171159,"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."}}