{"id":"W4360610866","doi":"10.1142/s0217595923400122","title":"Minimization Problems with Non-Submodular Cover Constraint","year":2023,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Cover (algebra); Constraint (computer-aided design); Set function; Set cover problem; Mathematics; Greedy algorithm; Set (abstract data type); Mathematical optimization; Covering problems; Function (biology); Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.002538309,0.00009847264,0.0001617573,0.0005921022,0.0003553385,0.0004354439,0.0006969576,0.00004917938,0.00009150101],"category_scores_gemma":[0.0001685937,0.00007398925,0.00006248004,0.001695787,0.0002395043,0.0007510206,0.000130575,0.0004615414,0.0001306746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006528394,"about_ca_system_score_gemma":0.0007469021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004044981,"about_ca_topic_score_gemma":0.000001762502,"domain_scores_codex":[0.997192,0.0002017709,0.0003611766,0.0002177187,0.001687478,0.0003399065],"domain_scores_gemma":[0.9976851,0.0003209939,0.00009748064,0.000256352,0.001490725,0.0001493631],"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.0001838684,0.0006835618,0.005903279,0.0001209387,0.0003970812,0.00112648,0.007115524,0.08250177,0.008646657,0.7513333,0.09420513,0.04778242],"study_design_scores_gemma":[0.004580841,0.003653169,0.03833969,0.0007270867,0.00002016686,0.002605356,0.00390922,0.7666402,0.004995354,0.08124977,0.0923951,0.0008840277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04783893,0.0001839292,0.908923,0.01685071,0.0006326046,0.0007239509,0.0000173996,0.00007778675,0.0247517],"genre_scores_gemma":[0.9734994,0.00008868011,0.02514069,0.00003025463,0.0001705731,0.00001216716,0.000009844633,0.000009669712,0.001038779],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9256604,"threshold_uncertainty_score":0.4198996,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06893791714868018,"score_gpt":0.3320586450331574,"score_spread":0.2631207278844772,"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."}}