{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008558652,0.001399141,0.001279795,0.002342225,0.001425675,0.002525927,0.002040493,0.001760228,0.003586994],"category_scores_gemma":[0.009544552,0.0009058983,0.0006998639,0.002503787,0.00147881,0.005029136,0.001517561,0.001091219,0.0005419928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002214635,"about_ca_system_score_gemma":0.001062957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001541255,"about_ca_topic_score_gemma":0.002552727,"domain_scores_codex":[0.9989216,0.0002748592,0.00005454368,0.0004204331,0.0001559619,0.0001725091],"domain_scores_gemma":[0.9942681,0.003768593,0.0007122955,0.000468986,0.0003541058,0.0004277841],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001073422,0.0001783776,0.005101269,0.001712594,0.0003538929,0.0005767023,0.0005930521,0.4139913,0.04094726,0.3925445,0.01374856,0.1291791],"study_design_scores_gemma":[0.00006798615,0.0002148177,0.001979949,0.0002117285,0.0001478172,0.0005953949,0.0002326102,0.4497255,0.01262157,0.5213445,0.01277625,0.00008185607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.574773,0.008104206,0.3737851,0.003290391,0.0002077426,0.0002435812,0.002204842,0.00082683,0.03656431],"genre_scores_gemma":[0.8302429,0.003882338,0.1551579,0.0003717967,0.0001939636,0.0003606298,0.0009545547,0.0004811941,0.008354639],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003586994,"threshold_uncertainty_score":0.0160684,"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."}}