{"id":"W2406837711","doi":"","title":"Number of disjoint 5-cycles in graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"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.0004832701,0.0001044574,0.0001750965,0.0001574858,0.00004221987,0.00002982629,0.001019875,0.00006623426,0.00003781031],"category_scores_gemma":[0.0001300745,0.00009967092,0.00006345152,0.0008035507,0.0001645252,0.0003704629,0.000325934,0.0003690117,0.00005240276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001293543,"about_ca_system_score_gemma":0.00004241121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003521079,"about_ca_topic_score_gemma":0.00002908566,"domain_scores_codex":[0.9988122,0.00007476658,0.000228812,0.0002818585,0.0003011201,0.0003012305],"domain_scores_gemma":[0.9988231,0.0001854376,0.00006741092,0.0007505133,0.00008351982,0.0000899864],"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.000005598061,0.0001104071,0.05869594,0.000007030042,0.000004075116,0.00001023035,0.0001718376,0.000001694399,0.005249761,0.9327429,0.00005526675,0.002945239],"study_design_scores_gemma":[0.0004227665,0.00002510344,0.03891393,0.00001030807,7.074503e-7,0.00000742964,0.00001300456,0.0003278707,0.01034202,0.9496543,0.0001772061,0.0001053626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9940093,0.00001927739,0.0005021528,0.0001793239,0.001006953,0.0001187887,0.000001033039,0.00005711426,0.00410613],"genre_scores_gemma":[0.993356,0.000007763097,0.006531944,0.00002267007,0.000002076956,0.00001464635,6.191691e-7,0.000009418858,0.00005489082],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01978201,"threshold_uncertainty_score":0.4064462,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01232093547117951,"score_gpt":0.293827753271477,"score_spread":0.2815068178002975,"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."}}