{"id":"W2262149688","doi":"","title":"Crossing numbers of nearly complete graphs and nearly complete bipartite graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Robertson–Seymour theorem; Cograph; Indifference graph; Complete bipartite graph; 1-planar graph; Chordal graph; Discrete mathematics; Graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009019816,0.000467114,0.000470249,0.003484664,0.0008709785,0.002325868,0.0009184578,0.0009281368,0.009597542],"category_scores_gemma":[0.007917166,0.0004432753,0.0003264096,0.002427446,0.001289404,0.003550332,0.00120066,0.001382981,0.0008826416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008604791,"about_ca_system_score_gemma":0.0003064373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005794479,"about_ca_topic_score_gemma":0.0006751473,"domain_scores_codex":[0.9992236,0.0001991678,0.00003385696,0.0001851153,0.0002288393,0.0001294934],"domain_scores_gemma":[0.9948819,0.002644554,0.0009856869,0.0005016709,0.0003551434,0.000631214],"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.0001202162,0.00003067675,0.001627255,0.00008912195,0.00001998532,0.0001010756,0.0001858957,0.009389861,0.002825137,0.9603777,0.004679011,0.02055416],"study_design_scores_gemma":[0.00001501143,0.00002192122,0.002163921,0.00003849989,0.00001551349,0.0003505411,0.0001618851,0.02689989,0.00143789,0.9632187,0.005657196,0.0000190068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7075691,0.002345989,0.1449019,0.001505555,0.0003590913,0.00006775581,0.00220372,0.0005359882,0.1405108],"genre_scores_gemma":[0.9738444,0.0008200516,0.01592262,0.0002033564,0.0001331872,0.00006745982,0.0007843928,0.0001160023,0.008108479],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009597542,"threshold_uncertainty_score":0.032107,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02343992221715158,"score_gpt":0.2743095829051087,"score_spread":0.2508696606879571,"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."}}