{"id":"W1982114488","doi":"10.1007/s004930200024","title":"On Erdős's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Upper and lower bounds; Discrete mathematics","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.01261192,0.00300202,0.005699113,0.007079649,0.007250247,0.01019247,0.009413221,0.005648538,0.01937019],"category_scores_gemma":[0.07304186,0.004313932,0.004230701,0.007424436,0.01095758,0.03090852,0.01108678,0.0166661,0.002753902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005904443,"about_ca_system_score_gemma":0.001944622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002862764,"about_ca_topic_score_gemma":0.002669461,"domain_scores_codex":[0.9888675,0.00250582,0.0005415332,0.003410114,0.002596736,0.002078421],"domain_scores_gemma":[0.894988,0.08643423,0.003992104,0.006523333,0.002901765,0.005160552],"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.001117362,0.0002656188,0.003493339,0.0004476749,0.0001365965,0.0002703039,0.0013621,0.01252109,0.002045412,0.9475747,0.01557121,0.01519454],"study_design_scores_gemma":[0.00009266545,0.00004404424,0.0006481909,0.00007634508,0.0000775571,0.0001578262,0.0001645947,0.0198373,0.0009764265,0.9736473,0.004226546,0.0000513117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4482416,0.009254902,0.2836788,0.05409498,0.002129733,0.000382633,0.004442503,0.002256678,0.1955182],"genre_scores_gemma":[0.918117,0.003767418,0.04360279,0.00443352,0.004978992,0.0006374283,0.002111364,0.0007902748,0.02156118],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01937019,"threshold_uncertainty_score":0.06669903,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04431388227827605,"score_gpt":0.2869376112823541,"score_spread":0.242623729004078,"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."}}