{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004966902,0.0001552496,0.0002080974,0.0001275866,0.0001057009,0.0002786388,0.0007937956,0.00007556279,0.0000192352],"category_scores_gemma":[0.00006125588,0.0001632884,0.0000495456,0.001013511,0.00001724878,0.0002707512,0.0003070484,0.0002447106,0.000108352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009846246,"about_ca_system_score_gemma":0.00006138105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001005705,"about_ca_topic_score_gemma":0.000006950284,"domain_scores_codex":[0.9982145,0.000130037,0.0003443249,0.0004658205,0.0002945799,0.0005507292],"domain_scores_gemma":[0.9991368,0.0001429549,0.000117892,0.0004108617,0.00008154465,0.0001099249],"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.00001461349,0.0005852318,0.08085507,0.00009335115,0.00003833356,0.0000692965,0.002009627,0.8318006,0.008956331,0.01720859,0.006801183,0.0515678],"study_design_scores_gemma":[0.0006140643,0.00005164107,0.002030039,0.00007674687,9.894251e-7,0.000008741275,0.0000524199,0.9952909,0.0007421232,0.0001806904,0.0007276998,0.0002239005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1310743,0.000176808,0.8647512,0.0005814832,0.0002431365,0.0002960516,0.00001294433,0.0003353891,0.002528679],"genre_scores_gemma":[0.9863724,0.000005837594,0.0131752,0.0002571586,0.00002044762,0.000003011142,0.00008404232,0.00001135317,0.00007052696],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8552982,"threshold_uncertainty_score":0.6658705,"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."}}