{"id":"W2951207568","doi":"10.48550/arxiv.1306.1956","title":"Rendezvous of Two Robots with Constant Memory","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Rendezvous; Robot; Asynchronous communication; Computer science; Constant (computer programming); Transmission (telecommunications); State (computer science); Mobile robot; Class (philosophy); Finite-state machine; Distributed computing; Artificial intelligence; Computer network; Algorithm; Telecommunications; Engineering; Programming language","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":[],"consensus_categories":[],"category_scores_codex":[0.0001884053,0.0002264223,0.0003206799,0.0002488298,0.00007840537,0.00008670762,0.001428928,0.0001321065,0.0001081387],"category_scores_gemma":[0.00001332004,0.0002165322,0.00009665386,0.000504163,0.000220127,0.0003384674,0.001303135,0.000396103,0.00005895758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009104511,"about_ca_system_score_gemma":0.0003738781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002897424,"about_ca_topic_score_gemma":0.00004535073,"domain_scores_codex":[0.9984993,0.0001412162,0.0001930858,0.0007356458,0.00014043,0.0002903146],"domain_scores_gemma":[0.9979784,0.00006841071,0.0002838468,0.001122374,0.000368104,0.0001788733],"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.00001166468,0.00006533547,0.0004513322,0.0000596824,0.00006191765,0.000105055,0.0001974053,0.7453993,0.00002786749,0.2529017,0.0002538805,0.0004648621],"study_design_scores_gemma":[0.001079261,0.0001261143,0.0001511698,0.0001742751,0.00003542485,0.00001005101,0.0000743218,0.9677054,0.0003020255,0.02981371,0.0001023033,0.0004259127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03255793,0.00004590307,0.9419708,0.0001167547,0.000200861,0.0004327482,0.000008205464,0.0001830267,0.02448373],"genre_scores_gemma":[0.9734267,0.0001265516,0.02300107,0.00006719496,0.00001646146,0.000001169108,0.000007974238,0.00001359618,0.00333927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9408688,"threshold_uncertainty_score":0.8829926,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07363641634376226,"score_gpt":0.1939373296738441,"score_spread":0.1203009133300819,"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."}}