{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007109891,0.002561791,0.001865263,0.002870106,0.002057503,0.005261029,0.006205357,0.002997309,0.01643784],"category_scores_gemma":[0.03032,0.001002018,0.002692138,0.004352828,0.003278706,0.009907246,0.005199789,0.007157077,0.002680881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006711905,"about_ca_system_score_gemma":0.003115125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004367349,"about_ca_topic_score_gemma":0.004145041,"domain_scores_codex":[0.9931537,0.002014121,0.0002322818,0.001175328,0.002153218,0.001271335],"domain_scores_gemma":[0.9818818,0.01293583,0.0008790679,0.002129212,0.001528832,0.000645376],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002148986,0.0001190528,0.0006009234,0.0003891366,0.0000676033,0.0000989714,0.0001998698,0.1176412,0.001710251,0.8240385,0.01342476,0.04149475],"study_design_scores_gemma":[0.00004405728,0.00008457347,0.000385183,0.00008875717,0.00006857184,0.0001678906,0.00005476813,0.4895849,0.001440249,0.4918856,0.01616338,0.00003217292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01547395,0.003010546,0.8999019,0.002609768,0.0002132491,0.0002760493,0.0005412789,0.001039869,0.07693349],"genre_scores_gemma":[0.4720424,0.003638488,0.4994244,0.002107924,0.0009120912,0.001233899,0.001348728,0.001210883,0.01808112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01643784,"threshold_uncertainty_score":0.05498999,"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."}}