{"id":"W2972852770","doi":"10.1007/s00446-019-00362-2","title":"Meeting in a polygon by anonymous oblivious robots","year":2019,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Computer science; Combinatorics; Asynchronous communication; Algebraic number; Visibility polygon; Upper and lower bounds; Asymptotically optimal algorithm; Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Simple polygon; Regular polygon; Geometry","routes":{"ca_aff":true,"ca_fund":true,"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.0006730622,0.0005736439,0.0009931003,0.0005241455,0.002011148,0.001794776,0.001807304,0.00129693,0.005363863],"category_scores_gemma":[0.004242055,0.000605617,0.0008755787,0.001161052,0.001474604,0.002861156,0.004191341,0.0009518338,0.000987774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007061212,"about_ca_system_score_gemma":0.0006621573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002428043,"about_ca_topic_score_gemma":0.00202663,"domain_scores_codex":[0.9990288,0.0003222487,0.00004804293,0.0002008855,0.0001975347,0.0002024837],"domain_scores_gemma":[0.9980319,0.0008976214,0.0003961181,0.0003303988,0.00009190879,0.0002520157],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001823785,0.0002447345,0.002654642,0.0003237984,0.0001749342,0.001283204,0.001443882,0.7876036,0.0116923,0.1284803,0.004809448,0.05946534],"study_design_scores_gemma":[0.00009882959,0.0002304966,0.000411329,0.00001935123,0.00004278014,0.0001752449,0.0007637211,0.923247,0.003516286,0.06412762,0.007341059,0.00002633231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2782481,0.0002816735,0.6892009,0.001140047,0.0001554421,0.0002080093,0.0002363814,0.0006087186,0.02992074],"genre_scores_gemma":[0.8946161,0.000246864,0.09062397,0.00006717011,0.00005286405,0.0001812528,0.0001709585,0.0001067656,0.01393397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005363863,"threshold_uncertainty_score":0.01794386,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006297182411765845,"score_gpt":0.22727481758885,"score_spread":0.2209776351770841,"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."}}