{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008337675,0.0005980357,0.0007519141,0.002324479,0.001621009,0.0003393803,0.006744196,0.0001765863,0.00002255089],"category_scores_gemma":[0.0002514232,0.000633027,0.0007016786,0.0009461278,0.001296077,0.002998358,0.001488299,0.0008562878,0.00006975537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000809816,"about_ca_system_score_gemma":0.0003453115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009083221,"about_ca_topic_score_gemma":0.0002519936,"domain_scores_codex":[0.9953828,0.0003638988,0.000560887,0.001351522,0.001085578,0.001255275],"domain_scores_gemma":[0.9943575,0.000691134,0.0006028696,0.003397303,0.000224532,0.000726693],"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.0003053395,0.000125658,0.005667214,0.00006260548,0.0003420187,0.0005770233,0.00245845,0.0001391873,0.0142815,0.9642798,0.001274715,0.01048652],"study_design_scores_gemma":[0.002034926,0.0003589683,0.03024808,0.0002021259,0.00006163713,0.00003538706,0.0006374178,0.0006583605,0.002532483,0.957638,0.004804251,0.0007883738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1788595,0.0009801949,0.7661003,0.001165959,0.001086296,0.001077648,0.000178348,0.0006053364,0.04994636],"genre_scores_gemma":[0.9010244,0.0006326541,0.09674455,0.0002579613,0.00008321836,0.000008885529,0.0000369998,0.00007900883,0.001132348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7221649,"threshold_uncertainty_score":0.9996787,"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."}}