{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000615475,0.0001252266,0.0001670205,0.000126274,0.00006803714,0.00002141836,0.001313386,0.00004775174,0.00007827061],"category_scores_gemma":[0.0001385703,0.00008905054,0.00007460608,0.0008051794,0.0001844707,0.000216768,0.0003099446,0.0002548958,0.00008700193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000257322,"about_ca_system_score_gemma":0.00002838329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000610405,"about_ca_topic_score_gemma":0.000008348553,"domain_scores_codex":[0.9986257,0.0002035111,0.0002265541,0.0002871195,0.0003399318,0.000317209],"domain_scores_gemma":[0.9985535,0.0003351908,0.00008072385,0.0009003793,0.00006696983,0.00006319289],"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.00002431908,0.0001853366,0.009174055,0.000004600186,0.000008868282,0.00001072334,0.0007198161,0.000001580529,0.0001399224,0.9881415,0.0001052167,0.001484108],"study_design_scores_gemma":[0.0003603396,0.00007649421,0.0229572,0.00002394689,0.000001058203,0.000002718056,0.00004938856,0.0001593739,0.006066909,0.9701723,0.00003043029,0.0000998116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9815193,0.00002597313,0.0005849355,0.0002314474,0.0004613271,0.0002229351,0.000001127509,0.000051042,0.01690185],"genre_scores_gemma":[0.9986436,0.00001283465,0.001182088,0.00007559747,0.000001053663,0.00003146007,3.414771e-7,0.00001090979,0.00004213957],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01796913,"threshold_uncertainty_score":0.3631376,"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."}}