{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001842299,0.0001777772,0.0001822401,0.0003291614,0.0002562982,0.0003647132,0.00151299,0.00004893265,0.00005400886],"category_scores_gemma":[0.00002374697,0.0001330056,0.00003647187,0.002010865,0.001998294,0.001505901,0.0007722815,0.0002123596,0.00008239033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009562178,"about_ca_system_score_gemma":0.0000930449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006284954,"about_ca_topic_score_gemma":0.00000195667,"domain_scores_codex":[0.9972992,0.0001516302,0.0002501384,0.0005436116,0.0008209923,0.0009344541],"domain_scores_gemma":[0.9986184,0.00009095034,0.00005173131,0.0006797757,0.0001099369,0.0004491681],"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.000009043951,0.0001696278,0.001348707,0.000007606585,0.000002456984,0.00001504986,0.001097792,0.007429241,0.0001377983,0.9494287,0.00002082205,0.04033316],"study_design_scores_gemma":[0.0003688343,0.0003163753,0.006356165,0.00006816031,0.000001658091,0.00004637343,0.00001117956,0.9732561,0.0009289398,0.01830226,0.0001042515,0.000239763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0640166,0.00004030162,0.9332153,0.0003973364,0.0002280947,0.0002002028,2.591732e-7,0.0001464787,0.001755451],"genre_scores_gemma":[0.8485293,0.000007663413,0.1510713,0.0003372223,0.00003139073,0.000008231487,4.28175e-7,0.000008806483,0.000005622145],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9658268,"threshold_uncertainty_score":0.7362799,"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."}}