{"id":"W2952864736","doi":"10.48550/arxiv.1506.07952","title":"Tradeoffs Between Cost and Information for Rendezvous and Treasure Hunt","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"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; Advice (programming); Combinatorics; Omega; Upper and lower bounds; Binary logarithm; Traverse; Mathematics; Discrete mathematics; Computer science; Physics; Mathematical analysis; Geography","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.0003699174,0.0001638434,0.0002102829,0.0002085955,0.000123294,0.0002355552,0.0004370576,0.0001988834,0.000002291801],"category_scores_gemma":[0.00004730888,0.0001781213,0.00004472546,0.0002041723,0.00007095176,0.001139286,0.0006065493,0.0002302858,0.000005472687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008778879,"about_ca_system_score_gemma":0.0001615751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004647201,"about_ca_topic_score_gemma":0.0000139557,"domain_scores_codex":[0.9991062,0.00006570783,0.0001505056,0.0003917748,0.0000781995,0.0002076717],"domain_scores_gemma":[0.9989663,0.00007996956,0.0001411,0.0003608956,0.000217781,0.0002339622],"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.0001610972,0.000147041,0.02475912,0.001055464,0.000384484,0.00004056697,0.007809598,0.2459276,0.000008043445,0.6006437,0.007156845,0.1119064],"study_design_scores_gemma":[0.001601454,0.0001467461,0.003956917,0.00006274712,0.00005864441,0.000004467063,0.0001205026,0.9496996,0.00001549436,0.02912117,0.01478169,0.0004305085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02220068,0.00005417764,0.9743969,0.0004401904,0.0001226637,0.0007693699,0.00007611983,0.0001386583,0.001801276],"genre_scores_gemma":[0.9940938,0.0002496926,0.00499754,0.0000871779,0.00003764169,0.000003023589,0.00008399734,0.000007336831,0.0004397657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9718931,"threshold_uncertainty_score":0.7263578,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1335887771927533,"score_gpt":0.2103871983532926,"score_spread":0.07679842116053934,"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."}}