{"id":"W1985880617","doi":"10.1016/j.ejc.2011.04.001","title":"On the maximum number of cliques in a graph embedded in a surface","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Omega; Combinatorics; Mathematics; Integer (computer science); Graph; Sigma; Vertex (graph theory); Surface (topology); Discrete mathematics; Physics; Geometry; Quantum mechanics; Computer science","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.003052573,0.001134445,0.001959009,0.003941556,0.002677716,0.004287483,0.004083504,0.003092615,0.007268356],"category_scores_gemma":[0.01954498,0.001431439,0.001255077,0.002379261,0.005734946,0.01116136,0.003168156,0.002841165,0.0004566888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001870087,"about_ca_system_score_gemma":0.0006632215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001610729,"about_ca_topic_score_gemma":0.002283722,"domain_scores_codex":[0.9984201,0.0005399642,0.00008060967,0.000409538,0.0003104765,0.0002392222],"domain_scores_gemma":[0.9654958,0.02801033,0.00195353,0.0009951069,0.0009590535,0.002586097],"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.0008187449,0.0001985126,0.005248912,0.0006005378,0.0001396003,0.0004916012,0.00141412,0.04602642,0.009450701,0.914955,0.005103449,0.01555245],"study_design_scores_gemma":[0.00007785391,0.00007305208,0.002034888,0.0000758699,0.00006271286,0.0003346898,0.0004151793,0.113719,0.001398061,0.8796349,0.002123443,0.00005036328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8545347,0.001935276,0.09851535,0.005541785,0.0002463479,0.00007724185,0.0007425557,0.0002739041,0.03813295],"genre_scores_gemma":[0.9555597,0.001073693,0.03299762,0.0003327681,0.0005580412,0.0001486725,0.0007029357,0.0002175436,0.008409061],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007268356,"threshold_uncertainty_score":0.02431512,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04936329978905404,"score_gpt":0.2832906917682521,"score_spread":0.233927391979198,"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."}}