{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005944746,0.0005988483,0.0004816633,0.0005943255,0.0004714567,0.0005646005,0.0008964071,0.000597281,0.0009064784],"category_scores_gemma":[0.004285073,0.0002239747,0.0002428834,0.0009752366,0.0006442033,0.001212284,0.0009389664,0.0007096954,0.0005748128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005915955,"about_ca_system_score_gemma":0.001186145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001093893,"about_ca_topic_score_gemma":0.001903762,"domain_scores_codex":[0.9991407,0.0001863851,0.00007061506,0.00009803725,0.0004233632,0.00008088717],"domain_scores_gemma":[0.9966454,0.001159343,0.0005783742,0.0008533685,0.0006878793,0.00007555341],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008234279,0.0001638164,0.001779504,0.0003462223,0.00006279929,0.0004097669,0.0005388784,0.3481701,0.1731588,0.1574375,0.003606903,0.3135023],"study_design_scores_gemma":[0.00006360409,0.0002567776,0.0004297852,0.00004625258,0.00003043742,0.0005788963,0.0000673777,0.838502,0.1254469,0.02885147,0.0056768,0.00004973021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08324929,0.00043153,0.911761,0.0002626819,0.00003811682,0.0001068145,0.0001143057,0.0008521006,0.003184096],"genre_scores_gemma":[0.6010364,0.0003813512,0.3925901,0.0001097979,0.00005325867,0.0001633989,0.0002451447,0.0001065589,0.005314099],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001093893,"threshold_uncertainty_score":0.004292309,"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."}}