{"id":"W25030497","doi":"10.1007/978-3-642-25873-2_29","title":"Asynchronous Rendezvous of Anonymous Agents in Arbitrary Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Asynchronous communication; Computer science; Graph; Theoretical computer science; Algorithm; Computer network","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.0008161666,0.0005718624,0.0009002661,0.0009214415,0.001887466,0.001655255,0.002183638,0.001054995,0.004908507],"category_scores_gemma":[0.005154738,0.0005657306,0.00075122,0.0008820061,0.001704821,0.00367149,0.002850284,0.001592461,0.0007541185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000812252,"about_ca_system_score_gemma":0.0006230931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002124526,"about_ca_topic_score_gemma":0.0023913,"domain_scores_codex":[0.9991239,0.0002391663,0.00003981994,0.0002207426,0.0001912708,0.000185165],"domain_scores_gemma":[0.9965903,0.00183182,0.0002605369,0.0006962043,0.0002461135,0.0003750169],"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.0006978228,0.0001002321,0.0007167901,0.0001918318,0.00006263531,0.0005025328,0.001024518,0.1500282,0.01017611,0.797365,0.003944659,0.03518964],"study_design_scores_gemma":[0.00009808312,0.00007253968,0.0002710405,0.00002428577,0.00004489776,0.0001809716,0.0003564117,0.4478382,0.005413171,0.5394169,0.006248021,0.00003553365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3627003,0.0005334324,0.5830265,0.0005980831,0.0002810846,0.0001395045,0.0002014313,0.001260376,0.05125942],"genre_scores_gemma":[0.9321945,0.00030701,0.04513301,0.00007412933,0.00008583584,0.0001040464,0.000139396,0.0002648314,0.02169729],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004908507,"threshold_uncertainty_score":0.0164206,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03403932489494358,"score_gpt":0.2595617817778395,"score_spread":0.2255224568828959,"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."}}