{"id":"W3023452807","doi":"10.1016/j.tcs.2010.01.007","title":"Remembering without memory: Tree exploration by asynchronous oblivious robots","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Robot; Computer science; Asynchronous communication; Task (project management); Theoretical computer science; Node (physics); Tree (set theory); Swarm robotics; Graph; Mobile robot; Constructive; Self-reconfiguring modular robot; Computation; Distributed computing; Algorithm; Artificial intelligence; Mathematics; Robot control; Combinatorics","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.0007614241,0.0003984455,0.0009033448,0.0003727421,0.0008351277,0.00115267,0.001678587,0.001027085,0.003298846],"category_scores_gemma":[0.006282762,0.0003720511,0.0004161393,0.0005574174,0.001087422,0.003714463,0.001671467,0.001115975,0.0003135689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003891838,"about_ca_system_score_gemma":0.0006465344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00122306,"about_ca_topic_score_gemma":0.001262686,"domain_scores_codex":[0.999639,0.0001291295,0.00001948239,0.00007169514,0.00005866987,0.00008208584],"domain_scores_gemma":[0.996659,0.002129143,0.0002089576,0.0005956344,0.0001757923,0.0002314128],"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.002461391,0.000266484,0.00243703,0.0004196312,0.0001466016,0.0004795704,0.0013101,0.6440491,0.01243633,0.1859475,0.005636599,0.1444097],"study_design_scores_gemma":[0.00007943734,0.0000994724,0.0001693896,0.00001239911,0.00003068075,0.00006259315,0.00009088526,0.8395044,0.001774822,0.1572162,0.0009449671,0.00001477726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4469258,0.001074341,0.537434,0.0009363476,0.0001223026,0.00007304041,0.0001185051,0.001055202,0.01226048],"genre_scores_gemma":[0.9624926,0.0001972493,0.03421751,0.00006570617,0.00002532066,0.00004585792,0.00005099036,0.00008103383,0.002823761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003298846,"threshold_uncertainty_score":0.01103574,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01301042963313472,"score_gpt":0.2584973290919054,"score_spread":0.2454868994587706,"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."}}