{"id":"W2997607600","doi":"10.4230/lipics.ipec.2019.9","title":"C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Planarity testing; Combinatorics; Book embedding; Parameterized complexity; Planar graph; Mathematics; Embedding; Discrete mathematics; Vertex (graph theory); Graph drawing; Graph; 1-planar graph; Computer science; Line 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007071194,0.0004798508,0.0007079611,0.0004227245,0.0003544207,0.0004432112,0.001607624,0.0001987235,0.00002622667],"category_scores_gemma":[0.0001079014,0.0004112037,0.0002581883,0.0009967727,0.000238311,0.001851793,0.0006997121,0.0004978357,0.00004971154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007787592,"about_ca_system_score_gemma":0.0001857996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008766478,"about_ca_topic_score_gemma":0.00006618215,"domain_scores_codex":[0.9966151,0.00005701636,0.001194634,0.0004351707,0.0008149651,0.0008831876],"domain_scores_gemma":[0.9966793,0.0003943483,0.0007615519,0.001394707,0.0005433104,0.0002267679],"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.001362593,0.003626195,0.303335,0.009586053,0.00265937,0.0001060177,0.09305971,0.003398911,0.001343159,0.472206,0.006703404,0.1026136],"study_design_scores_gemma":[0.01585881,0.003832621,0.0161824,0.001409795,0.0001711951,0.0007269961,0.003859624,0.8946933,0.005171048,0.04175213,0.01336327,0.002978844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8088743,0.00003192136,0.1776515,0.0001893453,0.001245477,0.001789488,0.0003867171,0.0004331053,0.009398212],"genre_scores_gemma":[0.7923599,0.000004257892,0.2067785,0.0004592181,0.00005483909,0.0000423962,0.0001317429,0.00003395764,0.0001351211],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8912944,"threshold_uncertainty_score":0.999834,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01945839379812749,"score_gpt":0.2348391680125248,"score_spread":0.2153807742143973,"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."}}