{"id":"W3213789197","doi":"10.1142/s1793830922500306","title":"Optimal rendezvous on a line by location-aware robots in the presence of spies*","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; Université du Québec en Outaouais; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rendezvous; Robot; Competitive analysis; Computer science; Mobile robot; Set (abstract data type); Bounded function; Task (project management); Line (geometry); Algorithm; Artificial intelligence; Mathematics; Upper and lower bounds; Engineering","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.000257857,0.00009227872,0.000128271,0.00004501291,0.000106571,0.0001221875,0.000435663,0.00003616591,0.00000781674],"category_scores_gemma":[0.00004622276,0.00006838078,0.00002585816,0.0006422995,0.00006342053,0.000108353,0.0001143695,0.0001079237,0.000005309771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008826589,"about_ca_system_score_gemma":0.00005374184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009053349,"about_ca_topic_score_gemma":0.00000414231,"domain_scores_codex":[0.9990569,0.00003863876,0.0002694387,0.0002390984,0.0002588244,0.0001371044],"domain_scores_gemma":[0.9989623,0.0002113079,0.00009561032,0.0005296166,0.0001551715,0.00004600282],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001974778,0.0009613101,0.00003453924,0.0002365828,0.00002724793,0.000004944944,0.006643204,0.07761129,0.0003351388,0.8811223,0.001316184,0.03170532],"study_design_scores_gemma":[0.0002069258,0.0000511067,0.00005423133,0.00005562154,0.000005125304,0.00001104217,0.0007846736,0.9877337,0.0007530661,0.008614141,0.001616437,0.0001138872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003289499,0.0001993321,0.9955013,0.002577191,0.00001014355,0.0003730474,0.00002263142,0.000022138,0.0009652399],"genre_scores_gemma":[0.3126709,0.0006198197,0.6838126,0.0005363143,0.0000667937,0.0009483742,0.0001397092,0.00002569152,0.001179866],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9101225,"threshold_uncertainty_score":0.2788487,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02490822150995882,"score_gpt":0.2950486309745702,"score_spread":0.2701404094646114,"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."}}