{"id":"W2621800709","doi":"","title":"How to meet asynchronously (almost) everywhere","year":2012,"lang":"en","type":"article","venue":"HAL AMU","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Asynchronous communication; Computer science; Terrain; Graph; Simply connected space; Point (geometry); Path (computing); Strongly connected component; Robot; Plane (geometry); Theoretical computer science; Mathematics; Algorithm; Combinatorics; Artificial intelligence; Geometry; 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":[],"consensus_categories":[],"category_scores_codex":[0.000222414,0.0000829421,0.00008336161,0.00005207275,0.00008265109,0.000221999,0.0004461294,0.00003605474,0.00009301415],"category_scores_gemma":[0.00004235628,0.00007226675,0.00003212261,0.000264888,0.00001446436,0.0007376413,0.0002085951,0.00005156621,0.000395209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003517592,"about_ca_system_score_gemma":0.00003429427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001664719,"about_ca_topic_score_gemma":0.00001774348,"domain_scores_codex":[0.9990978,0.0000525056,0.00007835277,0.0001764072,0.0002270191,0.0003679751],"domain_scores_gemma":[0.9992915,0.00002861061,0.0000229525,0.0003226901,0.00006633575,0.0002678484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000009892847,0.0004143891,0.009602456,0.00005385915,0.00004501528,0.00002235218,0.008919283,0.001912948,0.002044907,0.6121617,0.2395091,0.1253041],"study_design_scores_gemma":[0.0007616062,0.0002867932,0.007845374,0.00005216659,0.000006612293,0.00006155413,0.0001874247,0.04403705,0.004949328,0.002001552,0.9390094,0.0008011256],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003854929,0.0001516672,0.9549183,0.01225317,0.0004690951,0.0002128262,0.00000206784,0.0002122746,0.02792566],"genre_scores_gemma":[0.8576987,0.000006720255,0.1328993,0.001476129,0.000196105,0.00001924319,0.000001512723,0.000009714856,0.007692595],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8538438,"threshold_uncertainty_score":0.5079744,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02134146295016659,"score_gpt":0.2461655440889937,"score_spread":0.2248240811388271,"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."}}