{"id":"W4388906604","doi":"10.1016/j.tcs.2023.114313","title":"Deterministic rendezvous in infinite trees","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Rendezvous; Computer science; Combinatorics; Node (physics); Tree (set theory); Mathematics; Discrete mathematics; Time complexity; Graph; Binary logarithm; Set (abstract data type); Algorithm","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00136147,0.0004432571,0.001451977,0.001052894,0.002191788,0.002701913,0.002102741,0.001838337,0.006584801],"category_scores_gemma":[0.0141587,0.0009825914,0.000735672,0.001370008,0.003257925,0.005173117,0.003544029,0.002400348,0.0007734074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00171506,"about_ca_system_score_gemma":0.000866532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002991067,"about_ca_topic_score_gemma":0.00375388,"domain_scores_codex":[0.9988137,0.0003591423,0.00006108886,0.0002586536,0.0002415621,0.000265753],"domain_scores_gemma":[0.9883363,0.009085203,0.0006044758,0.0009203326,0.0004198712,0.0006337249],"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.0003716151,0.00006646927,0.0008592558,0.0001667633,0.00004350265,0.000308825,0.0005292983,0.2096205,0.002596789,0.7682928,0.002553219,0.01459087],"study_design_scores_gemma":[0.00004384265,0.00002310537,0.0001415813,0.00003080068,0.00001803384,0.0001143011,0.0001579036,0.3793605,0.001059276,0.6172289,0.00180194,0.00001985469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4795097,0.001587712,0.4796227,0.001656704,0.0001496022,0.00007715109,0.0004400731,0.0009272769,0.03602915],"genre_scores_gemma":[0.9562811,0.0003933478,0.03151479,0.0001164699,0.0000434605,0.00006779676,0.0002211969,0.0002412742,0.01112057],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006584801,"threshold_uncertainty_score":0.02202833,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02155835231924106,"score_gpt":0.2877176212330398,"score_spread":0.2661592689137988,"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."}}