{"id":"W2120092636","doi":"10.1142/s0218195900000103","title":"An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT","year":2000,"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":"Combinatorics; Simple polygon; Mathematics; Link (geometry); Polygon (computer graphics); Vertex (graph theory); Upper and lower bounds; Algorithm; Geometry; Graph; Regular polygon; Computer science; Mathematical analysis","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.0006687572,0.0002782302,0.0003205596,0.0008510668,0.0003185275,0.0005152597,0.001815848,0.0001134677,0.0001967303],"category_scores_gemma":[0.0000322622,0.000291539,0.0003113176,0.0009230167,0.00006656872,0.001368108,0.00007947272,0.0002729353,0.00004775068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002932269,"about_ca_system_score_gemma":0.0004770221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006289907,"about_ca_topic_score_gemma":0.000002159069,"domain_scores_codex":[0.996622,0.00008543058,0.001106502,0.0004967264,0.001299436,0.0003899186],"domain_scores_gemma":[0.9966684,0.0005383056,0.0005585193,0.0003078409,0.001585856,0.0003410863],"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.00002748421,0.0003672187,0.0001470879,0.000004763164,0.000159204,0.000008219386,0.0001096876,0.2957522,0.0001299779,0.01553665,0.0004283725,0.6873292],"study_design_scores_gemma":[0.002066589,0.0004906415,0.007516161,0.00005166194,0.00006574066,0.0006076657,0.00006327273,0.7283055,0.0006213527,0.06931314,0.190344,0.0005542826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005697797,0.0003133386,0.9901156,0.001908957,0.0007352647,0.0006342932,0.0001391634,0.00008485458,0.0003707152],"genre_scores_gemma":[0.3816813,0.0000745657,0.6132333,0.0009641313,0.003075246,0.0002034154,0.0004598767,0.00002670694,0.0002814774],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6867748,"threshold_uncertainty_score":0.9999537,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01541237706406974,"score_gpt":0.3034792372735612,"score_spread":0.2880668602094915,"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."}}