{"id":"W4313349371","doi":"10.1007/978-3-031-20350-3_13","title":"Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Matroid; Knapsack problem; Combinatorics; Constraint (computer-aided design); Maximization; Mathematics; Monotone polygon; Similarity (geometry); Discrete mathematics; Mathematical optimization; Computer science; Artificial intelligence","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009618008,0.0004111649,0.0003863522,0.0007725483,0.0004304554,0.0007465682,0.001870013,0.0001613994,0.000475706],"category_scores_gemma":[0.00004847904,0.0004127713,0.00007398069,0.0006126113,0.001017718,0.000791695,0.001770925,0.0007650619,0.00002274481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002652775,"about_ca_system_score_gemma":0.0005104062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001989525,"about_ca_topic_score_gemma":0.0000289448,"domain_scores_codex":[0.9964458,0.00007812466,0.0004400608,0.001398452,0.001053496,0.0005840645],"domain_scores_gemma":[0.9981753,0.0002250158,0.0002271772,0.0009649907,0.0001897953,0.0002176971],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003942313,0.00002448355,0.00004494399,0.00003677643,0.00001159871,0.00006678022,0.0004781504,0.5161545,0.00008086467,0.319135,0.00001571149,0.1639473],"study_design_scores_gemma":[0.0005249071,0.0001284354,0.00005089972,0.00007478383,0.000004727102,0.00009454863,6.968108e-7,0.9048207,0.0001323941,0.09098997,0.002606354,0.0005715336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003235411,0.0002752822,0.9899976,0.001327512,0.0007508339,0.0004860293,0.00001264555,0.000164458,0.006953314],"genre_scores_gemma":[0.08911178,0.0003834181,0.9033645,0.004592022,0.0002293155,0.00002676336,0.00004629022,0.00007717993,0.002168739],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3886663,"threshold_uncertainty_score":0.9998324,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02104701131332854,"score_gpt":0.2545204206725667,"score_spread":0.2334734093592382,"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."}}