{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SZCHR57LMN7EXRFTBTYPS67U4C","short_pith_number":"pith:SZCHR57L","schema_version":"1.0","canonical_sha256":"964478f7eb637e4bc4b30cf0f97bf4e08c2173203e807ea49b0091e68ca2f941","source":{"kind":"arxiv","id":"1210.7515","version":1},"attestation_state":"computed","paper":{"title":"Rewriting Codes for Flash Memories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Vardy, Eitan Yaakobi, Hessam Mahdavifar, Jack K. Wolf, Paul H. Siegel","submitted_at":"2012-10-28T21:33:42Z","abstract_excerpt":"Flash memory is a non-volatile computer memory comprising blocks of cells, wherein each cell can take on q different values or levels. While increasing the cell level is easy, reducing the level of a cell can be accomplished only by erasing an entire block. Since block erasures are highly undesirable, coding schemes - known as floating codes (or flash codes) and buffer codes - have been designed in order to maximize the number of times that information stored in a flash memory can be written (and re-written) prior to incurring a block erasure.\n  An (n,k,t)q flash code C is a coding scheme for "},"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":"1210.7515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-28T21:33:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"16fdce59cee1ad15aade4c6e527f21af42e7a9e7c85e744d4b9808da5d761671","abstract_canon_sha256":"ca404d0bceab42da46f571eb74e3fa93dcee2ec619e5e5b14d4d6a6a71860d5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:09.698146Z","signature_b64":"O98I4hT+AVlCzEHt9SdjxQHWTsUGml1JoRxuYgZOdN/PrLV5NkW0XUTdpuOAUZY67LxmVTAjWaukTXOfoqQwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"964478f7eb637e4bc4b30cf0f97bf4e08c2173203e807ea49b0091e68ca2f941","last_reissued_at":"2026-05-18T03:42:09.697278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:09.697278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rewriting Codes for Flash Memories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Vardy, Eitan Yaakobi, Hessam Mahdavifar, Jack K. Wolf, Paul H. Siegel","submitted_at":"2012-10-28T21:33:42Z","abstract_excerpt":"Flash memory is a non-volatile computer memory comprising blocks of cells, wherein each cell can take on q different values or levels. While increasing the cell level is easy, reducing the level of a cell can be accomplished only by erasing an entire block. Since block erasures are highly undesirable, coding schemes - known as floating codes (or flash codes) and buffer codes - have been designed in order to maximize the number of times that information stored in a flash memory can be written (and re-written) prior to incurring a block erasure.\n  An (n,k,t)q flash code C is a coding scheme for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7515","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":"1210.7515","created_at":"2026-05-18T03:42:09.697451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.7515v1","created_at":"2026-05-18T03:42:09.697451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7515","created_at":"2026-05-18T03:42:09.697451+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZCHR57LMN7E","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZCHR57LMN7EXRFT","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZCHR57L","created_at":"2026-05-18T12:27:23.164592+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/SZCHR57LMN7EXRFTBTYPS67U4C","json":"https://pith.science/pith/SZCHR57LMN7EXRFTBTYPS67U4C.json","graph_json":"https://pith.science/api/pith-number/SZCHR57LMN7EXRFTBTYPS67U4C/graph.json","events_json":"https://pith.science/api/pith-number/SZCHR57LMN7EXRFTBTYPS67U4C/events.json","paper":"https://pith.science/paper/SZCHR57L"},"agent_actions":{"view_html":"https://pith.science/pith/SZCHR57LMN7EXRFTBTYPS67U4C","download_json":"https://pith.science/pith/SZCHR57LMN7EXRFTBTYPS67U4C.json","view_paper":"https://pith.science/paper/SZCHR57L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.7515&json=true","fetch_graph":"https://pith.science/api/pith-number/SZCHR57LMN7EXRFTBTYPS67U4C/graph.json","fetch_events":"https://pith.science/api/pith-number/SZCHR57LMN7EXRFTBTYPS67U4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZCHR57LMN7EXRFTBTYPS67U4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZCHR57LMN7EXRFTBTYPS67U4C/action/storage_attestation","attest_author":"https://pith.science/pith/SZCHR57LMN7EXRFTBTYPS67U4C/action/author_attestation","sign_citation":"https://pith.science/pith/SZCHR57LMN7EXRFTBTYPS67U4C/action/citation_signature","submit_replication":"https://pith.science/pith/SZCHR57LMN7EXRFTBTYPS67U4C/action/replication_record"}},"created_at":"2026-05-18T03:42:09.697451+00:00","updated_at":"2026-05-18T03:42:09.697451+00:00"}