{"id":"W2950739896","doi":"10.48550/arxiv.1301.2497","title":"Update-Efficient Regenerating Codes with Minimum Per-Node Storage","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Node (physics); Overhead (engineering); Decoding methods; Generator matrix; Encoding (memory); Code (set theory); Algorithm; Diagonal; Scheme (mathematics); Distributed data store; Error detection and correction; Matrix (chemical analysis); Parity-check matrix; Mathematics; Distributed computing; Low-density parity-check code; Set (abstract data type); Engineering","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.0002019199,0.0005574536,0.000499501,0.0003830846,0.0003191204,0.0002908438,0.003865316,0.0003750244,0.00003570055],"category_scores_gemma":[0.00006279875,0.0005422509,0.0001235923,0.0006592241,0.0003676345,0.0006326156,0.00550811,0.0009257942,0.000247826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003949737,"about_ca_system_score_gemma":0.0002215601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001078537,"about_ca_topic_score_gemma":0.00003976616,"domain_scores_codex":[0.9969001,0.0001161087,0.0002581103,0.001904372,0.0001936398,0.0006276885],"domain_scores_gemma":[0.9958461,0.0001020623,0.0004478927,0.003183127,0.0002538989,0.0001669415],"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.00001152824,0.00007298147,0.0002098651,0.00004435338,0.00005186322,0.0003451362,0.0001256276,0.7852246,0.0001350661,0.2122473,0.0006850803,0.0008466198],"study_design_scores_gemma":[0.0004788165,0.00009356196,0.0001420207,0.0001614675,0.00005380306,0.00002182558,0.0002981278,0.9870877,0.001413452,0.008205163,0.001040169,0.001003864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3420317,0.0001784675,0.6555142,0.0001581117,0.0002631841,0.0003208176,0.0000431833,0.001017537,0.000472762],"genre_scores_gemma":[0.9019088,0.0001100015,0.09717662,0.000105488,0.00004618954,0.000005315903,0.00004787383,0.00003515888,0.0005645174],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5598771,"threshold_uncertainty_score":0.9997029,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04407147171279695,"score_gpt":0.1858044949723228,"score_spread":0.1417330232595259,"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."}}