{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001133959,0.0001500226,0.0001696005,0.0003748334,0.0002416832,0.0004947863,0.002040313,0.0000455588,0.00003805926],"category_scores_gemma":[0.00004959411,0.0001301577,0.00004395574,0.001828148,0.001754959,0.0005600508,0.0006528549,0.0001847006,0.00008401408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007546295,"about_ca_system_score_gemma":0.000161991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000165873,"about_ca_topic_score_gemma":0.00000648387,"domain_scores_codex":[0.9976315,0.0001113556,0.000317791,0.0006534706,0.0006242603,0.0006616486],"domain_scores_gemma":[0.9988447,0.0001644948,0.0000478801,0.0006517049,0.0001152394,0.000175962],"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.000001964471,0.00007270684,0.0001978814,0.000003431782,4.559499e-7,0.00003771688,0.00009668663,0.003201286,0.0001118696,0.9788424,0.00003051453,0.01740302],"study_design_scores_gemma":[0.0001881492,0.0001033195,0.002479148,0.00001226256,5.966909e-7,0.00003050145,0.000001054393,0.6450401,0.0003122867,0.3516462,0.00004529295,0.000141168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01234221,0.00001857522,0.9737111,0.0006469216,0.0002974503,0.0001575459,5.630621e-7,0.0001908603,0.01263479],"genre_scores_gemma":[0.8057923,0.000002584961,0.1938819,0.0002613782,0.00003720339,0.000007209351,6.301177e-7,0.000005131199,0.00001161829],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7934501,"threshold_uncertainty_score":0.6466218,"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."}}