{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001140887,0.001643791,0.001380528,0.001061528,0.001060452,0.003409231,0.003621283,0.001324817,0.006850532],"category_scores_gemma":[0.006467242,0.000625159,0.001799286,0.001863575,0.00119825,0.006138223,0.00330265,0.00299582,0.00237935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004296258,"about_ca_system_score_gemma":0.002814715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00590808,"about_ca_topic_score_gemma":0.008663482,"domain_scores_codex":[0.998078,0.0002131299,0.0001069416,0.0005193413,0.0006206924,0.0004618838],"domain_scores_gemma":[0.9965766,0.001188177,0.0002595225,0.001486227,0.0002931711,0.0001961714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002871797,0.000539831,0.008141891,0.00105809,0.0001853986,0.0003021515,0.001385508,0.4011152,0.03830851,0.1471045,0.02412516,0.374862],"study_design_scores_gemma":[0.000191946,0.0001365703,0.0009092301,0.00006299008,0.00007894813,0.0001749419,0.000199303,0.8692351,0.01139314,0.1104023,0.007174849,0.00004061244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1608179,0.0009168526,0.8104514,0.001176792,0.000121716,0.0002657646,0.001559388,0.01336436,0.01132577],"genre_scores_gemma":[0.5255451,0.0004287494,0.4629489,0.0002769704,0.00008490295,0.0002836957,0.003587589,0.001045857,0.005798311],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006850532,"threshold_uncertainty_score":0.03117168,"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."}}