{"id":"W2211113829","doi":"10.1109/tpds.2016.2623309","title":"Beehive: Erasure Codes for Fixing Multiple Failures in Distributed Storage Systems","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Replication (statistics); Erasure code; Overhead (engineering); Fault tolerance; Distributed data store; Erasure; Distributed computing; Transfer (computing); Reliability (semiconductor); Storage efficiency; Computer data storage; Parallel computing; Database; Decoding methods; Algorithm; Computer hardware; Operating system; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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"],"consensus_categories":[],"category_scores_codex":[0.0003324568,0.0003706288,0.0005428836,0.0002414651,0.0003382496,0.0002476887,0.0007105792,0.0002589393,0.000001606427],"category_scores_gemma":[0.00008704906,0.0002759222,0.0001007983,0.0004883908,0.0001484798,0.0008641192,0.00001402656,0.0002192487,0.00001254928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002522729,"about_ca_system_score_gemma":0.00005587935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002497241,"about_ca_topic_score_gemma":0.0001611722,"domain_scores_codex":[0.9975774,0.0001330978,0.0005983338,0.0007899966,0.0003029529,0.0005982532],"domain_scores_gemma":[0.9978812,0.0008146095,0.0002094531,0.0008168192,0.0001288558,0.000149111],"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.0003186323,0.000460022,0.0009585604,0.000439262,0.0001948709,0.0001051364,0.0002459279,0.9655244,0.008903435,0.01155113,0.003491343,0.007807336],"study_design_scores_gemma":[0.01212667,0.0009218321,0.001930397,0.00172709,0.00009191773,0.0002567451,0.002190521,0.9385277,0.00333276,0.001799329,0.03465987,0.002435175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006242901,0.0006556606,0.9817665,0.0005467784,0.0008758451,0.00108649,0.00810021,0.0007190432,0.000006610423],"genre_scores_gemma":[0.9957296,0.00008863192,0.003097533,0.00001151975,0.00003486926,0.0007818229,0.0001162593,0.00002219379,0.0001176012],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9894867,"threshold_uncertainty_score":0.9999693,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02108282473317203,"score_gpt":0.2493721689375512,"score_spread":0.2282893442043792,"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."}}