{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001817122,0.0002358,0.0005315614,0.0001172596,0.0001533703,0.00001248846,0.0003031057,0.0001600949,0.0001751172],"category_scores_gemma":[0.0006718505,0.0001809349,0.0003014837,0.000151047,0.0002513028,0.00003489446,0.00005612404,0.0001798334,0.000002099288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003119828,"about_ca_system_score_gemma":0.000007937857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004709569,"about_ca_topic_score_gemma":0.000001228814,"domain_scores_codex":[0.9987343,0.0000821908,0.0004159617,0.0002386992,0.0002754843,0.0002533859],"domain_scores_gemma":[0.9957713,0.003182871,0.0002679056,0.0005602765,0.0001598462,0.00005777517],"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.0001727941,0.00039312,0.0002620785,0.0002265762,0.00009208643,0.000001659783,0.0009829719,0.00000244052,0.0003674373,0.9877357,0.009543357,0.0002197836],"study_design_scores_gemma":[0.00132042,0.001247442,0.0004787252,0.0001089689,0.00004722211,0.000001811207,0.00007950702,0.00009636599,0.006966243,0.9856631,0.003781124,0.0002091043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9870182,0.0002814694,0.0001030669,0.0001344981,0.0007782941,0.0005351672,0.0001210424,0.00006630971,0.01096197],"genre_scores_gemma":[0.9982232,0.00003887749,0.0008634431,0.0002016625,0.00003497068,0.00002480655,0.000002578447,0.00003994787,0.0005705111],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01120502,"threshold_uncertainty_score":0.737831,"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."}}