{"id":"W599153350","doi":"10.1016/j.jpdc.2015.06.004","title":"Tradeoffs between cost and information for rendezvous and treasure hunt","year":2015,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"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; Treasure; Computer science; Traverse; Advice (programming); Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Node (physics); A priori and a posteriori; Situated; Network topology; Topology (electrical circuits); Combinatorics; Computer network; Mathematics; Telecommunications; Artificial intelligence; Physics","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.0007047827,0.00008286219,0.0001854947,0.000081386,0.000122213,0.0002845067,0.0001272975,0.0000476084,2.560024e-7],"category_scores_gemma":[0.0001353079,0.00006676247,0.0000252788,0.0001191492,0.0000326109,0.0009089229,0.00008071877,0.0001164504,2.535154e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002174884,"about_ca_system_score_gemma":0.00006706089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004639114,"about_ca_topic_score_gemma":6.378404e-7,"domain_scores_codex":[0.9991841,0.00004514412,0.0003473535,0.00008434092,0.000180797,0.0001582685],"domain_scores_gemma":[0.9990462,0.0001242288,0.0002544633,0.00006124535,0.0002536393,0.0002601871],"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.0002450235,0.0001468292,0.06971235,0.0002695839,0.0002424821,0.00002325319,0.01028097,0.06413539,0.00003536775,0.03724629,0.01105047,0.806612],"study_design_scores_gemma":[0.005919785,0.0008216297,0.05121543,0.000107023,0.00003863713,0.0003618968,0.0006260358,0.9134972,0.00001748676,0.005004328,0.02210813,0.0002824115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02731968,0.0003112515,0.9703431,0.001731006,0.00005947629,0.0001333383,0.0000168151,0.00001660051,0.00006875261],"genre_scores_gemma":[0.9470173,0.00006000642,0.05271831,0.00009849979,0.00007877878,9.369159e-7,0.00001857701,0.000002531637,0.000005081752],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9196976,"threshold_uncertainty_score":0.2743505,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05024629657989928,"score_gpt":0.2861500957210397,"score_spread":0.2359037991411404,"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."}}