{"id":"W2888654318","doi":"10.48550/arxiv.2011.08049","title":"Efficient polynomial-time approximation scheme for the genus of dense graphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani","keywords":"Combinatorics; Mathematics; Embedding; Genus; Time complexity; Order (exchange); Polynomial; Discrete mathematics; Function (biology); Mathematical analysis; Computer science; Finance","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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.0005324293,0.0002497286,0.0003323088,0.0002762029,0.0002125177,0.00006303407,0.002591904,0.0001657663,0.00001052259],"category_scores_gemma":[0.0001582172,0.0002312446,0.0003658163,0.0009161559,0.000274992,0.0001031583,0.001989199,0.0004245522,0.00003810271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001000619,"about_ca_system_score_gemma":0.0001973623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002060941,"about_ca_topic_score_gemma":0.000001674643,"domain_scores_codex":[0.9981824,0.000162534,0.0002394452,0.000894901,0.0001644561,0.0003562255],"domain_scores_gemma":[0.9973401,0.0005647762,0.0003312126,0.001344341,0.0002837545,0.0001358039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000263303,0.0001201365,0.0001202487,0.0002135591,0.0002133487,0.00003580309,0.0004785908,0.4546182,0.003075408,0.5382152,0.0003446257,0.002301587],"study_design_scores_gemma":[0.0004398377,0.00006488829,0.000123345,0.00003958127,0.00004101744,0.000001766687,0.00004294312,0.9186261,0.001752673,0.07845207,0.0001909042,0.0002248927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1846293,0.0001356068,0.8134717,0.0002438816,0.0001992166,0.0009453479,0.00003281007,0.0001195811,0.0002225163],"genre_scores_gemma":[0.9862581,0.00004063262,0.01329535,0.00004371456,0.00003836477,0.00000663791,0.000008005113,0.00002023082,0.0002889266],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8016288,"threshold_uncertainty_score":0.9429882,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07299527911596179,"score_gpt":0.2208616486884298,"score_spread":0.147866369572468,"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."}}