{"id":"W3181822265","doi":"10.1007/978-3-030-93043-1_1","title":"On the Fault-Tolerant Online Bin Packing Problem","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Replica; Bin packing problem; Server; Bin; Computer science; Fault tolerance; Competitive analysis; Sequence (biology); Distributed computing; Mathematics; Algorithm; Parallel computing; Computer network; 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","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001807377,0.000444676,0.0004207443,0.0005119122,0.0004441238,0.002566005,0.005542749,0.0002301248,0.00002686536],"category_scores_gemma":[0.000368662,0.0003043197,0.0001439196,0.002666638,0.0004327224,0.0004254161,0.005358135,0.001827249,0.00001460761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002380372,"about_ca_system_score_gemma":0.001120616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007854275,"about_ca_topic_score_gemma":0.0001363851,"domain_scores_codex":[0.9951426,0.0003543373,0.0005372632,0.001760785,0.001372106,0.0008329264],"domain_scores_gemma":[0.9961138,0.0009057616,0.0002408078,0.002129072,0.0004383617,0.0001722372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001794627,0.0001297035,0.00006486355,0.0000351745,0.000006727179,0.00004014509,0.002355681,0.8475702,0.0001308338,0.002753228,0.00002311575,0.1468886],"study_design_scores_gemma":[0.0001670577,0.00007440721,0.0002363334,0.0005722279,0.000001988607,0.0000179898,0.000002074151,0.9654788,0.001358669,0.03166643,0.00005332878,0.0003706801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01231581,0.0001627425,0.9697778,0.01518483,0.001591544,0.0006917425,0.000005059097,0.0002019042,0.00006858665],"genre_scores_gemma":[0.5252361,0.00003535807,0.4700217,0.00450704,0.0001425113,0.0000301373,0.00001005759,0.00001424935,0.000002861765],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5129203,"threshold_uncertainty_score":0.9999409,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03060397682106392,"score_gpt":0.286298877955087,"score_spread":0.255694901134023,"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."}}