{"id":"W2613774992","doi":"10.1007/s10107-020-01576-0","title":"General bounds for incremental maximization","year":2020,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Technische Universität Darmstadt; Deutsche Forschungsgemeinschaft","keywords":"Cardinality (data modeling); Knapsack problem; Competitive analysis; Submodular set function; Maximization; Mathematics; Mathematical optimization; Greedy algorithm; Bounded function; Matching (statistics); Class (philosophy); Combinatorics; Function (biology); Upper and lower bounds; 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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004950755,0.0002559922,0.0003531699,0.00009165093,0.0001661236,0.001099096,0.0009919915,0.0001928394,0.00004464714],"category_scores_gemma":[0.0002584334,0.0002417132,0.0001878924,0.0002087314,0.00005712198,0.0002009386,0.001470402,0.0003431743,0.00005336864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008788282,"about_ca_system_score_gemma":0.0001265014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003438875,"about_ca_topic_score_gemma":6.742222e-7,"domain_scores_codex":[0.9979509,0.00006791446,0.0004988508,0.0006224941,0.00044282,0.0004170447],"domain_scores_gemma":[0.9988754,0.00009560943,0.0001751865,0.0004954971,0.0001454292,0.0002128711],"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.00001319908,0.000343859,0.00002423786,0.002104285,0.0001075317,0.000009335969,0.001836962,0.003811383,0.0001442948,0.866299,0.001997565,0.1233084],"study_design_scores_gemma":[0.0002603317,0.00007472919,0.000002057768,0.00007684751,0.00001439477,0.000003539233,0.00001487731,0.7860524,0.0001540806,0.2078252,0.00528212,0.0002394271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001416013,0.00003892319,0.992785,0.003210672,0.0002267167,0.001693813,0.000007030393,0.000521714,0.00137458],"genre_scores_gemma":[0.01623562,0.00000623501,0.9821422,0.0003677745,0.0001845052,0.0006072528,0.0001261031,0.00003575036,0.0002945761],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.782241,"threshold_uncertainty_score":0.9999378,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06959338221277929,"score_gpt":0.3216730882626167,"score_spread":0.2520797060498374,"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."}}