{"id":"W2884716215","doi":"10.1016/j.tcs.2018.06.045","title":"On asynchronous rendezvous in general graphs","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Rendezvous; Asynchronous communication; Traverse; Computer science; Adversary; Characterization (materials science); Time complexity; Theoretical computer science; Discrete mathematics; Mathematics; Combinatorics; Algorithm; Computer network; Computer security; Geography","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.001273217,0.001129842,0.001709804,0.001829861,0.002173749,0.002166328,0.002602034,0.001529003,0.01347731],"category_scores_gemma":[0.01233405,0.0006662199,0.0008270559,0.002076446,0.002775304,0.006079,0.003536733,0.002242631,0.001049094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00160624,"about_ca_system_score_gemma":0.001007407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004245272,"about_ca_topic_score_gemma":0.004533336,"domain_scores_codex":[0.9990118,0.0003322739,0.00003687558,0.0002275118,0.0001645431,0.0002269681],"domain_scores_gemma":[0.9897386,0.007416051,0.0007515089,0.000921501,0.0004711109,0.000701269],"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.0004812524,0.00006262332,0.0005664758,0.0002115606,0.00003952659,0.0002116782,0.0004833495,0.1456673,0.002133524,0.8306709,0.004957958,0.01451382],"study_design_scores_gemma":[0.00008379756,0.00003971827,0.0002272664,0.00003372846,0.00003088729,0.00007136496,0.0001986599,0.3086896,0.0006805359,0.6875275,0.002393916,0.00002300966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3843249,0.001987349,0.5423877,0.002811048,0.0003875092,0.0001813327,0.0005554351,0.000735545,0.06662921],"genre_scores_gemma":[0.9410726,0.001260764,0.03063873,0.0003047246,0.0002920971,0.0001695589,0.0003791531,0.0003754133,0.02550698],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01347731,"threshold_uncertainty_score":0.04508603,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01088634714624277,"score_gpt":0.2676463284957277,"score_spread":0.2567599813494849,"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."}}