{"id":"W4403526016","doi":"10.4230/lipics.gd.2024.14","title":"Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"Japan Society for the Promotion of Science; Deutsche Forschungsgemeinschaft","keywords":"Treewidth; Bounding overwatch; Combinatorics; Planar graph; 1-planar graph; Chordal graph; Planar; Clique-sum; Pathwidth; Mathematics; Computer science; Graph; Artificial intelligence; Computer graphics (images); 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00107302,0.001411538,0.00129126,0.001680603,0.0010782,0.002469164,0.002783543,0.001540719,0.006028311],"category_scores_gemma":[0.01406018,0.001330193,0.001870479,0.002385426,0.002016829,0.008642245,0.004001673,0.004468895,0.001636925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001666251,"about_ca_system_score_gemma":0.000672135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002381,"about_ca_topic_score_gemma":0.003830751,"domain_scores_codex":[0.9979748,0.0003434612,0.00009506453,0.0005520079,0.0006842153,0.0003504489],"domain_scores_gemma":[0.9913964,0.005137918,0.001000338,0.001412433,0.0006625397,0.0003904521],"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.0008337836,0.0001998662,0.01168381,0.001579856,0.0003189585,0.0009570561,0.001657226,0.332698,0.04916672,0.4103327,0.02475407,0.1658179],"study_design_scores_gemma":[0.00007529074,0.0001215177,0.002412358,0.0001836068,0.0001402761,0.0008388835,0.0004150553,0.499595,0.01086277,0.4657772,0.01950069,0.00007735272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1689247,0.003842058,0.7959799,0.002411996,0.0002184322,0.000125889,0.00127132,0.001353192,0.02587264],"genre_scores_gemma":[0.6531337,0.005435222,0.3285354,0.00099377,0.0003665378,0.0003190357,0.002379512,0.001315078,0.007521592],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006028311,"threshold_uncertainty_score":0.02016675,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08265023632790686,"score_gpt":0.2319563006026829,"score_spread":0.1493060642747761,"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."}}