{"id":"W2111880148","doi":"10.1007/978-3-642-22212-2_15","title":"Gathering Asynchronous Oblivious Agents with Local Vision in Regular Bipartite Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Bipartite graph; Asynchronous communication; Theoretical computer science; Distributed computing; Computer network; Graph","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.001374619,0.0008796226,0.001599183,0.0008301265,0.00130209,0.001689996,0.002713372,0.001704856,0.002931985],"category_scores_gemma":[0.006485436,0.0008817843,0.0009433819,0.001108688,0.001588376,0.002999546,0.003626416,0.001760796,0.000560938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001104486,"about_ca_system_score_gemma":0.001052586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002360797,"about_ca_topic_score_gemma":0.002802985,"domain_scores_codex":[0.9989123,0.0004175006,0.00004497986,0.0002447796,0.0001830778,0.0001973087],"domain_scores_gemma":[0.9961365,0.002491065,0.0003310144,0.0004794866,0.0002545567,0.0003073136],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006682009,0.0002590808,0.0007924354,0.0004391402,0.0001470394,0.0003148094,0.0006264315,0.7013865,0.009470974,0.2270505,0.005526402,0.05331847],"study_design_scores_gemma":[0.00004333394,0.00005349226,0.00007784192,0.000009817826,0.0000155031,0.00003490322,0.00005103742,0.8998497,0.0008928034,0.09844788,0.0005129323,0.00001083069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08905804,0.0001919569,0.8997406,0.0004577157,0.00005328117,0.0001766209,0.0001013098,0.0006496261,0.009570807],"genre_scores_gemma":[0.8334115,0.0002433763,0.1548771,0.0001949234,0.00007551608,0.0003498975,0.0002091379,0.0001943087,0.01044425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002931985,"threshold_uncertainty_score":0.009808481,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01815095563036638,"score_gpt":0.2418774017551279,"score_spread":0.2237264461247616,"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."}}