{"id":"W2963349456","doi":"10.2139/ssrn.3423199","title":"A Competitive Analysis of Online Knapsack Problems with Unit Density","year":2019,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Knapsack problem; Competitive analysis; Generalization; Truncation (statistics); Mathematics; Online algorithm; Mathematical optimization; Continuous knapsack problem; Randomized algorithm; Computer science; Algorithm; Statistics; Upper and lower bounds","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.004785619,0.002641195,0.003032322,0.003352058,0.001806516,0.005553368,0.007681954,0.004120697,0.02705542],"category_scores_gemma":[0.03179419,0.001497257,0.002245397,0.004595294,0.003043205,0.008453161,0.004378733,0.005130773,0.001918333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003821719,"about_ca_system_score_gemma":0.002470454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006261533,"about_ca_topic_score_gemma":0.004531283,"domain_scores_codex":[0.995419,0.001771056,0.0001238141,0.0003995502,0.001405528,0.0008810806],"domain_scores_gemma":[0.972782,0.02123307,0.00123908,0.001272341,0.001974646,0.00149887],"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.0006678612,0.0007938744,0.001545971,0.0008721141,0.0001456924,0.0002174683,0.0003151761,0.3633656,0.002244786,0.5564023,0.02288906,0.05054012],"study_design_scores_gemma":[0.00004071128,0.0001451016,0.0004065336,0.00005264132,0.00003825343,0.00007288797,0.0001090736,0.891225,0.0002844623,0.1051748,0.002424784,0.00002578888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1354453,0.008700775,0.7106888,0.004548659,0.0008152147,0.0006070619,0.0009639292,0.0005938757,0.1376363],"genre_scores_gemma":[0.8611664,0.00435591,0.09066474,0.001035799,0.001769921,0.0008356681,0.0008984261,0.0007995936,0.03847349],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02705542,"threshold_uncertainty_score":0.09050936,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0172752192963853,"score_gpt":0.2644035809901299,"score_spread":0.2471283616937447,"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."}}