{"id":"W2588224742","doi":"10.37236/8747","title":"The Maximum Number of Cycles in a Graph with Fixed Number of Edges","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Multigraph; Combinatorics; Multiple edges; Mathematics; Graph; Complement graph; Upper and lower bounds; Graph power; Strength of a graph; Discrete mathematics; Line graph","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.0021469,0.0002655661,0.0007040265,0.00009787063,0.00009469255,0.00002544187,0.00127447,0.0001831348,0.00001839152],"category_scores_gemma":[0.0001484291,0.0001450804,0.0003183958,0.0004703355,0.000267995,0.00005312906,0.0001979702,0.001765957,0.000004222091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001249149,"about_ca_system_score_gemma":0.0006266183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001505012,"about_ca_topic_score_gemma":0.00002417308,"domain_scores_codex":[0.9975854,0.0003483595,0.0009498017,0.0001490764,0.0005303011,0.0004371241],"domain_scores_gemma":[0.9951551,0.001498428,0.002011797,0.0008443696,0.0004488821,0.00004144453],"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.0001889596,0.0003656548,0.004751327,0.0001696488,0.0003635417,0.000001288109,0.0005011453,0.00007997391,0.00005723358,0.9930757,0.0002741864,0.0001713388],"study_design_scores_gemma":[0.0007678783,0.0001196964,0.0007002054,0.0003251666,0.0002305062,0.0001187527,0.0004673522,0.00001122156,0.001825244,0.9949409,0.0003426034,0.0001504247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9928399,0.001306299,0.002256798,0.0005120487,0.0002292081,0.0004564192,0.000006930769,0.000009347603,0.002383034],"genre_scores_gemma":[0.9978979,0.001653871,0.0001023797,0.000008901986,0.00003360675,0.00001961324,0.000001244002,0.00003985872,0.0002425917],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005058018,"threshold_uncertainty_score":0.76723,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01672675706847651,"score_gpt":0.2976005025443167,"score_spread":0.2808737454758402,"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."}}