{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002124079,0.00007797143,0.0001229229,0.0004060239,0.0001873909,0.00009310677,0.0002533344,0.00003264262,0.000001707384],"category_scores_gemma":[0.000009526062,0.00006483437,0.00006987958,0.000682842,0.00003487911,0.0001751984,0.0000234117,0.0001159312,0.000001593851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001008981,"about_ca_system_score_gemma":0.0000539993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001878851,"about_ca_topic_score_gemma":0.000001333588,"domain_scores_codex":[0.9993216,0.00002048297,0.0002546829,0.000141602,0.000174075,0.00008754371],"domain_scores_gemma":[0.9994239,0.00009492293,0.00009286715,0.0001526934,0.00016623,0.00006937261],"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.000005419622,0.0001010594,0.0005523398,0.000006660233,0.00004367121,0.000001787666,0.00003155973,0.000616975,0.0004278,0.699899,0.001570291,0.2967435],"study_design_scores_gemma":[0.000604118,0.0002447029,0.03108805,0.00007075087,0.0000527985,0.0001159632,0.0000493383,0.01792371,0.001694693,0.9061792,0.04174485,0.0002317638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01328573,0.0005682578,0.9836309,0.00114776,0.0001375606,0.0001159239,0.000003059832,0.00001842028,0.001092368],"genre_scores_gemma":[0.8732596,0.0004894397,0.1249354,0.0008777279,0.0001639036,0.00003742961,0.000005395507,0.00000549671,0.0002255645],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8599739,"threshold_uncertainty_score":0.2643869,"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."}}