{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001062646,0.0003089783,0.0005116761,0.0003535344,0.0006174159,0.0005594438,0.00134166,0.0001058987,0.00001175765],"category_scores_gemma":[0.0001635206,0.0003145717,0.0001585379,0.001385164,0.001244735,0.0009507664,0.0006035081,0.0003845058,0.00004031736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002959736,"about_ca_system_score_gemma":0.00006764793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001680617,"about_ca_topic_score_gemma":0.00001624708,"domain_scores_codex":[0.9969503,0.0003875816,0.0005048618,0.0007262325,0.0006789888,0.0007519866],"domain_scores_gemma":[0.997339,0.0005924088,0.0002549251,0.001193874,0.0002886847,0.0003311114],"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.0000279755,0.0000647229,0.01428867,0.00003997471,0.0000374549,0.000007428985,0.0007439976,0.00001921581,0.007326995,0.9732415,0.0001854498,0.004016606],"study_design_scores_gemma":[0.001353302,0.0003436454,0.02419281,0.00005997098,0.00001029082,0.0000189652,0.00002841258,0.007871139,0.001123703,0.9615952,0.003044622,0.0003579543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9855372,0.0002809815,0.01085643,0.0002927794,0.0009039211,0.0003170778,0.0000140783,0.0002380652,0.00155948],"genre_scores_gemma":[0.990736,0.00001892097,0.008957195,0.0001628202,0.000005031679,0.00001575696,0.000004816876,0.00003334757,0.00006611583],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01164632,"threshold_uncertainty_score":0.9999306,"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."}}