{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001413992,0.001708681,0.002215479,0.00173457,0.002076788,0.002401136,0.001949438,0.001646692,0.007252443],"category_scores_gemma":[0.008415794,0.001055475,0.00168373,0.001923617,0.001624274,0.005931171,0.006823936,0.002156726,0.001668753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000889451,"about_ca_system_score_gemma":0.001568102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003151102,"about_ca_topic_score_gemma":0.005380478,"domain_scores_codex":[0.9981021,0.0005124388,0.00008907238,0.0004153831,0.0004392474,0.0004416513],"domain_scores_gemma":[0.9933816,0.003211337,0.0004642329,0.002168559,0.0004352273,0.00033914],"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.002952884,0.0005137965,0.003377376,0.001596736,0.0002997291,0.000733105,0.001980342,0.1962476,0.04752234,0.1777139,0.03052888,0.5365333],"study_design_scores_gemma":[0.0002612179,0.0003802406,0.000690148,0.0001054736,0.0001118551,0.0002860385,0.0004357999,0.6353927,0.02603793,0.3243754,0.01185982,0.00006344388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09663917,0.0004708079,0.8862767,0.0007726994,0.0001375708,0.0002834797,0.0005798881,0.004808326,0.01003127],"genre_scores_gemma":[0.4783942,0.0003003953,0.5112825,0.00015029,0.00008562361,0.0002083998,0.0008783222,0.001021084,0.007679307],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007252443,"threshold_uncertainty_score":0.02426189,"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."}}