{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008297534,0.0002241323,0.0002622234,0.00172661,0.0001491701,0.0003173641,0.001547351,0.0001318213,0.0001172242],"category_scores_gemma":[0.0001334383,0.0002367625,0.0002057374,0.001432462,0.00009361251,0.001297585,0.0001868258,0.0005927004,0.00008214013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001377592,"about_ca_system_score_gemma":0.0004788647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008743258,"about_ca_topic_score_gemma":0.00001347907,"domain_scores_codex":[0.9968903,0.00007521605,0.001104125,0.0003773232,0.001297545,0.0002554841],"domain_scores_gemma":[0.99639,0.000591423,0.0006986378,0.0002566456,0.001879364,0.000183951],"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.00006818935,0.0008057976,0.005389021,0.00001268094,0.0001535938,0.00003332468,0.0002270812,0.4225994,0.003965538,0.3184222,0.0007282566,0.2475948],"study_design_scores_gemma":[0.004252654,0.0002751608,0.2470865,0.00008753846,0.00005246015,0.002055384,0.0001123103,0.2686344,0.00341268,0.2941007,0.1787874,0.001142834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1168271,0.0001767469,0.8783894,0.002465046,0.001168702,0.0002749076,0.00002260065,0.00005058054,0.0006249142],"genre_scores_gemma":[0.7936634,0.00002454204,0.2045261,0.0003757083,0.001168879,0.00006185992,0.0001007836,0.00001386555,0.00006487477],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6768363,"threshold_uncertainty_score":0.9654896,"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."}}