{"id":"W1987787762","doi":"10.1109/lcomm.2014.2332491","title":"An Efficient Binary Locally Repairable Code for Hadoop Distributed File System","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Distributed data store; Overhead (engineering); Code (set theory); Reliability (semiconductor); Locality; Binary number; Distributed computing; File system; Reduction (mathematics); Computational complexity theory; Distributed database; Parallel computing; Operating system; Algorithm; Arithmetic; Mathematics; Set (abstract data type)","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.00034476,0.00029692,0.0003153049,0.000412426,0.0005992482,0.0004695493,0.0005894438,0.0004189324,0.001135527],"category_scores_gemma":[0.002193478,0.00011628,0.000192434,0.0005517814,0.0004964662,0.0005970081,0.0007378848,0.0005152809,0.000366483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006319901,"about_ca_system_score_gemma":0.001488452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002514792,"about_ca_topic_score_gemma":0.002793754,"domain_scores_codex":[0.9994784,0.00009634776,0.00002961205,0.0000714273,0.000248938,0.00007526864],"domain_scores_gemma":[0.9987245,0.0003605037,0.0001210341,0.0001967915,0.0005149395,0.00008210802],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009441985,0.0002013945,0.002719285,0.0006870767,0.00005852475,0.0006766765,0.0005682905,0.3002945,0.09671617,0.1319572,0.02067676,0.4444998],"study_design_scores_gemma":[0.0000989555,0.0002848735,0.000361384,0.00006821053,0.00002571315,0.0004743594,0.00008030414,0.9308484,0.02956498,0.02413708,0.01398677,0.00006903465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0893085,0.001182807,0.9006259,0.0005610121,0.0002147631,0.0001603481,0.0003064019,0.00164888,0.005991393],"genre_scores_gemma":[0.6753197,0.0003489082,0.3182297,0.000216552,0.00004989733,0.0002357175,0.0003663806,0.0001268179,0.00510641],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002514792,"threshold_uncertainty_score":0.005000293,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02538186307851424,"score_gpt":0.2726882428469606,"score_spread":0.2473063797684464,"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."}}