{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001099508,0.0007244221,0.0004485357,0.0007450965,0.0005953506,0.0005493624,0.001072509,0.0007594762,0.001642702],"category_scores_gemma":[0.006879573,0.0002602279,0.0002528587,0.0007082951,0.0009745688,0.001380333,0.001319999,0.001111113,0.0004237102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008114924,"about_ca_system_score_gemma":0.00132849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002933604,"about_ca_topic_score_gemma":0.003162852,"domain_scores_codex":[0.9991584,0.0002054298,0.00004564718,0.0001111952,0.000357884,0.0001214699],"domain_scores_gemma":[0.997179,0.001335933,0.0002914966,0.000597916,0.0005010672,0.00009456869],"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.0006216578,0.0001252618,0.001711888,0.0002824354,0.00005959773,0.0001815803,0.0002329296,0.7420086,0.03960642,0.03495365,0.006800632,0.1734153],"study_design_scores_gemma":[0.00007018565,0.000202952,0.000316765,0.00004820358,0.0000155167,0.0001310289,0.00004741215,0.9378454,0.04106726,0.0139215,0.006290057,0.00004373548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1127732,0.001722123,0.8737313,0.0003933142,0.0001523194,0.0001564072,0.0002748836,0.006738995,0.004057606],"genre_scores_gemma":[0.734933,0.0005089608,0.2610747,0.0001943757,0.00003261077,0.0002552044,0.0002929129,0.0004083241,0.002299821],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002933604,"threshold_uncertainty_score":0.005887806,"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."}}