{"id":"W2086312880","doi":"10.1016/j.tcs.2014.03.028","title":"Multi-target ray searching problems","year":2014,"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 Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Multiplicative function; Context (archaeology); Mathematics; Mathematical optimization; Metric (unit); Measure (data warehouse); Disjoint sets; Linear search; Asymptotically optimal algorithm; Competitive analysis; Beam search; Computer science; Algorithm; Search algorithm; Discrete mathematics; Upper and lower bounds; Data mining","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":[],"consensus_categories":[],"category_scores_codex":[0.004406443,0.0001828957,0.0001992874,0.0002552408,0.0006516612,0.000949925,0.003307925,0.00004800585,0.00006554386],"category_scores_gemma":[0.0002532045,0.0001452255,0.00006241436,0.00129869,0.001937921,0.000995146,0.001495449,0.000308528,0.0002561401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004584235,"about_ca_system_score_gemma":0.0001303278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003202562,"about_ca_topic_score_gemma":3.550445e-7,"domain_scores_codex":[0.9967176,0.0003130811,0.0002894652,0.000896132,0.0009455322,0.0008381798],"domain_scores_gemma":[0.9978909,0.0002622982,0.0000584155,0.001032125,0.0002636244,0.0004926635],"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.000001337951,0.00006812483,0.00006565531,0.000009567195,0.000002009459,0.000001817759,0.0006355839,0.01969764,0.0009158162,0.9522068,0.00003882938,0.02635684],"study_design_scores_gemma":[0.000295002,0.0001468079,0.0003605627,0.00002286879,7.955686e-7,0.000009688258,0.000001942431,0.9332957,0.0009886298,0.06381169,0.0008644051,0.0002019562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001023597,0.00001046833,0.9912401,0.001952034,0.0004003522,0.000243406,4.788731e-7,0.0003882835,0.004741293],"genre_scores_gemma":[0.4972135,0.00000206953,0.5020648,0.0006229805,0.00005473753,0.000006167394,4.904596e-7,0.000006025009,0.00002927475],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.913598,"threshold_uncertainty_score":0.9160149,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01739094751749063,"score_gpt":0.2695553355300603,"score_spread":0.2521643880125697,"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."}}