{"id":"W2159986814","doi":"10.1016/s0166-218x(99)00228-0","title":"Asymptotically optimal erasure-resilient codes for large disk arrays","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Erasure; Set (abstract data type); Reliability (semiconductor); Mathematics; Erasure code; Asymptotically optimal algorithm; Combinatorial design; Discrete mathematics; Computer science; Algorithm; Theoretical computer science; Decoding methods; Power (physics)","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.001407759,0.0008359593,0.001049039,0.0009701461,0.0009411384,0.001580826,0.001120489,0.001461916,0.00410161],"category_scores_gemma":[0.01782265,0.0005715905,0.0003420665,0.001057517,0.00170778,0.002796078,0.002519642,0.001703382,0.0008364461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001590999,"about_ca_system_score_gemma":0.001937389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001249834,"about_ca_topic_score_gemma":0.002038784,"domain_scores_codex":[0.9983811,0.0004419172,0.00007206557,0.0002259773,0.0004831231,0.0003957601],"domain_scores_gemma":[0.9892505,0.007586889,0.0006994891,0.001292086,0.000864596,0.0003063302],"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.001120019,0.0001612903,0.0009464045,0.0002991901,0.000075381,0.000203034,0.0002801011,0.6158384,0.01481969,0.3112085,0.009883186,0.04516471],"study_design_scores_gemma":[0.00007208145,0.0000915269,0.0003449298,0.0000463823,0.0000263358,0.000147647,0.00009448949,0.7579944,0.006317417,0.2332697,0.001557634,0.00003755021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3810242,0.003114434,0.5735638,0.004491222,0.0003546258,0.0001233309,0.0008749928,0.002042196,0.03441115],"genre_scores_gemma":[0.9530954,0.0008623288,0.03892949,0.0003298048,0.0001677843,0.0001088833,0.0002195938,0.0001413719,0.006145411],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00410161,"threshold_uncertainty_score":0.01372123,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01260932267495522,"score_gpt":0.2590491422078882,"score_spread":0.246439819532933,"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."}}