{"id":"W3217470394","doi":"10.4230/lipics.isaac.2021.16","title":"Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Planar graph; Planar straight-line graph; Outerplanar graph; Book embedding; Edge contraction; Combinatorics; Planar; Graph; Mathematics; Discrete mathematics; Computer science; 1-planar graph; Pathwidth; Line graph; Voltage graph","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.0003442818,0.0007857715,0.0008411715,0.0009077222,0.000683128,0.0009514821,0.001100884,0.0006293467,0.005525106],"category_scores_gemma":[0.001787091,0.0005656867,0.0008731912,0.001347843,0.0006116448,0.002646988,0.002137484,0.0009804743,0.001769148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005249195,"about_ca_system_score_gemma":0.0008795254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003258032,"about_ca_topic_score_gemma":0.007635147,"domain_scores_codex":[0.9995964,0.00005149987,0.00003000868,0.0001202741,0.0001090136,0.00009278485],"domain_scores_gemma":[0.9993041,0.0003027835,0.00005144446,0.0001994132,0.0001008481,0.00004138227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005614326,0.0002598645,0.004134458,0.0006969366,0.00007564732,0.0003532582,0.0006920379,0.1365886,0.05283647,0.05603258,0.03207032,0.7156984],"study_design_scores_gemma":[0.0002263601,0.0003162661,0.002537339,0.000114636,0.0001088881,0.0007035824,0.001089332,0.6896355,0.04731822,0.2137533,0.04412337,0.00007315013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1391346,0.0004613563,0.8476782,0.0005484048,0.0000824693,0.0002525077,0.0009647713,0.002577272,0.008300561],"genre_scores_gemma":[0.2264065,0.0003258023,0.7633091,0.0001403198,0.00002617784,0.0001372271,0.003184284,0.0006694477,0.005801098],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005525106,"threshold_uncertainty_score":0.01848334,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01295134772105417,"score_gpt":0.236633510822665,"score_spread":0.2236821631016108,"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."}}