{"id":"W2623507859","doi":"10.1016/j.tcs.2017.05.029","title":"Improved analysis of the online set cover problem with advice","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"York University","funders":"","keywords":"Advice (programming); Set cover problem; Cover (algebra); Online algorithm; Set (abstract data type); Competitive analysis; Upper and lower bounds; Time complexity; Computer science; Mathematics; Computational complexity theory; Quality (philosophy); Algorithm; Discrete mathematics; Theoretical computer science; Combinatorics","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.003930311,0.001910442,0.003127092,0.002384892,0.001236397,0.003297286,0.005437681,0.003494796,0.02265198],"category_scores_gemma":[0.03156019,0.001072361,0.002596356,0.002745776,0.002302656,0.007105815,0.003018193,0.005786412,0.00152644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004003036,"about_ca_system_score_gemma":0.003936764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007950711,"about_ca_topic_score_gemma":0.007746951,"domain_scores_codex":[0.9955316,0.001199476,0.0001133055,0.0004645458,0.001884,0.0008070379],"domain_scores_gemma":[0.9709701,0.02397901,0.0008424344,0.001704235,0.001717678,0.0007865468],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007304193,0.0005421789,0.001434228,0.0007873042,0.0001696566,0.0002891381,0.0003278916,0.6150464,0.003580149,0.2739351,0.02423182,0.07892562],"study_design_scores_gemma":[0.00003558641,0.00004719106,0.0002375249,0.00004356422,0.0000351584,0.00005353924,0.00002522703,0.9010059,0.0004143861,0.09656467,0.001523327,0.00001394903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06781044,0.002375635,0.8759882,0.003613903,0.0004685092,0.0003136893,0.0009611186,0.00127819,0.04719019],"genre_scores_gemma":[0.6948515,0.002151447,0.255515,0.001137669,0.001593746,0.0005026143,0.001490112,0.001414169,0.04134371],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02265198,"threshold_uncertainty_score":0.07577837,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01354178952851827,"score_gpt":0.2784548933950822,"score_spread":0.264913103866564,"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."}}