{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.001045444,0.0001319966,0.0002361422,0.0001752067,0.0008068326,0.0006500684,0.005465632,0.00003366968,0.00003852802],"category_scores_gemma":[0.00008504963,0.00007275882,0.0000929478,0.001689928,0.003656642,0.0007564276,0.001907985,0.0001687981,0.000005402737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002722919,"about_ca_system_score_gemma":0.00021015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002144092,"about_ca_topic_score_gemma":0.00001248681,"domain_scores_codex":[0.9980296,0.00009109775,0.0002386349,0.0005231065,0.0007371895,0.0003803602],"domain_scores_gemma":[0.9970184,0.0001068259,0.0002244267,0.002054926,0.0004300446,0.0001653848],"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.00001065983,0.00009219728,0.001119851,0.000008037726,0.00005870494,0.000001645866,0.0005006306,0.01162307,0.0003648354,0.9803778,0.00002925605,0.005813294],"study_design_scores_gemma":[0.0002287453,0.0001332644,0.01045822,0.00002007857,0.00003979185,0.000003388104,0.000003384297,0.9824076,0.0008135035,0.005714852,0.00005826248,0.0001189324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01991744,0.000003282412,0.9740137,0.002714361,0.0001219905,0.0002262911,0.000008688691,0.00007101489,0.002923174],"genre_scores_gemma":[0.7991951,0.000001928974,0.2003253,0.0003971194,0.00001726841,0.000003095254,9.648887e-7,0.000003702647,0.00005546941],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.974663,"threshold_uncertainty_score":0.9999153,"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."}}