{"id":"W2129252388","doi":"10.1007/978-3-642-00219-9_5","title":"Crossing and Weighted Crossing Number of Near-Planar Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Crossing number (knot theory); Planar graph; Planar; Combinatorics; Book embedding; Graph; Computer science; Mathematics; Discrete mathematics; 1-planar graph; Line graph","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.0007454657,0.0005877315,0.0005832434,0.003871711,0.0008999955,0.001873193,0.00137248,0.0007791615,0.005199177],"category_scores_gemma":[0.005184905,0.0005185471,0.0004267431,0.003249756,0.001194882,0.002968011,0.0009758933,0.00121653,0.0004368197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009333969,"about_ca_system_score_gemma":0.0002967081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006958828,"about_ca_topic_score_gemma":0.0007702571,"domain_scores_codex":[0.9994547,0.00009767817,0.00002776952,0.0001576859,0.0001914464,0.00007071928],"domain_scores_gemma":[0.9972475,0.001347747,0.0004788401,0.00023935,0.0002817665,0.0004047991],"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.0003959103,0.0001292849,0.004798423,0.0002838635,0.00007989051,0.0002947781,0.0005041157,0.07574601,0.01257323,0.8175068,0.006666002,0.08102155],"study_design_scores_gemma":[0.00002385038,0.00008367591,0.005452734,0.00006270635,0.00007432444,0.0006652147,0.0002393568,0.1543603,0.004366972,0.8270422,0.007579173,0.00004944837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8000022,0.002051153,0.1327729,0.0004054816,0.0002673413,0.00005699826,0.0007040827,0.0003716993,0.06336823],"genre_scores_gemma":[0.9486744,0.001294188,0.03629866,0.00007932074,0.0001718383,0.00006897554,0.0006564857,0.0001999411,0.0125563],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005199177,"threshold_uncertainty_score":0.01739293,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01366128768024416,"score_gpt":0.2622508273205566,"score_spread":0.2485895396403124,"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."}}