{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001726801,0.0003106643,0.0007770553,0.0009024456,0.0001183962,0.0001945293,0.001614592,0.0001859328,0.00003854509],"category_scores_gemma":[0.00003288852,0.0002473965,0.0003255174,0.001508171,0.00009506184,0.0002412033,0.000726213,0.004018597,0.00001068218],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005383355,"about_ca_system_score_gemma":0.007095583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001763527,"about_ca_topic_score_gemma":0.005943457,"domain_scores_codex":[0.9962093,0.0003151215,0.0005545952,0.0005488854,0.0007604176,0.001611702],"domain_scores_gemma":[0.9972088,0.00008653818,0.0007884396,0.0007906849,0.0009869138,0.0001386607],"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.00003743307,0.0003036923,0.004755941,0.00006205562,0.004906483,0.000006136535,0.0006423401,0.4043618,0.00002366729,0.581652,0.00001190506,0.003236534],"study_design_scores_gemma":[0.001993949,0.001650698,0.008538372,0.0004932715,0.001615304,0.0002494493,0.001062691,0.879728,0.00007304487,0.1023171,0.001209468,0.001068652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03982471,0.0007055381,0.9564158,0.001073493,0.0001420198,0.000480256,0.00003353472,0.00006638234,0.001258217],"genre_scores_gemma":[0.9785873,0.004250936,0.01547777,0.0001141155,0.00006295481,0.000006835967,0.0001260339,0.00002761876,0.001346441],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9409381,"threshold_uncertainty_score":0.9999979,"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."}}