{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:HINYZEE55YLBROS5H7GFXISUO4","short_pith_number":"pith:HINYZEE5","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"},"canonical_sha256":"3a1b8c909dee1618ba5d3fcc5ba2547704b44921b55dc1cdb96605162bbfe00b","source":{"kind":"arxiv","id":"2401.10688","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:HINYZEE55YLBROS5H7GFXISUO4","target":"record","payload":{"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"},"canonical_sha256":"3a1b8c909dee1618ba5d3fcc5ba2547704b44921b55dc1cdb96605162bbfe00b","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"},"source_kind":"arxiv","source_id":"2401.10688","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XhFhjmN9KesGiEKk0KtK/W4U/Gq0RCc1aT4PdlW1+iAFX3++WShUEApkf8UZuIRc96Pt5e5gkgD9mGSwgxrEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:49:14.358618Z"},"content_sha256":"0cb107f72b54b0a5219a83ba607f6719039541c8f0103f076de7c6122cd2adc4","schema_version":"1.0","event_id":"sha256:0cb107f72b54b0a5219a83ba607f6719039541c8f0103f076de7c6122cd2adc4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:HINYZEE55YLBROS5H7GFXISUO4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kl3XD31EfTpphao0xUGX0eKpDxqOve0On/CtulDg+3Jv6S5tD+sOwTSDxBrIehC2knNjDfc/jgPgwL50GxH6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:49:14.359267Z"},"content_sha256":"41ebc1aa1fce693fa5c1ec434af5cb9ec3b29e6fac37f5e4400f4253a7f762cf","schema_version":"1.0","event_id":"sha256:41ebc1aa1fce693fa5c1ec434af5cb9ec3b29e6fac37f5e4400f4253a7f762cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HINYZEE55YLBROS5H7GFXISUO4/bundle.json","state_url":"https://pith.science/pith/HINYZEE55YLBROS5H7GFXISUO4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HINYZEE55YLBROS5H7GFXISUO4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T01:49:14Z","links":{"resolver":"https://pith.science/pith/HINYZEE55YLBROS5H7GFXISUO4","bundle":"https://pith.science/pith/HINYZEE55YLBROS5H7GFXISUO4/bundle.json","state":"https://pith.science/pith/HINYZEE55YLBROS5H7GFXISUO4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HINYZEE55YLBROS5H7GFXISUO4/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AVuZWybJkpoxoC5xS5JR1Cnas3SlOV5QpcOdT9PIu0JDqxKYiiGkRj4lAXWIOIVB18UYKpzhWLqnGpB+FRiRBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T01:49:14.362068Z","bundle_sha256":"df78f90b579cb6f6d199966e95ae37b5ca3bc1b069f7865b504da5e943b86e29"}}