{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006900706,0.0002378017,0.000211581,0.0005790356,0.0006198897,0.001047896,0.002279504,0.00005588057,0.000006231819],"category_scores_gemma":[0.00003580989,0.0002628378,0.00006377049,0.001889606,0.0001504929,0.0007076405,0.008620057,0.0002840523,0.00001864183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001595985,"about_ca_system_score_gemma":0.00007715794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004045106,"about_ca_topic_score_gemma":0.00002382747,"domain_scores_codex":[0.9969239,0.00003703675,0.0002954131,0.001543915,0.0007558202,0.0004439342],"domain_scores_gemma":[0.998242,0.0000204965,0.0001196942,0.00125966,0.0001563749,0.0002017871],"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.000003037934,0.0002178033,0.0002300236,0.0004343374,0.00005161932,0.00008353496,0.001264782,0.02442299,0.005798549,0.1013421,0.0001067247,0.8660445],"study_design_scores_gemma":[0.0001519727,0.00003537752,0.01096231,0.000429911,0.00003210927,0.00001986413,0.0003881665,0.9703726,0.0008383237,0.01264794,0.003471323,0.000650137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05703111,0.0002433384,0.9374294,0.001919644,0.0009282778,0.000666644,0.000009700707,0.0002246567,0.001547223],"genre_scores_gemma":[0.710655,0.0001353756,0.2877404,0.0007967521,0.00008035176,0.0001249485,0.00002195279,0.00001088647,0.0004343216],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9459496,"threshold_uncertainty_score":0.9999891,"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."}}