{"id":"W2972155844","doi":"10.1109/focs.2019.00056","title":"Planar Graphs have Bounded Queue-Number","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Treewidth; Combinatorics; 1-planar graph; Mathematics; Planar graph; Discrete mathematics; Graph minor; Pathwidth; Book embedding; Bounded function; Partial k-tree; Line graph; Graph; Graph power","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000304749,0.0001198071,0.0001370449,0.0001113639,0.00008213273,0.0001408321,0.001102972,0.00005309198,0.0005997531],"category_scores_gemma":[0.00002035957,0.00009977345,0.00007480771,0.0003864359,0.00007027057,0.0005938611,0.0002087664,0.000179142,0.003735873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002693685,"about_ca_system_score_gemma":0.00004620201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004351438,"about_ca_topic_score_gemma":0.00003146024,"domain_scores_codex":[0.998552,0.00007621041,0.0001388686,0.0004219795,0.0003866686,0.0004242667],"domain_scores_gemma":[0.9987142,0.000143491,0.00003268244,0.0009094281,0.00007188353,0.0001283175],"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.000008239919,0.00002214425,0.01109775,0.000005040732,0.00001095708,0.00001107862,0.0001060446,0.000006495586,0.0006811675,0.9846136,0.001377816,0.002059654],"study_design_scores_gemma":[0.0004244948,0.0000651712,0.002246679,0.000007718905,0.000001096016,0.00003060911,0.0000605401,0.003861803,0.002959698,0.9760317,0.01407331,0.000237213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.153037,0.00005246879,0.4280689,0.001159744,0.0004962958,0.0004980992,0.000002726919,0.000579608,0.4161052],"genre_scores_gemma":[0.9206935,0.000008492441,0.04856104,0.0007550108,0.00001980006,0.00001423097,0.000002183727,0.00001509164,0.02993061],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7676566,"threshold_uncertainty_score":0.9970399,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0171611951110598,"score_gpt":0.2936455223927005,"score_spread":0.2764843272816407,"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."}}