{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004337041,0.000320198,0.0003401517,0.001621188,0.0008806848,0.0002269131,0.0007710453,0.0001222009,0.0000306767],"category_scores_gemma":[0.0002162009,0.0003376211,0.0002906327,0.003588248,0.0001116393,0.0008149642,0.0001379263,0.0001917492,0.00007271534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001140087,"about_ca_system_score_gemma":0.0003398923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002158011,"about_ca_topic_score_gemma":0.000002780777,"domain_scores_codex":[0.9972124,0.00006921146,0.0005777957,0.0007733894,0.0008260736,0.0005411157],"domain_scores_gemma":[0.9978572,0.0008794678,0.0002347771,0.0003542606,0.0004360823,0.0002382771],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000307391,0.0006729019,0.01132489,0.000166166,0.0005517838,0.0001544207,0.001458514,0.6690297,0.0008403097,0.179883,0.08249956,0.05311139],"study_design_scores_gemma":[0.005264768,0.0008970172,0.1198967,0.00005854678,0.00007108236,0.0007935764,0.000102646,0.7667894,0.001348871,0.05885068,0.04395644,0.001970269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2120247,0.0005547039,0.7848904,0.0004979061,0.0008114837,0.0003844991,0.00007129483,0.0002150231,0.0005500672],"genre_scores_gemma":[0.8491223,0.00002051094,0.1487828,0.0007418187,0.0003875682,0.00006714289,0.0004746723,0.00002547435,0.0003776643],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6370977,"threshold_uncertainty_score":0.9999076,"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."}}