{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000282532,0.00008826456,0.00009064899,0.0004927411,0.0001222448,0.0004201182,0.0002125727,0.00003997911,0.000002949893],"category_scores_gemma":[0.00007503293,0.00008489919,0.00001528785,0.001063099,0.00004337964,0.002430623,0.00006199042,0.0001219915,0.00003761112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002150897,"about_ca_system_score_gemma":0.00006212408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007551705,"about_ca_topic_score_gemma":0.000002842298,"domain_scores_codex":[0.9991275,0.00003558066,0.0002787352,0.0001229375,0.0002198346,0.0002153755],"domain_scores_gemma":[0.9996192,0.00004658179,0.00009198556,0.0001290934,0.00005245579,0.00006070383],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003949548,0.000063617,0.00688518,0.0009092054,0.00002277645,0.00009473596,0.04116574,0.02381069,0.002291898,0.01617463,0.006727781,0.9018142],"study_design_scores_gemma":[0.0008227397,0.0000350814,0.01726842,0.0001183914,0.000002352331,0.00003052288,0.0001805373,0.976919,0.0001639061,0.00241064,0.001796364,0.00025204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4222402,0.00008087279,0.540651,0.02846641,0.000377951,0.0007322524,0.000009202292,0.002054414,0.005387668],"genre_scores_gemma":[0.9884686,0.00001959649,0.006500329,0.004918819,0.000007720185,0.00003006381,0.00002906209,0.000005233318,0.00002056161],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9531083,"threshold_uncertainty_score":0.4051209,"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."}}