{"id":"W3082880435","doi":"10.1007/978-3-030-62401-9_10","title":"Fast Byzantine Gathering with Visibility in Graphs","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Robot; Computer science; Node (physics); Task (project management); Graph; Time complexity; Visibility; Identifier; Mobile robot; Theoretical computer science; Algorithm; Combinatorics; Artificial intelligence; Mathematics; Computer network; Engineering; Geography","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.001235176,0.0003860446,0.0004658431,0.0006576332,0.0001299315,0.0008915475,0.003831605,0.0001652571,0.000007475418],"category_scores_gemma":[0.0001515864,0.000320775,0.00007036759,0.003785803,0.0004391714,0.0005662338,0.004017361,0.001299838,0.000008251642],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001180959,"about_ca_system_score_gemma":0.0007097443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001322085,"about_ca_topic_score_gemma":0.0002480272,"domain_scores_codex":[0.9957882,0.0001576716,0.0004801456,0.001957973,0.0008978645,0.0007181311],"domain_scores_gemma":[0.9978424,0.0002044317,0.0001744327,0.001366093,0.0001961494,0.0002165019],"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.000008544428,0.00007920425,0.007494,0.00008289283,0.000003918036,0.00006287378,0.002602344,0.8667654,0.0002232366,0.0009200227,0.00000161487,0.121756],"study_design_scores_gemma":[0.0003438548,0.0001145853,0.006603451,0.0002710687,0.000001143968,0.00001162637,6.879666e-7,0.9685383,0.001180573,0.02253848,0.00001291145,0.0003832549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01640391,0.00007455493,0.9785697,0.003549404,0.0005384167,0.0005795168,0.000002198926,0.0002096843,0.00007256468],"genre_scores_gemma":[0.5601733,0.00001271374,0.4391263,0.0006199802,0.0000398635,0.00001593274,0.000002013303,0.000009505601,3.69446e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5437694,"threshold_uncertainty_score":0.9999244,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02180060328076514,"score_gpt":0.2709419330904639,"score_spread":0.2491413298096987,"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."}}