{"id":"W1972775782","doi":"10.1007/s00446-011-0141-9","title":"How to meet when you forget: log-space rendezvous in arbitrary graphs","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Binary logarithm; Computer science; Upper and lower bounds; Graph; Combinatorics; Matching (statistics); Discrete mathematics; Node (physics); Mathematics; Theoretical computer science","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.0004617027,0.0002004084,0.00023238,0.0002593795,0.0001532676,0.0002850758,0.001143708,0.00008891807,0.000006806449],"category_scores_gemma":[0.0001094033,0.0002034379,0.00007512331,0.001137607,0.0000352286,0.0004051659,0.0004226143,0.0002003515,0.00001087049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006439949,"about_ca_system_score_gemma":0.00006771616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007866191,"about_ca_topic_score_gemma":0.00003955699,"domain_scores_codex":[0.9980858,0.0001304448,0.0002898492,0.000556711,0.0003027103,0.000634497],"domain_scores_gemma":[0.9988629,0.00006762162,0.0001060209,0.0005855592,0.0001297746,0.0002481019],"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.00005789202,0.0007456832,0.03668425,0.00009790109,0.0001039995,0.0003819234,0.02267364,0.0202812,0.0008151094,0.8465513,0.02365459,0.04795251],"study_design_scores_gemma":[0.001467893,0.0003615454,0.0140496,0.0001846331,0.000008803246,0.00004071819,0.0006371241,0.908446,0.003331227,0.06328729,0.007129476,0.001055754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01046853,0.00006147606,0.9830145,0.002676431,0.0002296129,0.000307341,0.00002184628,0.000341751,0.002878531],"genre_scores_gemma":[0.8391864,0.000003364142,0.1602095,0.000448054,0.0000268747,0.000009272001,0.0000355004,0.0000139638,0.0000670857],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8881648,"threshold_uncertainty_score":0.8295956,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03537092847980609,"score_gpt":0.2406513227041873,"score_spread":0.2052803942243812,"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."}}