{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002606879,0.001057789,0.002158862,0.003682361,0.002707419,0.008707531,0.003383638,0.003583608,0.01651454],"category_scores_gemma":[0.02860622,0.001157731,0.001822493,0.005691131,0.005555164,0.02253429,0.004660024,0.006013441,0.001097522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003240581,"about_ca_system_score_gemma":0.001723289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002609795,"about_ca_topic_score_gemma":0.002314333,"domain_scores_codex":[0.9967455,0.0008460942,0.0001938459,0.0005323602,0.001142034,0.0005403161],"domain_scores_gemma":[0.9530837,0.03807781,0.002659718,0.003109942,0.001297535,0.001771288],"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.0003829484,0.0001404257,0.003705251,0.0002410773,0.00005775716,0.0002214871,0.000681816,0.03719268,0.001044301,0.9288466,0.005627185,0.02185855],"study_design_scores_gemma":[0.00003269109,0.00002487026,0.0006477356,0.00002318048,0.00002720622,0.000141748,0.0001420671,0.03452593,0.0002999418,0.9627196,0.00139305,0.00002193019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7675812,0.002455686,0.1279254,0.009480047,0.0003899892,0.0001571967,0.001812838,0.0004709283,0.08972682],"genre_scores_gemma":[0.9642897,0.001677196,0.01944,0.0004298725,0.0005592678,0.0001156769,0.001164685,0.000224637,0.01209891],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01651454,"threshold_uncertainty_score":0.05524665,"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."}}