{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001337631,0.0005717441,0.00131302,0.0005386437,0.00240847,0.002044891,0.001879113,0.001929084,0.006696729],"category_scores_gemma":[0.01254202,0.0004763996,0.0005480371,0.001144963,0.002904287,0.007260653,0.003557068,0.002526334,0.001283942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000809992,"about_ca_system_score_gemma":0.000961769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005029136,"about_ca_topic_score_gemma":0.005290134,"domain_scores_codex":[0.9991515,0.0003298116,0.0000280438,0.0001722639,0.0001471189,0.0001714186],"domain_scores_gemma":[0.9953087,0.002655376,0.0001920213,0.001111378,0.0002667903,0.0004656976],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001899159,0.0002342891,0.001879601,0.0002810437,0.00009777004,0.000578236,0.002069564,0.4001177,0.00633093,0.4220969,0.03509764,0.1293172],"study_design_scores_gemma":[0.00008884924,0.00005345644,0.0001864195,0.0000212484,0.00002385275,0.0001535723,0.0007218623,0.5786982,0.0024775,0.4119942,0.005550333,0.00003049559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2927701,0.001337389,0.6687254,0.008788339,0.0005333234,0.0001376068,0.0004042942,0.003363268,0.0239403],"genre_scores_gemma":[0.920525,0.000365096,0.06597112,0.0003279146,0.00008372366,0.00006762081,0.0002084418,0.0005681103,0.0118829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006696729,"threshold_uncertainty_score":0.02240282,"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."}}