{"id":"W2397294813","doi":"","title":"A new bound on maximum genus of simple graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Simple (philosophy); Combinatorics; Zoology; Biology","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002137251,0.0001365258,0.0001835904,0.0001527207,0.00008301159,0.00003469512,0.0006789117,0.00006782555,0.00004110517],"category_scores_gemma":[0.00002747243,0.0001252496,0.00009146328,0.0005025389,0.00004700434,0.0001580469,0.0001494322,0.000113637,0.00008602679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001086657,"about_ca_system_score_gemma":0.00007678613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003960606,"about_ca_topic_score_gemma":0.000004086005,"domain_scores_codex":[0.9988514,0.00004212642,0.0002500561,0.0003168837,0.0002751158,0.0002644584],"domain_scores_gemma":[0.9988416,0.00004653142,0.0001181506,0.0007453047,0.00008874299,0.0001596375],"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.000009102893,0.0001194987,0.001087012,0.000006008666,0.00001737262,0.000009373955,0.0005275206,0.000001840093,0.0004071297,0.9865348,0.006094481,0.005185835],"study_design_scores_gemma":[0.0006161259,0.000339695,0.001982054,0.00001690916,0.000006538741,0.000004262606,0.000007692662,0.0001407486,0.01038141,0.9856223,0.0007413388,0.0001408907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9875033,0.0002363127,0.0009369352,0.000117427,0.002112105,0.0001421084,0.000001369243,0.0001957469,0.008754631],"genre_scores_gemma":[0.9927645,0.00000934417,0.006892146,0.0001992409,7.656059e-7,0.000003794397,0.000001091819,0.00001053707,0.0001185415],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009974279,"threshold_uncertainty_score":0.5107529,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0237595885336454,"score_gpt":0.2271392968319619,"score_spread":0.2033797082983165,"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."}}