{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00118339,0.0003966206,0.000346287,0.001842109,0.0001991932,0.000364197,0.001444511,0.0003036651,0.00002910929],"category_scores_gemma":[0.00007638502,0.0004089078,0.0001027507,0.001130139,0.0002787414,0.0007726856,0.0005714788,0.0006349469,0.00005375494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000381009,"about_ca_system_score_gemma":0.0005447504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002180361,"about_ca_topic_score_gemma":0.0001679166,"domain_scores_codex":[0.996571,0.00003417813,0.0006096947,0.001212187,0.001022835,0.0005501068],"domain_scores_gemma":[0.9983295,0.0004590143,0.0002298859,0.0006008872,0.0002421098,0.0001386704],"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.000007657592,0.00003115795,0.0001343579,0.00001190258,0.000003720483,0.0000439178,0.0002995361,0.3313107,0.0001307031,0.03519669,0.0000130788,0.6328165],"study_design_scores_gemma":[0.0003234399,0.00010959,0.004047566,0.00017795,0.000003632456,0.0000687502,1.366929e-7,0.9085075,0.001179509,0.08347128,0.001520345,0.0005902685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001406552,0.0004250898,0.9932818,0.0005219697,0.001492924,0.0002846847,0.000003541474,0.00009727602,0.002486153],"genre_scores_gemma":[0.3882084,0.00003630444,0.609087,0.001279542,0.0009810987,0.000008553989,0.00003887573,0.00002696631,0.0003332683],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6322262,"threshold_uncertainty_score":0.9998363,"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."}}