{"id":"W2050063944","doi":"10.1016/j.tcs.2005.12.016","title":"Asynchronous deterministic rendezvous in graphs","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":162,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Rendezvous; Asynchronous communication; Computer science; Graph; Upper and lower bounds; Mathematics; Node (physics); Topology (electrical circuits); Combinatorics; Algorithm; Discrete mathematics","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.001033327,0.0006181714,0.001219893,0.001182729,0.001680353,0.001909195,0.001926925,0.001288489,0.006782087],"category_scores_gemma":[0.008050895,0.0007115147,0.0005908607,0.001291523,0.00207829,0.003512762,0.002347523,0.001592332,0.0007692908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001362539,"about_ca_system_score_gemma":0.0008635049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003849365,"about_ca_topic_score_gemma":0.004861058,"domain_scores_codex":[0.9990409,0.0003107656,0.00004222905,0.0002446468,0.000167003,0.0001943717],"domain_scores_gemma":[0.9920123,0.005486273,0.0006036684,0.0008919088,0.0004222637,0.0005835127],"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.000657915,0.00009299114,0.0008483667,0.000211513,0.0000518865,0.0002638728,0.0005464999,0.251047,0.005551977,0.7132396,0.00408684,0.02340152],"study_design_scores_gemma":[0.0001010907,0.00004347918,0.0002234965,0.00001887601,0.00003017799,0.00007955058,0.000168951,0.4525864,0.002192582,0.5420845,0.002447014,0.00002384506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4130693,0.0009755725,0.5517805,0.001639573,0.0002017426,0.0001376992,0.000417665,0.001238476,0.03053942],"genre_scores_gemma":[0.9591584,0.0003283233,0.02908006,0.0001216957,0.00005603696,0.00009243631,0.0001587544,0.0001966129,0.01080767],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006782087,"threshold_uncertainty_score":0.02268833,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007596805078787223,"score_gpt":0.243354161246824,"score_spread":0.2357573561680368,"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."}}