{"id":"W1966697435","doi":"10.1016/j.jda.2006.12.008","title":"Fixed parameter algorithms for one-sided crossing minimization revisited","year":2007,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Minification; Vertex (graph theory); Algorithm; Graph; Computer science; Crossing number (knot theory); Combinatorics; Mathematics; 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.001452451,0.0001907318,0.0003882739,0.000355305,0.000248208,0.0008081526,0.0007673919,0.0001059001,0.0000189386],"category_scores_gemma":[0.0007648326,0.0001639324,0.0002497399,0.0006986681,0.00007920531,0.001299413,0.0001087663,0.0001790822,0.0000062175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007604769,"about_ca_system_score_gemma":0.0001392323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000382304,"about_ca_topic_score_gemma":0.000001677372,"domain_scores_codex":[0.997657,0.00006422887,0.001032157,0.0002709767,0.0005902509,0.0003854023],"domain_scores_gemma":[0.997394,0.0004274724,0.0008631355,0.0003696442,0.0007083327,0.0002374716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003429881,0.001003477,0.001610817,0.0002901565,0.0009408469,0.0002727714,0.004505172,0.001776038,0.006494496,0.02875016,0.0325927,0.9214204],"study_design_scores_gemma":[0.003488674,0.0007717778,0.002674206,0.0004684378,0.0001746381,0.0001844812,0.0002442941,0.9346052,0.01348537,0.005833684,0.03738211,0.0006871358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001249239,0.0002102615,0.9970137,0.000622087,0.000526368,0.000168802,0.00002749976,0.00004336652,0.0001386941],"genre_scores_gemma":[0.03149872,0.00008351472,0.9661757,0.0009785419,0.0007466533,0.000002077912,0.00006649065,0.00003187974,0.0004164028],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9328291,"threshold_uncertainty_score":0.7793034,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04929590758097308,"score_gpt":0.3497608363701669,"score_spread":0.3004649287891938,"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."}}