{"id":"W2105729287","doi":"10.1142/s0218195910003207","title":"DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Dilation (metric space); Mathematics; Combinatorics; Convex polygon; Regular polygon; Shortest path problem; Euclidean geometry; Time complexity; Polygon (computer graphics); Path (computing); Binary logarithm; Geometry; Graph; Computer science","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.000506819,0.0006202984,0.001210067,0.0006774008,0.0009049411,0.000899539,0.001508761,0.0008787019,0.003145399],"category_scores_gemma":[0.004069975,0.0005233051,0.0004872441,0.001316559,0.0007859363,0.001762969,0.001720391,0.0006399644,0.0007146162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008001042,"about_ca_system_score_gemma":0.0007937578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001961005,"about_ca_topic_score_gemma":0.002292658,"domain_scores_codex":[0.9993477,0.0001315568,0.00004553738,0.0001921427,0.0001296606,0.0001534018],"domain_scores_gemma":[0.9982706,0.0008813383,0.0002703868,0.0003562464,0.0001141455,0.0001072112],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00125228,0.000188329,0.002564635,0.0005369748,0.00006461135,0.0007452671,0.0004077959,0.6105392,0.03045786,0.04457417,0.008672625,0.2999963],"study_design_scores_gemma":[0.0002149762,0.0003002658,0.000708864,0.0000469031,0.00004357896,0.0004957445,0.0002412584,0.9134287,0.01913218,0.04917007,0.016185,0.0000324059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3040891,0.001147396,0.6805301,0.0008545977,0.0001656557,0.0003003911,0.0005223961,0.001753724,0.01063677],"genre_scores_gemma":[0.5548683,0.0006919029,0.4370011,0.0001675634,0.00006451493,0.0002301447,0.001011938,0.000296444,0.005668042],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003145399,"threshold_uncertainty_score":0.01052243,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008597747177721698,"score_gpt":0.2828369084495894,"score_spread":0.2742391612718676,"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."}}