{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001295578,0.0001447881,0.0001486408,0.0003954227,0.0003034955,0.00039083,0.002196875,0.00004598936,0.0001055188],"category_scores_gemma":[0.00008334631,0.000118042,0.00003871336,0.001905612,0.002819371,0.0004731832,0.0006867009,0.0001976102,0.0002658785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007586151,"about_ca_system_score_gemma":0.0001446612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005459587,"about_ca_topic_score_gemma":0.000002676259,"domain_scores_codex":[0.9976016,0.0001300387,0.0002354341,0.0007078277,0.0006807326,0.0006443735],"domain_scores_gemma":[0.99865,0.0001301636,0.00003741329,0.0007535382,0.0001743141,0.0002545715],"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.00000588251,0.00006697357,0.00003907964,0.00000131171,8.637365e-7,0.00001136082,0.0003416546,0.0008336341,0.0001098302,0.9729277,0.00009150797,0.02557017],"study_design_scores_gemma":[0.0002063144,0.0004717648,0.0006946005,0.00001360338,3.399509e-7,0.00001204192,9.128427e-7,0.6643286,0.001061369,0.3330294,0.00005134963,0.0001295916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03880006,0.000005235756,0.9414603,0.001047895,0.0005496868,0.000148779,4.331453e-7,0.0001632472,0.01782439],"genre_scores_gemma":[0.8168859,0.000002852609,0.1815909,0.001412856,0.00007958719,0.000005001251,3.017873e-7,0.000005128842,0.00001745514],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7780858,"threshold_uncertainty_score":0.9998944,"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."}}