{"id":"W2036529526","doi":"10.1007/s00454-008-9125-3","title":"A Polynomial Bound for Untangling Geometric Planar Graphs","year":2008,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; Carleton University","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Natural Sciences and Engineering Research Council of Canada; Universitat Politècnica de Catalunya; Ministerio de Economía y Competitividad","keywords":"Upper and lower bounds; Graph; Planar; Time complexity; Planar graph; Spanning tree","routes":{"ca_aff":true,"ca_fund":true,"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.001967074,0.002800927,0.002566605,0.001926874,0.002346697,0.00531019,0.007824521,0.003166008,0.02703508],"category_scores_gemma":[0.01713726,0.001588419,0.002899836,0.003894484,0.003576522,0.01588874,0.008443115,0.007559491,0.006862234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003132012,"about_ca_system_score_gemma":0.002384298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005362413,"about_ca_topic_score_gemma":0.009667308,"domain_scores_codex":[0.9964936,0.0005043493,0.000145972,0.0008117118,0.001182708,0.0008616574],"domain_scores_gemma":[0.9841211,0.01025138,0.0006518369,0.003535248,0.0007269845,0.0007133987],"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.001912633,0.0007599482,0.00222094,0.001395801,0.0001491725,0.0004008294,0.0008707035,0.2968305,0.01689849,0.3566056,0.04199685,0.2799584],"study_design_scores_gemma":[0.0001490049,0.0001947889,0.0004347404,0.0000798271,0.0001139325,0.0001954872,0.0001934902,0.4922501,0.006576438,0.4904893,0.009277537,0.00004540748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1084334,0.001872951,0.8159963,0.003613713,0.0005652842,0.0003458388,0.001918368,0.005064288,0.06218992],"genre_scores_gemma":[0.5475621,0.002123798,0.398189,0.00138713,0.0005921022,0.000464256,0.00463448,0.002933346,0.04211374],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02703508,"threshold_uncertainty_score":0.09044141,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02404007693228497,"score_gpt":0.2613747466200225,"score_spread":0.2373346696877375,"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."}}