{"id":"W2754752206","doi":"10.1016/j.tcs.2017.08.023","title":"A general framework for searching on a line","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Competitive analysis; Constant (computer programming); Search cost; Mathematics; Mathematical optimization; Line (geometry); Search problem; Upper and lower bounds; Fixed cost; Computer science","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.001110281,0.001000984,0.001033848,0.001532492,0.001475748,0.002841731,0.003364946,0.002328487,0.01748303],"category_scores_gemma":[0.004547609,0.0006007281,0.001615548,0.002774871,0.002252228,0.005391902,0.002593893,0.002908222,0.003243111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001275448,"about_ca_system_score_gemma":0.001107027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003496701,"about_ca_topic_score_gemma":0.003250167,"domain_scores_codex":[0.9990683,0.0003131304,0.00005338037,0.0002144347,0.0002386026,0.000112279],"domain_scores_gemma":[0.999111,0.0003932845,0.00006400239,0.0001977713,0.0001631731,0.00007080055],"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.00001520805,0.00001828474,0.0001349633,0.00006851462,0.00001151877,0.00005442234,0.0001113885,0.03305468,0.0005045778,0.9413981,0.003707279,0.02092107],"study_design_scores_gemma":[0.0000182462,0.0000290252,0.0000650974,0.0000311951,0.00001245615,0.00007763939,0.0000474821,0.2053234,0.0002376984,0.7735708,0.02057159,0.00001536765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001581525,0.0002848584,0.9859478,0.0004332245,0.00005992063,0.00002829694,0.00007352286,0.0001631571,0.01142767],"genre_scores_gemma":[0.1508805,0.001368808,0.8188285,0.0005372186,0.000310699,0.0003688667,0.0003716024,0.0003773954,0.02695641],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01748303,"threshold_uncertainty_score":0.05848652,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04851479088591047,"score_gpt":0.3635690444791842,"score_spread":0.3150542535932737,"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."}}