{"id":"W2950450215","doi":"10.1142/s0129054121500209","title":"Search on a Line by Byzantine Robots","year":2021,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University; Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"National Science Foundation","keywords":"Robot; Line (geometry); Computer science; Algorithm; Fault tolerance; Mobile robot; Distributed computing; Artificial intelligence; Mathematics; Geometry","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":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00184213,0.0002042453,0.0003579894,0.001197423,0.0001369984,0.001555077,0.006376937,0.00007849989,0.00005102158],"category_scores_gemma":[0.0002424011,0.0001893578,0.0002204953,0.0008653798,0.0003874737,0.001392347,0.002532019,0.0007000273,0.000009555809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000155576,"about_ca_system_score_gemma":0.002239661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002056614,"about_ca_topic_score_gemma":0.000001557689,"domain_scores_codex":[0.9952184,0.0001333935,0.0009907106,0.0005041111,0.00288412,0.0002692423],"domain_scores_gemma":[0.991363,0.0002169983,0.0008898349,0.0006715733,0.006652168,0.000206374],"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.00002538812,0.0009673322,0.0001848081,0.00002705758,0.0001958134,0.00006449849,0.00100339,0.8733783,0.002878004,0.021314,0.004549664,0.09541177],"study_design_scores_gemma":[0.0007954487,0.0004410817,0.0004388548,0.0006486674,0.000008890485,0.0001545851,0.00001649851,0.9800493,0.01312244,0.001255805,0.002789806,0.0002786556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01137596,0.000105238,0.9696385,0.01402549,0.004239809,0.0001299763,0.00001303791,0.00002491458,0.000447094],"genre_scores_gemma":[0.5210837,0.0002938765,0.4771795,0.001035603,0.0002771334,0.000002998821,0.00002585482,0.00001047944,0.00009083062],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5097077,"threshold_uncertainty_score":0.9994814,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05051982770315992,"score_gpt":0.3664393369516543,"score_spread":0.3159195092484944,"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."}}