{"id":"W2084966456","doi":"10.1016/j.jda.2012.10.005","title":"On a conjecture of Erdős for multiplicities of cliques","year":2012,"lang":"fr","type":"article","venue":"Journal of Discrete Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Conjecture; Complement (music); Order (exchange); Graph; Counterexample; Limit (mathematics); Discrete mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.001226488,0.0002937123,0.000985723,0.0002225634,0.00009320268,0.00001519008,0.0003514478,0.0003024127,0.0001501588],"category_scores_gemma":[0.0007860436,0.0002081968,0.0008024313,0.0001206091,0.0004239682,0.0002819054,0.00007811563,0.0004257389,6.667643e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005260999,"about_ca_system_score_gemma":0.00007656108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001488799,"about_ca_topic_score_gemma":0.000001991019,"domain_scores_codex":[0.997506,0.0001946882,0.001293806,0.0001098649,0.0004745985,0.0004210336],"domain_scores_gemma":[0.9953035,0.001823072,0.001904468,0.0003082437,0.000481025,0.0001796845],"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.0009091353,0.0005990372,0.0008403615,0.002428764,0.001451823,0.000008071279,0.0181292,0.00009013253,0.001192997,0.9445655,0.006763344,0.02302163],"study_design_scores_gemma":[0.003759199,0.004630536,0.001229373,0.00272841,0.001303483,0.0002904803,0.004332203,0.000961659,0.05690874,0.911788,0.01154502,0.0005229153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8863956,0.04628395,0.05197132,0.001317272,0.00842006,0.0009528885,0.00142579,0.00001752703,0.003215567],"genre_scores_gemma":[0.9189276,0.0007406789,0.07770365,0.0001074963,0.001530081,0.000004005531,0.000003316642,0.00005690918,0.0009262663],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05571574,"threshold_uncertainty_score":0.8490021,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03277983102887465,"score_gpt":0.3383146528657846,"score_spread":0.3055348218369099,"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."}}