{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001683723,0.000774751,0.001105433,0.0009223648,0.001454428,0.003385972,0.001798497,0.003589507,0.01600887],"category_scores_gemma":[0.01321239,0.0007439315,0.0007651672,0.001079047,0.002513597,0.007054103,0.002281232,0.002630179,0.004459389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008500236,"about_ca_system_score_gemma":0.001002269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007909136,"about_ca_topic_score_gemma":0.001112336,"domain_scores_codex":[0.9990693,0.000413295,0.00004852626,0.0001744319,0.0001431271,0.0001514552],"domain_scores_gemma":[0.9974752,0.001290876,0.0001978649,0.0005092983,0.0002755764,0.0002510662],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003604619,0.0000964205,0.001767091,0.0002611472,0.00008859085,0.0000986246,0.0002778004,0.01747668,0.00141868,0.7949327,0.02282178,0.1603999],"study_design_scores_gemma":[0.00007201312,0.0001232847,0.0003728583,0.0001945122,0.00004313679,0.0002675694,0.0004944738,0.07971374,0.001529183,0.8835865,0.03356538,0.00003745756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07438202,0.006781055,0.7807874,0.02637974,0.001055002,0.0001375134,0.0004299018,0.001015359,0.109032],"genre_scores_gemma":[0.5657036,0.003163872,0.3702451,0.003152931,0.0006463514,0.0002452341,0.0004165875,0.0005575398,0.05586856],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01600887,"threshold_uncertainty_score":0.05355507,"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."}}