{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002792827,0.0001354868,0.000307393,0.0001388953,0.0000366185,0.000009915627,0.0005088794,0.00003245174,0.00008698936],"category_scores_gemma":[0.0005383566,0.00008422686,0.000135801,0.0003582149,0.00009286775,0.00007202127,0.00008153516,0.0005128877,0.000003658622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002590599,"about_ca_system_score_gemma":0.00002321415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002694434,"about_ca_topic_score_gemma":0.000001479161,"domain_scores_codex":[0.9977475,0.0009991575,0.0007151826,0.00008619226,0.0002829407,0.0001689598],"domain_scores_gemma":[0.9984658,0.0005363363,0.0005247545,0.0002908612,0.0001336043,0.00004867212],"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.0001673044,0.0003137765,0.01118545,0.00002833809,0.0000294043,0.0002350832,0.007322418,0.000004951808,0.00003072963,0.9798909,0.0006510195,0.0001406287],"study_design_scores_gemma":[0.0008171909,0.0002406154,0.01127471,0.0001783912,0.00001285246,0.00004718499,0.0004699719,0.00000502021,0.0005996441,0.9861758,0.00008471301,0.00009394151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9430876,0.00006930005,0.0001255662,0.00004144689,0.0003531083,0.00007947831,0.000001033406,0.000006274994,0.05623618],"genre_scores_gemma":[0.9987798,0.00006566579,0.0009929616,0.00006675458,0.00001585276,2.238113e-7,6.412322e-8,0.00002855442,0.00005010075],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05618608,"threshold_uncertainty_score":0.3434671,"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."}}