{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001717907,0.0001271659,0.0001554768,0.0006091697,0.0002220963,0.0004572856,0.002162465,0.00004015776,0.00003389241],"category_scores_gemma":[0.0001900291,0.0001085707,0.00003573149,0.004257944,0.001352151,0.0005522947,0.001154587,0.0001779192,0.0004323072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004229218,"about_ca_system_score_gemma":0.0001461114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002736683,"about_ca_topic_score_gemma":0.000003030465,"domain_scores_codex":[0.997725,0.0001171795,0.0002704814,0.0005877712,0.0006396856,0.0006599104],"domain_scores_gemma":[0.9986596,0.0003337682,0.00003544686,0.0006428186,0.00009564653,0.0002327362],"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.000002249699,0.00002487639,0.000150708,0.000003577258,6.85928e-7,0.00005349753,0.0005788797,0.004709694,0.0001067827,0.9513702,0.00006522317,0.04293358],"study_design_scores_gemma":[0.0001880635,0.0001089703,0.004356802,0.00001900906,4.802757e-7,0.00001338411,0.000004698638,0.885406,0.0001617691,0.1094451,0.0001571645,0.0001385525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01827608,0.000005437164,0.9719836,0.001784349,0.0004122372,0.0001578471,8.905347e-7,0.00050847,0.006871147],"genre_scores_gemma":[0.9416544,0.00001069216,0.05779048,0.0004401268,0.00003788872,0.00001050799,9.38257e-7,0.000005987874,0.00004899233],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9233783,"threshold_uncertainty_score":0.5556579,"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."}}