{"id":"W4288734880","doi":"10.1016/j.tcs.2022.07.029","title":"Improved algorithms for non-submodular function maximization problem","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Cardinality (data modeling); Maximization; Mathematical optimization; Monotone polygon; Mathematics; Constraint (computer-aided design); Function (biology); Greedy algorithm; Set function; Computer science; Set (abstract data type)","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.002084776,0.0002018682,0.0002082775,0.0002948568,0.001890572,0.0004575078,0.002762015,0.00003493298,0.00006095281],"category_scores_gemma":[0.00003018742,0.0001949381,0.0001240151,0.001950824,0.0009745396,0.000716232,0.002065159,0.0002597341,0.000007420407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001251496,"about_ca_system_score_gemma":0.0001668758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004245313,"about_ca_topic_score_gemma":2.442851e-7,"domain_scores_codex":[0.9971722,0.00009976824,0.0003247606,0.0009689602,0.0007779904,0.0006563322],"domain_scores_gemma":[0.9984667,0.000149683,0.0001115769,0.0008266923,0.0002472941,0.000198019],"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.0000174941,0.0001010377,0.000006724933,0.000009542696,0.00000553827,0.000001845883,0.000238399,0.001804618,0.0006893845,0.8656909,0.00008825602,0.1313462],"study_design_scores_gemma":[0.0003234439,0.0006165451,0.0001127046,0.00000408076,0.000004919995,0.00002145102,0.000007269924,0.674598,0.0007050456,0.3226931,0.0007215447,0.0001918413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001405845,0.00001344018,0.9945376,0.0009176991,0.00164535,0.0006788152,0.000008861167,0.0002820996,0.0005102874],"genre_scores_gemma":[0.4817928,0.000001008474,0.5173119,0.0005640984,0.0001450786,0.0001504116,0.00000594351,0.000009990855,0.00001875075],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6727934,"threshold_uncertainty_score":0.9994088,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01349457095247311,"score_gpt":0.2375044258966565,"score_spread":0.2240098549441834,"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."}}