{"id":"W2899943641","doi":"","title":"Planar k-NodeTrix Graphs: A New Family of Beyond Planar Graphs","year":2017,"lang":"en","type":"article","venue":"Graph Drawing E-print Archive (Die Universität zu Köln)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Ciência sem Fronteiras; Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Grantová Agentura České Republiky; National Institutes of Health; National Science Foundation","keywords":"Planar; Combinatorics; Planar graph; 1-planar graph; Planar straight-line graph; Chordal graph; Outerplanar graph; Mathematics; Pathwidth; Computer science; Discrete mathematics; Graph; Line graph; Computer graphics (images)","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.0003791792,0.0007960871,0.0007551184,0.001874879,0.001906262,0.002931888,0.002071624,0.001337575,0.01398233],"category_scores_gemma":[0.002491939,0.0007302577,0.0008423457,0.003114887,0.00162402,0.004996533,0.002070848,0.002267571,0.002201561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009412694,"about_ca_system_score_gemma":0.0005809175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001243545,"about_ca_topic_score_gemma":0.00166052,"domain_scores_codex":[0.9993918,0.0001066425,0.0000252665,0.0002112611,0.0001686812,0.00009634153],"domain_scores_gemma":[0.9981389,0.0005888606,0.0003091313,0.0003893244,0.0003103761,0.000263473],"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.00009080324,0.00004412358,0.001011295,0.0002429942,0.00002385049,0.000435404,0.0004581391,0.006844318,0.003339366,0.9261574,0.01324632,0.04810584],"study_design_scores_gemma":[0.00004400458,0.00007416675,0.001245147,0.00008771042,0.00004930564,0.001809947,0.0005423225,0.02527077,0.002453515,0.8838251,0.08455285,0.00004517788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2170169,0.002942273,0.5772824,0.003021308,0.0003577865,0.0003288802,0.003082664,0.002279596,0.1936881],"genre_scores_gemma":[0.6810468,0.005203927,0.2225168,0.00128284,0.0003969369,0.0004364237,0.005972619,0.00130203,0.08184155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01398233,"threshold_uncertainty_score":0.04677552,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02347245938337535,"score_gpt":0.2599352690982509,"score_spread":0.2364628097148756,"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."}}