{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008708708,0.0004804861,0.0004594654,0.001249865,0.0001874374,0.0004565118,0.002549666,0.0002656439,0.0000561158],"category_scores_gemma":[0.00002158317,0.0004009791,0.00008208028,0.001096384,0.0008375786,0.0008085624,0.001035169,0.0007525464,0.00004889978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002794923,"about_ca_system_score_gemma":0.0004292152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007049541,"about_ca_topic_score_gemma":0.0003130083,"domain_scores_codex":[0.9961782,0.00005992223,0.0004855908,0.001473131,0.001013324,0.0007898234],"domain_scores_gemma":[0.9979982,0.0001199796,0.0002126455,0.001243791,0.0001928356,0.0002325549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001700596,0.00009209944,0.0002922509,0.00005238186,0.00001221832,0.0003505464,0.002113481,0.2870908,0.00004074582,0.01881194,0.00001741419,0.6911091],"study_design_scores_gemma":[0.0005162102,0.0005378351,0.0004662369,0.0008410181,0.000003793364,0.00007629128,2.850616e-7,0.9171524,0.0003472237,0.07872418,0.0006549952,0.0006795384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002139614,0.0002450123,0.9947678,0.0002260078,0.0004549594,0.0004802076,0.000001243126,0.0001476077,0.003463167],"genre_scores_gemma":[0.5344695,0.0001884632,0.4637314,0.001078284,0.00009359867,0.00002219734,0.000005535723,0.00006860595,0.0003423328],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6904296,"threshold_uncertainty_score":0.9998442,"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."}}