{"id":"W2179376195","doi":"10.1016/j.tcs.2012.07.004","title":"Gathering asynchronous oblivious agents with local vision in regular bipartite graphs","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Computer science; Snapshot (computer storage); Asynchronous communication; Bipartite graph; Existential quantification; Theoretical computer science; Graph; Algorithm; Mathematics; Combinatorics; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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.001874686,0.0008331839,0.001808253,0.00102533,0.001503233,0.001853457,0.002707551,0.001918436,0.002668953],"category_scores_gemma":[0.01046788,0.0009161143,0.0008441862,0.001110983,0.001797128,0.003264669,0.003656932,0.001532819,0.000447769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001259192,"about_ca_system_score_gemma":0.001247212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00313649,"about_ca_topic_score_gemma":0.003745566,"domain_scores_codex":[0.9987131,0.0005313731,0.00005189899,0.0002823876,0.0001853768,0.0002358123],"domain_scores_gemma":[0.9933441,0.004277999,0.0007306016,0.0006601651,0.000411728,0.0005753869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000970403,0.0003381406,0.001613109,0.0003182884,0.0001735601,0.0003678604,0.0006531538,0.8060565,0.00818641,0.1446927,0.003223827,0.03340609],"study_design_scores_gemma":[0.0000537544,0.0000599879,0.0001148174,0.000006885276,0.00001793118,0.00002727593,0.000058089,0.9377905,0.0006915818,0.06089537,0.000273581,0.00001035968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2141423,0.0001708467,0.7765846,0.0007429762,0.00004861025,0.0001900031,0.0001121649,0.0005685018,0.007440015],"genre_scores_gemma":[0.9208668,0.0001075024,0.07354958,0.0001585494,0.00004328781,0.0002015492,0.0001251932,0.00009780593,0.004849703],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00313649,"threshold_uncertainty_score":0.009914398,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01024631773784149,"score_gpt":0.2581444462834714,"score_spread":0.2478981285456299,"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."}}