{"id":"W2950916997","doi":"10.48550/arxiv.1301.4620","title":"Update-Efficient Error-Correcting Product-Matrix Codes","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":"National Science Council; McMaster University; Syracuse University; National Science Foundation","keywords":"Generator matrix; Computer science; Decoding methods; Overhead (engineering); Encoding (memory); Node (physics); Algorithm; Error detection and correction; Code (set theory); Parity-check matrix; List decoding; Matrix (chemical analysis); Concatenated error correction code; Theoretical computer science; Block code; Low-density parity-check code; Engineering","routes":{"ca_aff":true,"ca_fund":true,"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","open_science"],"consensus_categories":[],"category_scores_codex":[0.0003093816,0.0005292939,0.0005095493,0.0004971135,0.0002945506,0.0002449104,0.004849061,0.0003332056,0.0000369872],"category_scores_gemma":[0.0002740461,0.0005837016,0.000182159,0.001062125,0.0002871956,0.0007200437,0.009070998,0.001171656,0.0006575509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004383891,"about_ca_system_score_gemma":0.0002014316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001669363,"about_ca_topic_score_gemma":0.00002229435,"domain_scores_codex":[0.996536,0.0001163237,0.0003132098,0.0021829,0.0001689818,0.0006826415],"domain_scores_gemma":[0.9953973,0.000130548,0.0005114372,0.003532947,0.0002803683,0.0001474036],"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.00001173092,0.0001437326,0.0006536585,0.000109581,0.000078323,0.000381321,0.0002266121,0.7855262,0.0001259759,0.2035341,0.002156213,0.007052629],"study_design_scores_gemma":[0.0003671705,0.00004897622,0.0002310952,0.0001627416,0.0000620336,0.00003461615,0.0003659041,0.9228221,0.003074055,0.06908422,0.002505976,0.00124116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2697111,0.0002308638,0.7255718,0.0002222912,0.001225573,0.0005205462,0.00002912721,0.001964781,0.000523974],"genre_scores_gemma":[0.9627222,0.00009904378,0.03594227,0.00004943079,0.0000736029,0.000004771168,0.00003280101,0.00003137703,0.001044459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6930112,"threshold_uncertainty_score":0.9996614,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05702923737308562,"score_gpt":0.2131572886947251,"score_spread":0.1561280513216395,"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."}}