{"id":"W3092028377","doi":"10.1007/978-3-030-59267-7_13","title":"Two-Stage Submodular Maximization Problem Beyond Non-negative and Monotone","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Matroid; Monotone polygon; Cardinality (data modeling); Constraint (computer-aided design); Mathematics; Maximization; Approximation algorithm; Combinatorics; Discrete mathematics; Function (biology); Mathematical optimization; Computer science","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.0005624688,0.0006202859,0.0006281245,0.0006828742,0.0003988512,0.0007913568,0.002491221,0.0002373496,0.00001700791],"category_scores_gemma":[0.00007170757,0.0006077567,0.0001188235,0.0009643894,0.001028767,0.0008903319,0.002214718,0.0009239841,0.00002140474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00016843,"about_ca_system_score_gemma":0.0003537665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005220048,"about_ca_topic_score_gemma":0.0000730361,"domain_scores_codex":[0.9959122,0.00004292052,0.0005349411,0.001983207,0.0009329134,0.0005938502],"domain_scores_gemma":[0.9977193,0.0003876857,0.000329235,0.001047086,0.0002408953,0.0002758361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001729426,0.00005826263,0.0001042165,0.0001588866,0.00004235454,0.000267247,0.003866029,0.05058648,0.0003332265,0.2860182,0.00002539225,0.6585224],"study_design_scores_gemma":[0.0003438325,0.000147624,0.00007825557,0.0001434689,0.000006556713,0.0000291265,3.897946e-7,0.5944229,0.001166563,0.4028029,0.0003452505,0.0005131056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009081333,0.0002569701,0.9916584,0.001337746,0.0007066179,0.0007212316,0.00001686297,0.0001826463,0.005028634],"genre_scores_gemma":[0.07532725,0.00008364997,0.9222144,0.001661591,0.0003645185,0.00001933221,0.00001119107,0.00004393944,0.0002740481],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6580093,"threshold_uncertainty_score":0.9996374,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01482990337204587,"score_gpt":0.2327665604787423,"score_spread":0.2179366571066965,"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."}}