{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001460445,0.0002614143,0.0002612191,0.0004573898,0.0007582007,0.0006232053,0.004056599,0.0000584746,0.00006252657],"category_scores_gemma":[0.0001119573,0.0001882706,0.00006726351,0.004091024,0.005908988,0.0006589043,0.0007522898,0.0004154431,0.0002274045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009523399,"about_ca_system_score_gemma":0.0002970441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002479397,"about_ca_topic_score_gemma":0.00000115545,"domain_scores_codex":[0.9964001,0.0001846571,0.0002404031,0.001110937,0.001138248,0.0009256426],"domain_scores_gemma":[0.9970155,0.0007681712,0.00005041402,0.001566906,0.000287428,0.0003115343],"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.00006726441,0.00008263303,0.0001522897,0.000007345862,0.000009420995,0.00003682154,0.00008674955,0.00008678353,0.0001524743,0.9871163,0.0001847524,0.01201719],"study_design_scores_gemma":[0.0004344877,0.000329569,0.0006328586,0.00007093325,0.00000345253,0.00003432888,0.00000396873,0.04849423,0.003360607,0.9461269,0.0002678592,0.0002408123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03225214,0.00001070332,0.9218639,0.001595314,0.0003645383,0.0002505953,0.000001355183,0.0003070021,0.04335443],"genre_scores_gemma":[0.8613455,0.000002821683,0.1367131,0.001790438,0.00001949894,0.00001621533,5.237159e-7,0.000008475934,0.0001034348],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8290933,"threshold_uncertainty_score":0.9967964,"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."}}