{"id":"W4399849664","doi":"10.26599/tst.2023.9010107","title":"Two-Stage Submodular Maximization Under Knapsack Problem","year":2024,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","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":"Qinglan Project of Jiangsu Province of China; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Knapsack problem; Submodular set function; Maximization; Mathematics; Stage (stratigraphy); Mathematical optimization; Computer science; Biology; Paleontology","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004094979,0.002941189,0.004024968,0.001394907,0.001093425,0.003024786,0.002712864,0.002937312,0.009953207],"category_scores_gemma":[0.006392166,0.001189108,0.002090369,0.004457581,0.001183938,0.004184796,0.002549213,0.002888003,0.00213136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001979891,"about_ca_system_score_gemma":0.002798141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003313504,"about_ca_topic_score_gemma":0.003704212,"domain_scores_codex":[0.9960756,0.001755738,0.0001651985,0.0009136872,0.0005037503,0.0005860784],"domain_scores_gemma":[0.9964992,0.002069622,0.0003346691,0.0003158392,0.0004353907,0.0003453012],"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.00068371,0.0005268047,0.001309682,0.002047857,0.000368903,0.0006220396,0.0002337818,0.764342,0.003994956,0.07310472,0.04011483,0.1126507],"study_design_scores_gemma":[0.00008745489,0.0002011791,0.0004408324,0.00006473956,0.00007157485,0.0002128538,0.00009877931,0.9230369,0.001612856,0.06840757,0.005715031,0.00005021307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02780543,0.002903522,0.9488866,0.001649562,0.0002560322,0.0005284563,0.001980135,0.0007201189,0.0152703],"genre_scores_gemma":[0.4626591,0.00419158,0.4992856,0.001459268,0.0006644559,0.001751239,0.004856871,0.000803192,0.0243288],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009953207,"threshold_uncertainty_score":0.03329676,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01857924213785202,"score_gpt":0.2797868052830199,"score_spread":0.2612075631451679,"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."}}