{"id":"W4408140300","doi":"10.1016/j.tcs.2025.115160","title":"On 1-planar graphs with bounded cop-number","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Planar graph; Mathematics; Combinatorics; Planar; Discrete mathematics; 1-planar graph; Outerplanar graph; Pathwidth; Chordal graph; Graph; Computer science; Line graph; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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.0008070063,0.002025034,0.001963946,0.002627843,0.002295163,0.003410704,0.002079359,0.002322226,0.008253999],"category_scores_gemma":[0.008866628,0.001025943,0.001523651,0.002563998,0.0037799,0.007290326,0.003273045,0.003318981,0.001740334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003440001,"about_ca_system_score_gemma":0.0008825833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003665042,"about_ca_topic_score_gemma":0.002881096,"domain_scores_codex":[0.9983485,0.0004209907,0.00005892957,0.0004615268,0.0003234858,0.0003866646],"domain_scores_gemma":[0.9899949,0.006306078,0.001558323,0.0006843046,0.0005277588,0.0009286243],"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.0004842874,0.000155479,0.002645839,0.0004947385,0.00008435483,0.0009926655,0.0008555553,0.1355719,0.005801235,0.8188735,0.01029418,0.0237462],"study_design_scores_gemma":[0.000091588,0.00009643271,0.001140698,0.0001132536,0.00005355681,0.0006084616,0.0002595685,0.1564032,0.001775469,0.8298399,0.009552745,0.00006512294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5566273,0.003492934,0.3442279,0.005280046,0.0002329321,0.0002605373,0.002493309,0.0008882361,0.08649683],"genre_scores_gemma":[0.9003902,0.004452162,0.06931291,0.0009849217,0.0005261421,0.0004138639,0.002881354,0.0005549552,0.02048349],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008253999,"threshold_uncertainty_score":0.02761233,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008572124148925313,"score_gpt":0.2884291926058699,"score_spread":0.2798570684569445,"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."}}