{"id":"W2402960228","doi":"","title":"On the Maximum Number of Disjoint Chorded Cycles in Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002565719,0.001162151,0.001620591,0.003935811,0.002079851,0.004151308,0.003543175,0.002532536,0.01163243],"category_scores_gemma":[0.03267645,0.001164465,0.0008191711,0.003211445,0.004158393,0.01165919,0.003250609,0.00279261,0.001329702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002231675,"about_ca_system_score_gemma":0.0008524379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001037567,"about_ca_topic_score_gemma":0.001771933,"domain_scores_codex":[0.9978679,0.0006827498,0.0001603428,0.0005017326,0.0004332308,0.0003539326],"domain_scores_gemma":[0.9671981,0.02630603,0.001881754,0.001575475,0.001225079,0.001813471],"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.001099352,0.0001570626,0.005869347,0.001422272,0.0002369438,0.0003799282,0.0007780883,0.04183918,0.006381767,0.8345916,0.02282238,0.08442203],"study_design_scores_gemma":[0.00009814878,0.00009537297,0.001477297,0.0001913874,0.0000903421,0.0005092805,0.000351628,0.0344214,0.0019271,0.9519116,0.008883917,0.00004256099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5486045,0.02301891,0.2366694,0.01430756,0.002135861,0.0003102296,0.004601986,0.0008511291,0.1695003],"genre_scores_gemma":[0.9263594,0.007311271,0.05056806,0.0007871868,0.001887966,0.0003261901,0.00146305,0.0003676092,0.01092948],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01163243,"threshold_uncertainty_score":0.03891438,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02827805414920139,"score_gpt":0.2801251987870706,"score_spread":0.2518471446378692,"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."}}