{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HINYZEE55YLBROS5H7GFXISUO4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"43d2d63e05aa0c8d4b9ab6be37b0a5a5fa4391458ffe47a3a6ae659eca08bd29","cross_cats_sorted":["cs.AR","math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2024-01-19T13:34:49Z","title_canon_sha256":"acfed593b9f8b47293c08f309e9a7ae6c3ea91eb2b8ca8f81304c64ad48222e5"},"schema_version":"1.0","source":{"id":"2401.10688","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.10688","created_at":"2026-07-05T08:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"2401.10688v2","created_at":"2026-07-05T08:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.10688","created_at":"2026-07-05T08:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"HINYZEE55YLB","created_at":"2026-07-05T08:23:15Z"},{"alias_kind":"pith_short_16","alias_value":"HINYZEE55YLBROS5","created_at":"2026-07-05T08:23:15Z"},{"alias_kind":"pith_short_8","alias_value":"HINYZEE5","created_at":"2026-07-05T08:23:15Z"}],"graph_snapshots":[{"event_id":"sha256:41ebc1aa1fce693fa5c1ec434af5cb9ec3b29e6fac37f5e4400f4253a7f762cf","target":"graph","created_at":"2026-07-05T08:23:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.10688/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Generalized Reed-Solomon (RS) codes are a common choice for efficient, reliable error correction in memory and communications systems. These codes add $2t$ extra parity symbols to a block of memory, and can efficiently and reliably correct up to $t$ symbol errors in that block. Decoding is possible beyond this bound, but it is imperfectly reliable and often computationally expensive. Beyond-bound decoding is an important problem to solve for error-correcting Dynamic Random Access Memory (DRAM). These memories are often designed so that each access touches two extra memory devices, so that a fa","authors_text":"Danny Moore, Eric Linstadt, Mike Hamburg, Thomas Vogelsang","cross_cats":["cs.AR","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2024-01-19T13:34:49Z","title":"Unraveling codes: fast, robust, beyond-bound error correction for DRAM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.10688","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0cb107f72b54b0a5219a83ba607f6719039541c8f0103f076de7c6122cd2adc4","target":"record","created_at":"2026-07-05T08:23:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"43d2d63e05aa0c8d4b9ab6be37b0a5a5fa4391458ffe47a3a6ae659eca08bd29","cross_cats_sorted":["cs.AR","math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2024-01-19T13:34:49Z","title_canon_sha256":"acfed593b9f8b47293c08f309e9a7ae6c3ea91eb2b8ca8f81304c64ad48222e5"},"schema_version":"1.0","source":{"id":"2401.10688","kind":"arxiv","version":2}},"canonical_sha256":"3a1b8c909dee1618ba5d3fcc5ba2547704b44921b55dc1cdb96605162bbfe00b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a1b8c909dee1618ba5d3fcc5ba2547704b44921b55dc1cdb96605162bbfe00b","first_computed_at":"2026-07-05T08:23:15.973324Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:23:15.973324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W0I0DHFuLF/0xPKraHTfZAYUfrN53YU6Siwyq3RCVFxrq4LShRQ5pTQlAOeKba9IDOobFy6CKxg/Ya3JFIcdDA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:23:15.973795Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.10688","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cb107f72b54b0a5219a83ba607f6719039541c8f0103f076de7c6122cd2adc4","sha256:41ebc1aa1fce693fa5c1ec434af5cb9ec3b29e6fac37f5e4400f4253a7f762cf"],"state_sha256":"cf17aa59111a52d322a3d936f1845631d512302a758c69c56fc88a7106d75072"}