{"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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0004334497,0.000170792,0.0002035855,0.0001332858,0.0005798156,0.0001350826,0.00578893,0.0000771541,0.000002824107],"category_scores_gemma":[0.0001992747,0.0001739061,0.00006937013,0.0004929705,0.0002745336,0.0004260057,0.0006569237,0.0002094809,0.00004830831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002079288,"about_ca_system_score_gemma":0.00003498697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002003761,"about_ca_topic_score_gemma":0.00001688333,"domain_scores_codex":[0.9985455,0.000178382,0.0003255703,0.0004352886,0.0001715517,0.0003436627],"domain_scores_gemma":[0.9916,0.0005786745,0.0001882685,0.007428827,0.0001282814,0.00007598251],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000355882,0.0008196055,0.0001030962,0.0002008657,0.00008871064,0.0000134229,0.0005487893,0.2663165,0.06012159,0.2410322,0.4043917,0.02632795],"study_design_scores_gemma":[0.0002623587,0.00009772264,0.000108505,0.00006587901,0.000008923807,0.00001165366,0.00007805269,0.9142385,0.001407793,0.0001961204,0.08328299,0.000241525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003539346,0.00005787508,0.9851164,0.007372336,0.0001909014,0.0004215692,0.001044808,0.00216115,0.00009559252],"genre_scores_gemma":[0.5033386,0.000005271665,0.4949526,0.0007342253,0.00001920042,0.0003466577,0.0005757374,0.00001663616,0.0000111304],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6479219,"threshold_uncertainty_score":0.9995902,"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."}}