{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004793575,0.0006582256,0.001151384,0.0007045195,0.001275976,0.001478277,0.001901581,0.001049485,0.009027622],"category_scores_gemma":[0.003606328,0.0007424166,0.0007469901,0.001080865,0.001869369,0.003121849,0.002581477,0.001851651,0.001790349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001068765,"about_ca_system_score_gemma":0.0006219145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002526,"about_ca_topic_score_gemma":0.002952607,"domain_scores_codex":[0.9992959,0.0001585165,0.00002792045,0.0002053057,0.0001533283,0.0001589959],"domain_scores_gemma":[0.9978855,0.001213166,0.0001287274,0.0005299585,0.0001078377,0.000134752],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003278267,0.00004438231,0.0003000479,0.0003576121,0.00004615334,0.0001977634,0.0003490849,0.1378872,0.00550649,0.8032914,0.007850004,0.04384207],"study_design_scores_gemma":[0.00005529798,0.0000336052,0.0001638234,0.00005406147,0.00002427774,0.0001615784,0.0001378169,0.1888595,0.00312753,0.7969512,0.01040152,0.00002974943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2361529,0.002293593,0.6256821,0.00118706,0.0003170525,0.0001872273,0.0009665531,0.002467949,0.1307456],"genre_scores_gemma":[0.8773852,0.00166602,0.06875574,0.0001829437,0.0001122839,0.0002096518,0.0008060414,0.0008101715,0.05007196],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009027622,"threshold_uncertainty_score":0.03020042,"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."}}