{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008596008,0.0004340807,0.0005773923,0.001629963,0.0001010218,0.0001712696,0.003428981,0.0003235954,0.00008043712],"category_scores_gemma":[0.00005545985,0.0004134297,0.0001333925,0.001031826,0.0007045211,0.0005888854,0.001141594,0.0008073976,0.00002806256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001823212,"about_ca_system_score_gemma":0.0007257407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008246383,"about_ca_topic_score_gemma":0.0001214324,"domain_scores_codex":[0.9963554,0.00006247548,0.000717906,0.001260605,0.00092984,0.0006738339],"domain_scores_gemma":[0.9977767,0.0001936441,0.0003347132,0.001297899,0.0002138016,0.0001832477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001964493,0.0002535788,0.0007794723,0.0001628839,0.00002673067,0.000435089,0.004733409,0.07542489,0.00009741142,0.1596383,0.00006358759,0.758365],"study_design_scores_gemma":[0.0006659014,0.0004771522,0.0009657452,0.0006249965,0.000005864355,0.00008144973,2.507158e-7,0.4154393,0.0009947201,0.5793223,0.0005248029,0.0008974982],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001336441,0.0003894066,0.9805394,0.0001668619,0.0008108648,0.0004441171,0.000004751476,0.00009426472,0.01741663],"genre_scores_gemma":[0.316094,0.0003629194,0.6815801,0.001359111,0.0001084269,0.00001599458,0.000009285505,0.00005474547,0.0004154749],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7574675,"threshold_uncertainty_score":0.9998317,"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."}}