{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SZCHR57LMN7EXRFTBTYPS67U4C","short_pith_number":"pith:SZCHR57L","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"},"canonical_sha256":"964478f7eb637e4bc4b30cf0f97bf4e08c2173203e807ea49b0091e68ca2f941","source":{"kind":"arxiv","id":"1210.7515","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7515","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7515v1","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7515","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"SZCHR57LMN7E","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"SZCHR57LMN7EXRFT","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"SZCHR57L","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SZCHR57LMN7EXRFTBTYPS67U4C","target":"record","payload":{"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"},"canonical_sha256":"964478f7eb637e4bc4b30cf0f97bf4e08c2173203e807ea49b0091e68ca2f941","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"},"source_kind":"arxiv","source_id":"1210.7515","source_version":1,"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-05-18T03:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJVVJjh65mn34d2/BZUeeZ687MKm617Hr0Fw59IgT/b2yAjMACrrM3AhSgnmQnwlpyR6BB+lxIfscfBT7bBbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:06:37.749195Z"},"content_sha256":"84e4dc31a9333012ee71bf3fd8d53e086f77e2a8d416af84a9321e6c66fd2fff","schema_version":"1.0","event_id":"sha256:84e4dc31a9333012ee71bf3fd8d53e086f77e2a8d416af84a9321e6c66fd2fff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SZCHR57LMN7EXRFTBTYPS67U4C","target":"graph","payload":{"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"},"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-05-18T03:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"exVgEvcLk/z81s7L7eNNSnAuoDtYVF2ajjbrDH3s4frvnEjFaXuUSqkVvbmbTi37302ri/iDdZ6+YP7hzdodBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:06:37.749559Z"},"content_sha256":"48cc0add2badb9ba8d66bc97a3fca0da6e4a451b0ab709dd6862944d3f70bea2","schema_version":"1.0","event_id":"sha256:48cc0add2badb9ba8d66bc97a3fca0da6e4a451b0ab709dd6862944d3f70bea2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZCHR57LMN7EXRFTBTYPS67U4C/bundle.json","state_url":"https://pith.science/pith/SZCHR57LMN7EXRFTBTYPS67U4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZCHR57LMN7EXRFTBTYPS67U4C/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-06-01T21:06:37Z","links":{"resolver":"https://pith.science/pith/SZCHR57LMN7EXRFTBTYPS67U4C","bundle":"https://pith.science/pith/SZCHR57LMN7EXRFTBTYPS67U4C/bundle.json","state":"https://pith.science/pith/SZCHR57LMN7EXRFTBTYPS67U4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZCHR57LMN7EXRFTBTYPS67U4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SZCHR57LMN7EXRFTBTYPS67U4C","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":"ca404d0bceab42da46f571eb74e3fa93dcee2ec619e5e5b14d4d6a6a71860d5e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-28T21:33:42Z","title_canon_sha256":"16fdce59cee1ad15aade4c6e527f21af42e7a9e7c85e744d4b9808da5d761671"},"schema_version":"1.0","source":{"id":"1210.7515","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7515","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7515v1","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7515","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"SZCHR57LMN7E","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"SZCHR57LMN7EXRFT","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"SZCHR57L","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:48cc0add2badb9ba8d66bc97a3fca0da6e4a451b0ab709dd6862944d3f70bea2","target":"graph","created_at":"2026-05-18T03:42:09Z","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"},"paper":{"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 ","authors_text":"Alexander Vardy, Eitan Yaakobi, Hessam Mahdavifar, Jack K. Wolf, Paul H. Siegel","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-28T21:33:42Z","title":"Rewriting Codes for Flash Memories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7515","kind":"arxiv","version":1},"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:84e4dc31a9333012ee71bf3fd8d53e086f77e2a8d416af84a9321e6c66fd2fff","target":"record","created_at":"2026-05-18T03:42:09Z","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":"ca404d0bceab42da46f571eb74e3fa93dcee2ec619e5e5b14d4d6a6a71860d5e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-28T21:33:42Z","title_canon_sha256":"16fdce59cee1ad15aade4c6e527f21af42e7a9e7c85e744d4b9808da5d761671"},"schema_version":"1.0","source":{"id":"1210.7515","kind":"arxiv","version":1}},"canonical_sha256":"964478f7eb637e4bc4b30cf0f97bf4e08c2173203e807ea49b0091e68ca2f941","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"964478f7eb637e4bc4b30cf0f97bf4e08c2173203e807ea49b0091e68ca2f941","first_computed_at":"2026-05-18T03:42:09.697278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:09.697278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O98I4hT+AVlCzEHt9SdjxQHWTsUGml1JoRxuYgZOdN/PrLV5NkW0XUTdpuOAUZY67LxmVTAjWaukTXOfoqQwDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:09.698146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.7515","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84e4dc31a9333012ee71bf3fd8d53e086f77e2a8d416af84a9321e6c66fd2fff","sha256:48cc0add2badb9ba8d66bc97a3fca0da6e4a451b0ab709dd6862944d3f70bea2"],"state_sha256":"b043cefce468121bbe9aad40a0baad241d7835b957a784af46033625dbd71711"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6fh90QnlkUaTj4Z3gupx3SertL8NQkDlCt1IeA63NJz3WXqNBC591Y/FAz0frsCHVN2nk1vuTpPOsghw4xKACA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:06:37.751603Z","bundle_sha256":"f123dce99dfe8cbd35e0ed5288ce19e87dfe15d1df0c8d197228b7d33a79eee6"}}