{"id":"W2112983578","doi":"10.1287/mnsc.2020.3820","title":"Maximizing Sequence-Submodular Functions and Its Application to Online Advertising","year":2021,"lang":"en","type":"preprint","venue":"Management Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Submodular set function; Sequence (biology); Monotonic function; Greedy algorithm; Rewriting; Function (biology); Computer science; Mathematical optimization; Class (philosophy); Simple (philosophy); Online algorithm; Time complexity; Mathematics; Algorithm; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003836565,0.001565278,0.001766584,0.001144583,0.0005928018,0.001469951,0.001547499,0.001328268,0.00230136],"category_scores_gemma":[0.01269547,0.0006125502,0.0009664821,0.002219916,0.001555596,0.00371187,0.001420056,0.003014441,0.0005549407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002518169,"about_ca_system_score_gemma":0.001900753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002040129,"about_ca_topic_score_gemma":0.00154539,"domain_scores_codex":[0.9980866,0.001069019,0.0000650036,0.0002939406,0.0003235173,0.0001620422],"domain_scores_gemma":[0.9916275,0.006838683,0.0004138899,0.0004435058,0.0004709942,0.0002055721],"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.0001885186,0.0003077606,0.0009826706,0.000386797,0.00008814446,0.0001397831,0.0002370544,0.5499175,0.00503922,0.303868,0.008523516,0.1303211],"study_design_scores_gemma":[0.00001792998,0.00005492399,0.0001584191,0.00001399334,0.00001245491,0.00005304847,0.00001817014,0.883909,0.001438388,0.1124049,0.001905179,0.00001357702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01974243,0.001302164,0.970096,0.001164294,0.00006484159,0.0000832176,0.00009821902,0.0003845922,0.007064338],"genre_scores_gemma":[0.4977655,0.002598817,0.490551,0.0006332584,0.0003717643,0.0004021207,0.0003232442,0.0003513347,0.007003038],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003836565,"threshold_uncertainty_score":0.02028996,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04135716981506005,"score_gpt":0.288273015183757,"score_spread":0.246915845368697,"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."}}