{"id":"W2220384749","doi":"10.1007/978-3-540-77120-3_10","title":"Dilation-Optimal Edge Deletion in Polygonal Cycles","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Dilation (metric space); Convex polygon; Combinatorics; Regular polygon; Polygon (computer graphics); Path (computing); Time complexity; Running time; Enhanced Data Rates for GSM Evolution; Time dilation; Mathematics; Polygonal chain; Computer science; Algorithm; Geometry; Physics; Artificial intelligence","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.0005536785,0.0009078869,0.001697747,0.0009207666,0.0007820663,0.001121252,0.002065621,0.001038649,0.006226035],"category_scores_gemma":[0.00396811,0.0007690657,0.0006807058,0.001652752,0.0009864386,0.001863343,0.002389903,0.00137632,0.0009995846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006398524,"about_ca_system_score_gemma":0.0005962473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001295887,"about_ca_topic_score_gemma":0.001767173,"domain_scores_codex":[0.9994745,0.00009468122,0.00003576827,0.0001078601,0.0001811784,0.0001060076],"domain_scores_gemma":[0.9986494,0.0007032673,0.0001084373,0.0002860775,0.0001486139,0.0001041809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007652167,0.0002698384,0.001101236,0.0007335008,0.00005479965,0.0004960753,0.0004989796,0.2334442,0.02834289,0.1662403,0.01823357,0.5498194],"study_design_scores_gemma":[0.0001785035,0.0002411704,0.0007314777,0.0001258001,0.00007474318,0.0005822026,0.00032301,0.724143,0.01995772,0.2319495,0.02164684,0.00004605945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1635835,0.001321418,0.8029477,0.0005698944,0.0003964991,0.0002511202,0.0003580225,0.001259896,0.02931205],"genre_scores_gemma":[0.4455239,0.001291118,0.5302787,0.0002137004,0.0001330029,0.0001921919,0.0008095277,0.0008919152,0.02066612],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006226035,"threshold_uncertainty_score":0.02082813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02255068646276365,"score_gpt":0.2673628671819231,"score_spread":0.2448121807191594,"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."}}