{"id":"W1967421215","doi":"10.1016/j.jcta.2006.08.002","title":"On the maximum number of edges in quasi-planar graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Planar; Simple (philosophy); Upper and lower bounds; Pairwise comparison; Book embedding; Multiple edges; Matching (statistics); Graph; Discrete mathematics; 1-planar graph; Line graph; Computer science","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.002961802,0.001196728,0.001712221,0.002649663,0.001768817,0.003497493,0.003604519,0.002767288,0.009374524],"category_scores_gemma":[0.02458485,0.00165148,0.001055755,0.00231667,0.003487666,0.01024763,0.002878957,0.002774013,0.0006754501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001596889,"about_ca_system_score_gemma":0.0006127715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008997297,"about_ca_topic_score_gemma":0.001759095,"domain_scores_codex":[0.9985878,0.0005880651,0.00008624289,0.0002794554,0.0002400438,0.0002184309],"domain_scores_gemma":[0.9625803,0.03137622,0.001949672,0.00156144,0.001025089,0.00150731],"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.001431124,0.0002556778,0.005881459,0.001206149,0.000155267,0.0003659037,0.0008183516,0.1941504,0.01480193,0.6875861,0.01256378,0.08078387],"study_design_scores_gemma":[0.0001122187,0.0001381743,0.001893171,0.0001512961,0.00007805262,0.0002729069,0.0003678942,0.2249952,0.003044816,0.7656209,0.003280341,0.00004494778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5614416,0.003814077,0.3874651,0.006788676,0.0004289515,0.0001815442,0.001369424,0.0005881273,0.0379224],"genre_scores_gemma":[0.8480338,0.002912715,0.1361016,0.0007879668,0.000460127,0.0002210634,0.001020943,0.0005274127,0.009934493],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009374524,"threshold_uncertainty_score":0.03136092,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007860445494885649,"score_gpt":0.2300400927524089,"score_spread":0.2221796472575232,"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."}}