{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005647022,0.0001487145,0.0001803957,0.001601063,0.0002768346,0.00022219,0.001137985,0.0001048943,0.00003209593],"category_scores_gemma":[0.00006986075,0.0001276373,0.00004186884,0.006900207,0.002230392,0.001012796,0.000321813,0.0002387886,0.00001751786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009077378,"about_ca_system_score_gemma":0.0003171995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001044468,"about_ca_topic_score_gemma":0.000004134265,"domain_scores_codex":[0.9982012,0.00001771369,0.0002386651,0.0006516271,0.0004862314,0.0004045611],"domain_scores_gemma":[0.9990395,0.00004165486,0.00009342929,0.0006135824,0.0001554564,0.00005635666],"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.000005771975,0.00004370207,0.0009358277,0.0000426703,0.00001695039,0.0000279711,0.0003829568,0.0003715223,0.05202951,0.7831249,0.00002725173,0.162991],"study_design_scores_gemma":[0.000730984,0.001105053,0.004248524,0.000668318,0.00005222295,0.0006689836,0.0004844381,0.5378739,0.1638636,0.2840667,0.005422155,0.0008150465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.115532,0.0003135008,0.8806991,0.0007066496,0.0006301997,0.0001498252,0.000001860251,0.0007131505,0.001253735],"genre_scores_gemma":[0.9511304,0.00001214539,0.04872009,0.00005322822,0.00002315744,0.000007048466,8.197094e-7,0.000007762748,0.0000452948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8355985,"threshold_uncertainty_score":0.8217971,"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."}}