{"id":"W2202720387","doi":"10.1007/978-3-662-46078-8_16","title":"Deterministic Rendezvous in Restricted Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Rendezvous; Traverse; Robot; Computer science; Asynchronous communication; Graph; Discrete mathematics; Topology (electrical circuits); Mobile robot; Theoretical computer science; Node (physics); Combinatorics; Reachability; Algorithm; Mathematics; Artificial intelligence; Computer network; Physics","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.0009653262,0.0004415425,0.0004921515,0.001856262,0.0001347878,0.0005375172,0.003432626,0.0003329314,0.00002191538],"category_scores_gemma":[0.0002692703,0.0004153317,0.00008163602,0.001617588,0.0005434186,0.0005444183,0.001240446,0.000947405,0.00005502513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003374383,"about_ca_system_score_gemma":0.00116309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000348535,"about_ca_topic_score_gemma":0.000138307,"domain_scores_codex":[0.9958856,0.00007426171,0.0006177402,0.001422473,0.001248623,0.0007513689],"domain_scores_gemma":[0.9974184,0.0003552049,0.000226375,0.001346935,0.0003602715,0.0002927943],"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.0000109255,0.00006477519,0.0001041784,0.00004094993,0.000006799575,0.0005779301,0.001039282,0.1585537,0.00003489312,0.05573885,0.0001739667,0.7836537],"study_design_scores_gemma":[0.0004170482,0.0002044711,0.0001148511,0.0002337799,0.000002361737,0.0000625024,9.806681e-8,0.70637,0.00003228008,0.2900402,0.002005914,0.0005165215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002436601,0.0004279853,0.9877825,0.0005871407,0.001048733,0.0004246166,0.000003819606,0.000173968,0.009526889],"genre_scores_gemma":[0.1720243,0.0003070665,0.8229571,0.001911902,0.0003182448,0.00003660646,0.00002209459,0.00008874375,0.002333927],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7831372,"threshold_uncertainty_score":0.9998298,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03973797012185137,"score_gpt":0.2805770144958737,"score_spread":0.2408390443740224,"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."}}