{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001251451,0.000091095,0.0001883042,0.0001435547,0.0000665702,0.00005562294,0.0004579721,0.00004368752,0.00003251622],"category_scores_gemma":[0.0001467781,0.00006201771,0.00009775014,0.0004797738,0.0000608427,0.0003605999,0.00003338783,0.0001651396,0.000004235519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002591724,"about_ca_system_score_gemma":0.00008702296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000761163,"about_ca_topic_score_gemma":0.000002376321,"domain_scores_codex":[0.99874,0.0002802979,0.0004224417,0.00008781514,0.0003547025,0.000114699],"domain_scores_gemma":[0.9986471,0.0006197542,0.0003381178,0.0001706107,0.0001966214,0.00002779768],"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.0001956679,0.000186172,0.00020529,0.000004432591,0.00001284082,0.00001148691,0.0001473028,0.0004427074,0.0003453191,0.9958749,0.001066701,0.001507162],"study_design_scores_gemma":[0.0005207344,0.0003256677,0.0011655,0.00003022548,0.000004434642,0.00005706823,0.00005766544,0.00007645039,0.004515385,0.9910859,0.002094828,0.00006614425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9473681,0.0001915346,0.03794742,0.002069772,0.005914647,0.0001340462,0.000002383251,0.00001515934,0.006356908],"genre_scores_gemma":[0.9985843,0.00001274762,0.0009724721,0.00008179379,0.0002422905,0.000001563672,6.92696e-7,0.000004174241,0.00009995959],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05121618,"threshold_uncertainty_score":0.2529009,"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."}}