{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001629191,0.0002068653,0.0002008695,0.0001950263,0.0005625551,0.001037015,0.002485157,0.00007775513,0.00009419202],"category_scores_gemma":[0.0001279788,0.0001776159,0.00005020297,0.001145706,0.001723052,0.002061237,0.0009078998,0.0004100047,0.0001499478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004716269,"about_ca_system_score_gemma":0.000177529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006123936,"about_ca_topic_score_gemma":0.000007748739,"domain_scores_codex":[0.9972062,0.0001028881,0.0002979301,0.0008183122,0.000901968,0.0006727635],"domain_scores_gemma":[0.9981036,0.0001146892,0.00008154605,0.0009957108,0.0002724638,0.0004320079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004165557,0.00008164173,0.00004554117,0.00000518556,0.000002775319,0.000005234009,0.0006910068,0.00269417,0.01375427,0.8957092,0.0002973796,0.08670943],"study_design_scores_gemma":[0.0002842344,0.000160112,0.0000995937,0.00001297267,0.000002184715,0.00003145602,0.000005899404,0.9532411,0.01162307,0.03405494,0.0002142486,0.0002701602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01161023,0.000009330842,0.9751519,0.002097497,0.0009580393,0.0002544071,7.551283e-7,0.0004193301,0.009498495],"genre_scores_gemma":[0.7042872,0.000004915119,0.2951487,0.0003974149,0.0000992218,0.00001246865,0.000001636391,0.000009929271,0.0000385415],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.950547,"threshold_uncertainty_score":0.9999959,"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."}}