{"id":"W2794864174","doi":"","title":"Dilation-optimal edge deletion in polygonal cycles","year":2007,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Dilation (metric space); Combinatorics; Convex polygon; Mathematics; Shortest path problem; Regular polygon; Time dilation; Euclidean geometry; Time complexity; Polygon (computer graphics); Path (computing); Computer science; Geometry; Physics; Graph","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.0005004062,0.0006125742,0.00116338,0.0006886074,0.0009055807,0.0008650512,0.001429794,0.0008727392,0.003309367],"category_scores_gemma":[0.004184039,0.0004973054,0.0004709308,0.001318477,0.0007891273,0.001756547,0.001699884,0.0006270022,0.00072271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007596966,"about_ca_system_score_gemma":0.0007242544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00176918,"about_ca_topic_score_gemma":0.002065864,"domain_scores_codex":[0.9993706,0.0001321609,0.00004495194,0.0001792794,0.0001267161,0.0001463024],"domain_scores_gemma":[0.9983442,0.0008516553,0.0002611353,0.000337391,0.0001089998,0.00009667749],"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.001238364,0.0001868935,0.002636017,0.000542243,0.00006326873,0.0007710223,0.0004193847,0.5925596,0.02915401,0.05232338,0.009653647,0.3104522],"study_design_scores_gemma":[0.0002251545,0.0003180222,0.0007508165,0.00005341329,0.00004488316,0.0005389763,0.0002459027,0.9040686,0.01935318,0.05607568,0.01829268,0.00003258093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2723093,0.001200026,0.7111302,0.0008388655,0.0001677208,0.0002964893,0.0005033834,0.001626904,0.01192704],"genre_scores_gemma":[0.5452566,0.0007338967,0.4464179,0.0001703453,0.00007027535,0.0002377176,0.0009686772,0.0002991772,0.005845432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003309367,"threshold_uncertainty_score":0.01107097,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0125780625658691,"score_gpt":0.2616103831802776,"score_spread":0.2490323206144085,"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."}}