{"id":"W4387872170","doi":"10.1016/j.ipl.2023.106455","title":"Deterministic treasure hunt and rendezvous in arbitrary connected graphs","year":2023,"lang":"en","type":"article","venue":"Information Processing Letters","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":"Treasure; Rendezvous; Traverse; Time complexity; Computer science; Algorithm; Node (physics); Connectivity; Combinatorics; Mathematics; Graph; Discrete mathematics; Theoretical computer science","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.0009159305,0.0007272388,0.001820449,0.001218301,0.001760885,0.002374524,0.002605365,0.002569356,0.007116461],"category_scores_gemma":[0.01049768,0.001014366,0.001130646,0.001625183,0.003205666,0.004052045,0.003196159,0.002192963,0.000661219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001492103,"about_ca_system_score_gemma":0.001043554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005110996,"about_ca_topic_score_gemma":0.005728913,"domain_scores_codex":[0.9991855,0.0002425164,0.00002983808,0.0001974336,0.0001266566,0.0002180169],"domain_scores_gemma":[0.9928775,0.005229198,0.0005332571,0.0005495924,0.0002489869,0.000561365],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000731273,0.00009278977,0.001089038,0.0001877357,0.0001062846,0.0004598803,0.0003126173,0.5292956,0.002421132,0.4470129,0.004937761,0.013353],"study_design_scores_gemma":[0.00007281315,0.00004276988,0.000292308,0.00002032483,0.00002138054,0.00009772725,0.0001222577,0.6220347,0.000791127,0.3755867,0.0008888313,0.00002901851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5889347,0.001033047,0.3630081,0.002366001,0.000227923,0.00016831,0.0006453889,0.0006772784,0.04293937],"genre_scores_gemma":[0.9626957,0.0003551145,0.02190152,0.0001901556,0.00004716567,0.00008868107,0.0002649417,0.0001762117,0.01428052],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007116461,"threshold_uncertainty_score":0.02380693,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01283665702480478,"score_gpt":0.2316726481166298,"score_spread":0.218835991091825,"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."}}