{"id":"W2085216434","doi":"10.1016/s0304-3975(00)00144-4","title":"The ultimate strategy to search on m rays?","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Competitive analysis; Upper and lower bounds; Mathematics; Combinatorics; Algorithm; Computer science; Mathematical analysis","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00260479,0.0001414019,0.0001117318,0.0001553928,0.001104605,0.001503495,0.003599824,0.00002611615,0.00004454745],"category_scores_gemma":[0.00009602021,0.00008717798,0.00004040192,0.001867251,0.001455872,0.0004109303,0.0009649254,0.000235143,0.000702429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000564184,"about_ca_system_score_gemma":0.0001391997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002842444,"about_ca_topic_score_gemma":6.293136e-7,"domain_scores_codex":[0.9970982,0.0001692818,0.0002110426,0.0006239407,0.001073238,0.0008242729],"domain_scores_gemma":[0.9978628,0.0004030141,0.00002313099,0.0009652009,0.00027053,0.0004753782],"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.00001031928,0.00003028284,0.000008934234,6.818801e-7,0.000001184662,0.000008619133,0.0001845889,0.01482011,0.0001009896,0.8735865,0.000332607,0.1109152],"study_design_scores_gemma":[0.0001481675,0.0005666081,0.0003110385,0.00001337596,4.590819e-7,0.00002149222,0.000006815375,0.9557635,0.001079107,0.03895973,0.002977076,0.000152607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006260154,0.000007325627,0.963291,0.0133796,0.0003214153,0.0002712617,4.551187e-7,0.0001843765,0.01628442],"genre_scores_gemma":[0.9293103,0.00002413489,0.06626538,0.004201418,0.00005971515,0.00001095006,2.501106e-7,0.000006929196,0.0001209711],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9409434,"threshold_uncertainty_score":0.9995331,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02509891212686544,"score_gpt":0.3094509102406385,"score_spread":0.2843519981137731,"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."}}