{"id":"W4400485340","doi":"10.61091/jcmcc120-16","title":"Approximation Algorithms for the Submodular Hitting Set Problem","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Submodular set function; Set (abstract data type); Algorithm; Approximation algorithm; Computer science; Set function; Mathematical optimization; Set cover problem; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024286,0.002000273,0.00257072,0.001286359,0.0009132117,0.002773992,0.003046588,0.001959935,0.00726098],"category_scores_gemma":[0.00868264,0.0007815902,0.001419719,0.003091492,0.00102207,0.003938049,0.002092774,0.003762823,0.001238937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002457628,"about_ca_system_score_gemma":0.001960655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003156424,"about_ca_topic_score_gemma":0.00345585,"domain_scores_codex":[0.9980206,0.0006921573,0.00008213713,0.0003869395,0.0004364465,0.0003817213],"domain_scores_gemma":[0.9962348,0.002750933,0.0002759836,0.0003620347,0.000208251,0.0001678982],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004612935,0.0004169369,0.000999889,0.0005233113,0.0001745206,0.0001555064,0.0002149467,0.7346396,0.001502819,0.09283552,0.01452127,0.1535543],"study_design_scores_gemma":[0.0000619917,0.00008801779,0.0001067736,0.00003511639,0.00002471548,0.00008424844,0.00005768935,0.9330925,0.0003266991,0.06453324,0.001577184,0.00001184063],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02582121,0.002220829,0.9616615,0.0008411065,0.0001685375,0.0001898295,0.0003941823,0.000832043,0.007870847],"genre_scores_gemma":[0.3640727,0.002101479,0.6249843,0.0006305589,0.000300124,0.0005622616,0.001509109,0.0003789519,0.005460603],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00726098,"threshold_uncertainty_score":0.02429038,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01893136430840434,"score_gpt":0.2524280814755904,"score_spread":0.233496717167186,"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."}}