{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HINYZEE55YLBROS5H7GFXISUO4","short_pith_number":"pith:HINYZEE5","schema_version":"1.0","canonical_sha256":"3a1b8c909dee1618ba5d3fcc5ba2547704b44921b55dc1cdb96605162bbfe00b","source":{"kind":"arxiv","id":"2401.10688","version":2},"attestation_state":"computed","paper":{"title":"Unraveling codes: fast, robust, beyond-bound error correction for DRAM","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AR","math.IT"],"primary_cat":"cs.IT","authors_text":"Danny Moore, Eric Linstadt, Mike Hamburg, Thomas Vogelsang","submitted_at":"2024-01-19T13:34:49Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2401.10688","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2024-01-19T13:34:49Z","cross_cats_sorted":["cs.AR","math.IT"],"title_canon_sha256":"acfed593b9f8b47293c08f309e9a7ae6c3ea91eb2b8ca8f81304c64ad48222e5","abstract_canon_sha256":"43d2d63e05aa0c8d4b9ab6be37b0a5a5fa4391458ffe47a3a6ae659eca08bd29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:23:15.973795Z","signature_b64":"W0I0DHFuLF/0xPKraHTfZAYUfrN53YU6Siwyq3RCVFxrq4LShRQ5pTQlAOeKba9IDOobFy6CKxg/Ya3JFIcdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a1b8c909dee1618ba5d3fcc5ba2547704b44921b55dc1cdb96605162bbfe00b","last_reissued_at":"2026-07-05T08:23:15.973324Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:23:15.973324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unraveling codes: fast, robust, beyond-bound error correction for DRAM","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AR","math.IT"],"primary_cat":"cs.IT","authors_text":"Danny Moore, Eric Linstadt, Mike Hamburg, Thomas Vogelsang","submitted_at":"2024-01-19T13:34:49Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.10688","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.10688/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2401.10688","created_at":"2026-07-05T08:23:15.973383+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.10688v2","created_at":"2026-07-05T08:23:15.973383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.10688","created_at":"2026-07-05T08:23:15.973383+00:00"},{"alias_kind":"pith_short_12","alias_value":"HINYZEE55YLB","created_at":"2026-07-05T08:23:15.973383+00:00"},{"alias_kind":"pith_short_16","alias_value":"HINYZEE55YLBROS5","created_at":"2026-07-05T08:23:15.973383+00:00"},{"alias_kind":"pith_short_8","alias_value":"HINYZEE5","created_at":"2026-07-05T08:23:15.973383+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HINYZEE55YLBROS5H7GFXISUO4","json":"https://pith.science/pith/HINYZEE55YLBROS5H7GFXISUO4.json","graph_json":"https://pith.science/api/pith-number/HINYZEE55YLBROS5H7GFXISUO4/graph.json","events_json":"https://pith.science/api/pith-number/HINYZEE55YLBROS5H7GFXISUO4/events.json","paper":"https://pith.science/paper/HINYZEE5"},"agent_actions":{"view_html":"https://pith.science/pith/HINYZEE55YLBROS5H7GFXISUO4","download_json":"https://pith.science/pith/HINYZEE55YLBROS5H7GFXISUO4.json","view_paper":"https://pith.science/paper/HINYZEE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.10688&json=true","fetch_graph":"https://pith.science/api/pith-number/HINYZEE55YLBROS5H7GFXISUO4/graph.json","fetch_events":"https://pith.science/api/pith-number/HINYZEE55YLBROS5H7GFXISUO4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HINYZEE55YLBROS5H7GFXISUO4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HINYZEE55YLBROS5H7GFXISUO4/action/storage_attestation","attest_author":"https://pith.science/pith/HINYZEE55YLBROS5H7GFXISUO4/action/author_attestation","sign_citation":"https://pith.science/pith/HINYZEE55YLBROS5H7GFXISUO4/action/citation_signature","submit_replication":"https://pith.science/pith/HINYZEE55YLBROS5H7GFXISUO4/action/replication_record"}},"created_at":"2026-07-05T08:23:15.973383+00:00","updated_at":"2026-07-05T08:23:15.973383+00:00"}