{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001910211,0.001137369,0.002448832,0.001130987,0.001280774,0.002712554,0.00294194,0.002391591,0.008975473],"category_scores_gemma":[0.01454615,0.0006412251,0.0009237573,0.003227133,0.001431877,0.006228263,0.002409994,0.002865155,0.0007475936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001686151,"about_ca_system_score_gemma":0.001245851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002305334,"about_ca_topic_score_gemma":0.001640414,"domain_scores_codex":[0.9979311,0.0006482495,0.00009612268,0.0003239834,0.0006143318,0.0003861498],"domain_scores_gemma":[0.9914142,0.006361069,0.0005456955,0.0008791252,0.0004510323,0.0003488836],"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.001609697,0.0004260123,0.001134263,0.0005279664,0.0001035883,0.000318394,0.0001985641,0.7078538,0.002658472,0.139162,0.02206985,0.1239375],"study_design_scores_gemma":[0.00007420772,0.00009926369,0.0004001044,0.00003417016,0.00002778957,0.000152616,0.00007509614,0.7912288,0.0008134272,0.2045718,0.002505907,0.00001697827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1675425,0.003497114,0.7919052,0.005726574,0.001035277,0.0002051852,0.00104652,0.0009211019,0.02812041],"genre_scores_gemma":[0.8413859,0.002648879,0.1347426,0.0009831995,0.00109097,0.0002263139,0.001266793,0.0004737584,0.01718167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008975473,"threshold_uncertainty_score":0.03002596,"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."}}