{"id":"W1988889787","doi":"10.1007/s00453-006-0074-2","title":"Deterministic Rendezvous in Graphs","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":179,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Computer science; Theory of computation; Time complexity; Binary logarithm; Graph; Identifier; Upper and lower bounds; Node (physics); Combinatorics; Mathematics; Discrete mathematics; Algorithm; Theoretical computer science; Computer network","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":[],"consensus_categories":[],"category_scores_codex":[0.000134392,0.00007182709,0.00008487681,0.000151036,0.00004614204,0.00008710234,0.0004081403,0.00003635084,0.00001850493],"category_scores_gemma":[0.00001428557,0.00006976389,0.00002800708,0.0004634054,0.00002965178,0.0001761277,0.00008781982,0.0000888118,0.0000709498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000213945,"about_ca_system_score_gemma":0.00003649059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001114815,"about_ca_topic_score_gemma":0.00003771414,"domain_scores_codex":[0.9991646,0.0000422043,0.0001700152,0.0002267345,0.0001616809,0.0002347376],"domain_scores_gemma":[0.9995816,0.00004516499,0.00002931887,0.00026862,0.0000310801,0.00004417815],"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.000006067278,0.000438616,0.001961668,0.00002365192,0.00001023215,0.0004016608,0.0004658215,0.005350041,0.0005218454,0.6046357,0.007916503,0.3782682],"study_design_scores_gemma":[0.0007011457,0.00008906973,0.006951891,0.00001643918,0.000001743957,0.00003853677,0.00000802106,0.875914,0.0005620472,0.1059462,0.009487852,0.0002830731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003561816,0.0001022876,0.9665577,0.001356371,0.000299405,0.0002207468,0.000002674059,0.0002723639,0.02762657],"genre_scores_gemma":[0.8306001,0.000009849199,0.1677829,0.0002881532,0.00004448798,0.00002257029,0.000006263714,0.000009199559,0.001236453],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.870564,"threshold_uncertainty_score":0.2844889,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00716953051749322,"score_gpt":0.2238464719368621,"score_spread":0.2166769414193689,"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."}}