{"id":"W2053535344","doi":"10.1016/j.dam.2007.05.009","title":"Approximating the fixed linear crossing number","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"ASTER","funders":"","keywords":"Mathematics; Combinatorics; Randomized algorithm; Approximation algorithm; Time complexity; Crossing number (knot theory); Discrete mathematics; Conjecture; Random graph; Graph","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.001071465,0.0001344156,0.0001342099,0.00004021009,0.0005078102,0.000344554,0.0004926581,0.00004882044,0.00001671756],"category_scores_gemma":[0.00006388787,0.00009425583,0.00005600128,0.000461371,0.00006827365,0.0001576164,0.0001856401,0.0001374422,0.0001330246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002346327,"about_ca_system_score_gemma":0.00004188553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001476395,"about_ca_topic_score_gemma":0.000001706113,"domain_scores_codex":[0.9987631,0.0000100825,0.0003853376,0.000218797,0.0003546745,0.0002680457],"domain_scores_gemma":[0.9989322,0.0003532722,0.0001757869,0.0004202022,0.00005984878,0.00005866634],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003354913,0.00005366156,0.00001884453,0.00005538676,0.00001865919,0.000002839879,0.005120988,0.001836309,0.005246101,0.9605258,0.0002553695,0.02686274],"study_design_scores_gemma":[0.000508765,0.00001880459,0.0003626235,0.00004526198,0.00002417976,0.00006467655,0.0009896732,0.7885723,0.03329437,0.1680072,0.007621425,0.0004908158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03054211,0.00001404023,0.9423847,0.0001681663,0.0001209483,0.0002146204,8.587682e-7,0.0001341977,0.02642039],"genre_scores_gemma":[0.4075953,4.728745e-7,0.5917949,0.0003044355,0.0001426987,0.00001167369,0.000005135019,0.000009700831,0.000135647],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7925186,"threshold_uncertainty_score":0.3905717,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01936747724230048,"score_gpt":0.2851586931871241,"score_spread":0.2657912159448236,"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."}}