{"id":"W2029352747","doi":"10.1016/j.disc.2007.12.088","title":"On the complexity of crossings in permutations","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Permutation (music); Minification; Discrete mathematics; Rank (graph theory); Complete bipartite graph; Monochromatic color; Graph; Mathematical optimization","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.000319311,0.00007438873,0.0001272839,0.00008344052,0.0001676295,0.00003024429,0.0006806053,0.00001966466,0.00002036883],"category_scores_gemma":[0.0002865638,0.00004797485,0.00004878836,0.0004555186,0.0007692856,0.0001315533,0.0001348714,0.0001320765,0.0000255492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001783749,"about_ca_system_score_gemma":0.00003514434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005848116,"about_ca_topic_score_gemma":0.000005168924,"domain_scores_codex":[0.9991344,0.00006082117,0.0002146114,0.000128042,0.000295005,0.0001670923],"domain_scores_gemma":[0.9987938,0.000512401,0.00008104212,0.000530473,0.0000529946,0.00002927008],"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.000001881815,0.00005546371,0.00008163843,0.00001489587,0.00000282223,0.00000503129,0.006388285,0.0001211352,0.000243547,0.9929596,0.00005766497,0.00006806747],"study_design_scores_gemma":[0.0001147341,0.0000316988,0.001551589,0.0000343179,7.188421e-7,0.00001209569,0.0002317966,0.04955734,0.001536558,0.9468462,0.00002057222,0.00006237414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5316306,0.00001448527,0.4576277,0.001109874,0.00002173916,0.0002040208,0.000005938854,0.00003508073,0.009350573],"genre_scores_gemma":[0.9590539,0.000002871229,0.04067283,0.00006200902,0.000003434148,0.00001229515,7.544264e-7,0.000005913119,0.0001859529],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4274233,"threshold_uncertainty_score":0.2834465,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1062001899944669,"score_gpt":0.3393784880129924,"score_spread":0.2331782980185255,"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."}}