{"id":"W4289455500","doi":"10.1109/focs.2018.00074","title":"Efficient Polynomial-Time Approximation Scheme for the Genus of Dense Graphs","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Genus; Time complexity; Polynomial-time approximation scheme; Quadratic equation; Mathematics; Scheme (mathematics); Approximation algorithm; Embedding; Polynomial; Combinatorics; Discrete mathematics; Algorithm; Computer science; Mathematical analysis; Artificial intelligence; Geometry","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.001133619,0.001016221,0.001191947,0.000970853,0.001097684,0.0026147,0.002922504,0.001108942,0.003598072],"category_scores_gemma":[0.007112288,0.0004531561,0.001169901,0.001728481,0.001152243,0.005025585,0.002871802,0.002147042,0.0008632458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003753962,"about_ca_system_score_gemma":0.0024458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004228816,"about_ca_topic_score_gemma":0.005176841,"domain_scores_codex":[0.9982973,0.0002390781,0.00009692026,0.0004491821,0.0005364447,0.0003810868],"domain_scores_gemma":[0.9959537,0.001234163,0.0003979679,0.001896479,0.0003013031,0.0002163417],"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.003155387,0.0005162639,0.009184534,0.0006549332,0.0001873591,0.000257305,0.001019032,0.4502533,0.07141569,0.1460782,0.01327681,0.304001],"study_design_scores_gemma":[0.0001981187,0.0001439602,0.001031498,0.00002579775,0.00006724757,0.0001463746,0.0001184887,0.8975357,0.01509932,0.08264774,0.002945818,0.00003993881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2715896,0.0005944949,0.7100298,0.0009395172,0.00009896518,0.0002129176,0.0009478143,0.009549465,0.006037425],"genre_scores_gemma":[0.7509742,0.000220958,0.244445,0.0001439071,0.00005430249,0.0001750687,0.001548648,0.0003701896,0.002067709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004228816,"threshold_uncertainty_score":0.027237,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02184293508396369,"score_gpt":0.2890824211643078,"score_spread":0.2672394860803441,"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."}}