{"id":"W4415113082","doi":"10.7155/jgaa.v29i3.3003","title":"On k-planar Graphs without Short Cycles","year":2025,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa; Carleton University","funders":"Hellenic Foundation for Research and Innovation; Austrian Science Fund; Deutsche Forschungsgemeinschaft","keywords":"Upper and lower bounds; Constant (computer programming); Girth (graph theory); Graph; Crossing number (knot theory); Plane (geometry)","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.001371326,0.001392287,0.001101423,0.002132252,0.001116123,0.001417712,0.001924102,0.0008362776,0.00402863],"category_scores_gemma":[0.0199849,0.000656829,0.0006588811,0.002619986,0.002260599,0.004161031,0.002733838,0.001695504,0.000499264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001686352,"about_ca_system_score_gemma":0.0007661219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002245418,"about_ca_topic_score_gemma":0.002646416,"domain_scores_codex":[0.9986357,0.0004172405,0.00005783888,0.0002496652,0.0003545618,0.0002850197],"domain_scores_gemma":[0.9818611,0.01380352,0.001599226,0.001203531,0.0006520528,0.0008805534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006690925,0.0001812076,0.005650127,0.0006290397,0.00009763709,0.0005645059,0.0003843596,0.620621,0.01235227,0.2868965,0.004674336,0.06728002],"study_design_scores_gemma":[0.00004675801,0.0001924262,0.001720947,0.0001211756,0.00006393311,0.000588882,0.0002180071,0.7589828,0.00759062,0.226841,0.003582202,0.00005122395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5239336,0.003831875,0.4386109,0.001613082,0.0001248205,0.0001275376,0.0005197541,0.0009108898,0.03032763],"genre_scores_gemma":[0.9424508,0.002979274,0.050804,0.0003504081,0.00009608152,0.0001256401,0.0004077544,0.0002337578,0.002552211],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00402863,"threshold_uncertainty_score":0.01347709,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01072175382599901,"score_gpt":0.2764378427179681,"score_spread":0.2657160888919691,"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."}}