{"id":"W4405179551","doi":"10.26599/tst.2023.9010121","title":"Maximization of k-Submodular Function with d-Knapsack Constraints Over Sliding Window","year":2024,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Submodular set function; Knapsack problem; Sliding window protocol; Maximization; Window (computing); Function (biology); Mathematics; Mathematical optimization; Computer science; Biology","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.002298595,0.00238526,0.003425791,0.0009501789,0.0006436055,0.001584281,0.002452525,0.001578922,0.005430687],"category_scores_gemma":[0.005101773,0.0009438072,0.001440051,0.003121295,0.0009806621,0.002910324,0.001817822,0.00249231,0.0009643403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0019312,"about_ca_system_score_gemma":0.002524017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007589586,"about_ca_topic_score_gemma":0.007566602,"domain_scores_codex":[0.9984914,0.0005173743,0.00008025536,0.0004569085,0.0002263166,0.0002278157],"domain_scores_gemma":[0.9972636,0.001897677,0.000294956,0.0001908386,0.0002020415,0.0001509491],"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.0002177082,0.000158313,0.0007089281,0.0003954315,0.0001084972,0.000131163,0.00006525855,0.9060116,0.001506861,0.01835896,0.005395571,0.06694156],"study_design_scores_gemma":[0.0000237613,0.00005040506,0.0001056967,0.00001172712,0.00001198034,0.00002767691,0.00001986523,0.9900792,0.0005084341,0.008627423,0.0005237782,0.00001011225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01185751,0.0008527858,0.9843962,0.0003142967,0.00007026827,0.0001161837,0.0002366322,0.0003917822,0.001764458],"genre_scores_gemma":[0.3985674,0.001760207,0.5915769,0.0005247619,0.0001754088,0.0007620237,0.001130093,0.0003471628,0.005156012],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007589586,"threshold_uncertainty_score":0.0181675,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01043570830292928,"score_gpt":0.2377892844926169,"score_spread":0.2273535761896876,"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."}}