{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001055243,0.0006987845,0.0009447424,0.0006235276,0.001016351,0.001523416,0.001721052,0.00151678,0.003852683],"category_scores_gemma":[0.007366984,0.0004288455,0.000761389,0.000498234,0.00322794,0.003110107,0.003442246,0.001069899,0.000292032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001083013,"about_ca_system_score_gemma":0.0004970476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003208994,"about_ca_topic_score_gemma":0.001288606,"domain_scores_codex":[0.9991664,0.000206503,0.00003530283,0.0001910864,0.0001524813,0.0002483595],"domain_scores_gemma":[0.995802,0.002525389,0.0007474795,0.0004305285,0.0001665319,0.0003280896],"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.0008519556,0.0001304113,0.002262847,0.0001944425,0.00009274179,0.0007382018,0.0005950826,0.7194663,0.01079902,0.2535988,0.0006205076,0.01064971],"study_design_scores_gemma":[0.0001233309,0.0001979283,0.0004850379,0.00001978237,0.00003520818,0.00009658001,0.000223972,0.9226961,0.004532221,0.07057688,0.000979939,0.00003302289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8271089,0.0005645773,0.1593385,0.0004903984,0.00005049085,0.00004077305,0.00007642403,0.0002330785,0.01209693],"genre_scores_gemma":[0.9870051,0.0001440988,0.009709654,0.00003488984,0.00001590375,0.00003908394,0.00004588476,0.00002530505,0.002980105],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003852683,"threshold_uncertainty_score":0.01288855,"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."}}