{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003166123,0.0003126086,0.0004023319,0.00007370698,0.0002306443,0.0001738032,0.001596391,0.0001394276,0.00006481917],"category_scores_gemma":[0.0001103052,0.0002649027,0.000108672,0.0002805401,0.0001178393,0.000319982,0.0003439101,0.0001915723,0.0001899964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005315533,"about_ca_system_score_gemma":0.00003625292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.473928e-7,"about_ca_topic_score_gemma":0.00000222075,"domain_scores_codex":[0.9979092,0.000008735515,0.0004454157,0.0005789584,0.0003953944,0.0006622563],"domain_scores_gemma":[0.9980015,0.0002812757,0.0001314816,0.001423518,0.00005248247,0.0001098117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000013982,0.0001573294,0.000001922858,0.00008199728,0.00002868315,0.000004241563,0.000564088,0.001036316,0.001816902,0.98505,0.0008029517,0.01044165],"study_design_scores_gemma":[0.001873413,0.0002582022,0.00004256598,0.00009505995,0.00007786235,0.00002746271,0.0008363012,0.2827304,0.02558554,0.6611297,0.02603408,0.001309496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006015046,0.00005027807,0.9848158,0.0003249618,0.00005289374,0.0007688935,0.0001373828,0.0009580677,0.006876667],"genre_scores_gemma":[0.1507243,0.0000283367,0.848497,0.0001512286,0.00003559679,0.0002616187,0.00003872824,0.00003522797,0.0002279479],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3239203,"threshold_uncertainty_score":0.9999803,"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."}}