{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BGFMZLEXPYVODXZWWMBUYM3AE3","short_pith_number":"pith:BGFMZLEX","schema_version":"1.0","canonical_sha256":"098accac977e2ae1df36b3034c336026edb376d125e219e38e97b436ac87d1db","source":{"kind":"arxiv","id":"1312.6101","version":1},"attestation_state":"computed","paper":{"title":"Concatenated Raptor Codes in NAND Flash Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Geunyeong Yu, Jaekyun Moon","submitted_at":"2013-12-20T20:31:47Z","abstract_excerpt":"Two concatenated coding schemes based on fixed-rate Raptor codes are proposed for error control in NAND flash memory. One is geared for off-line recovery of uncorrectable pages and the other is designed for page error correction during the normal read mode. Both proposed coding strategies assume hard-decision decoding of the inner code with inner decoding failure generating erasure symbols for the outer Raptor code. Raptor codes allow low-complexity decoding of very long codewords while providing capacity- approaching performance for erasure channels. For the off-line page recovery scheme, one"},"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":"1312.6101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-20T20:31:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dadea821335c977268fabc64bd4e32341ede4ced2850a0c0e37cd0be7820b38b","abstract_canon_sha256":"26ed663d76b0a3efb3a65aef9cb33d6808b57c282124506c9c0eec5f5ea5e984"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:07.138943Z","signature_b64":"r/agAerbtYKU9/G+Ql6k1TjrbFkxeT8GOFpTvEAS2zFd10h8ZKwCXsBiaMlDFXokOMEjuNKPLMAOpmD/M+oUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"098accac977e2ae1df36b3034c336026edb376d125e219e38e97b436ac87d1db","last_reissued_at":"2026-05-18T03:04:07.138463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:07.138463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concatenated Raptor Codes in NAND Flash Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Geunyeong Yu, Jaekyun Moon","submitted_at":"2013-12-20T20:31:47Z","abstract_excerpt":"Two concatenated coding schemes based on fixed-rate Raptor codes are proposed for error control in NAND flash memory. One is geared for off-line recovery of uncorrectable pages and the other is designed for page error correction during the normal read mode. Both proposed coding strategies assume hard-decision decoding of the inner code with inner decoding failure generating erasure symbols for the outer Raptor code. Raptor codes allow low-complexity decoding of very long codewords while providing capacity- approaching performance for erasure channels. For the off-line page recovery scheme, one"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6101","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1312.6101","created_at":"2026-05-18T03:04:07.138533+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6101v1","created_at":"2026-05-18T03:04:07.138533+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6101","created_at":"2026-05-18T03:04:07.138533+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGFMZLEXPYVO","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGFMZLEXPYVODXZW","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGFMZLEX","created_at":"2026-05-18T12:27:38.830355+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/BGFMZLEXPYVODXZWWMBUYM3AE3","json":"https://pith.science/pith/BGFMZLEXPYVODXZWWMBUYM3AE3.json","graph_json":"https://pith.science/api/pith-number/BGFMZLEXPYVODXZWWMBUYM3AE3/graph.json","events_json":"https://pith.science/api/pith-number/BGFMZLEXPYVODXZWWMBUYM3AE3/events.json","paper":"https://pith.science/paper/BGFMZLEX"},"agent_actions":{"view_html":"https://pith.science/pith/BGFMZLEXPYVODXZWWMBUYM3AE3","download_json":"https://pith.science/pith/BGFMZLEXPYVODXZWWMBUYM3AE3.json","view_paper":"https://pith.science/paper/BGFMZLEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6101&json=true","fetch_graph":"https://pith.science/api/pith-number/BGFMZLEXPYVODXZWWMBUYM3AE3/graph.json","fetch_events":"https://pith.science/api/pith-number/BGFMZLEXPYVODXZWWMBUYM3AE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGFMZLEXPYVODXZWWMBUYM3AE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGFMZLEXPYVODXZWWMBUYM3AE3/action/storage_attestation","attest_author":"https://pith.science/pith/BGFMZLEXPYVODXZWWMBUYM3AE3/action/author_attestation","sign_citation":"https://pith.science/pith/BGFMZLEXPYVODXZWWMBUYM3AE3/action/citation_signature","submit_replication":"https://pith.science/pith/BGFMZLEXPYVODXZWWMBUYM3AE3/action/replication_record"}},"created_at":"2026-05-18T03:04:07.138533+00:00","updated_at":"2026-05-18T03:04:07.138533+00:00"}