{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:WGNTIUYF6YXBBZ6GECITHSZS3X","short_pith_number":"pith:WGNTIUYF","canonical_record":{"source":{"id":"0901.0702","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-06T20:39:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1a774e40a0d75cad2f04b9fe30a5c4089d7c82cacc8746d6ccbaf8f5c77de29b","abstract_canon_sha256":"7b1ed5ffc7247ec4ba4df6bdf07b743d2ac33d5650b6ff21f8a498396390bd44"},"schema_version":"1.0"},"canonical_sha256":"b19b345305f62e10e7c6209133cb32dde66d955b3219e26871b78ab8f8f40209","source":{"kind":"arxiv","id":"0901.0702","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.0702","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"arxiv_version","alias_value":"0901.0702v3","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.0702","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"pith_short_12","alias_value":"WGNTIUYF6YXB","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"WGNTIUYF6YXBBZ6G","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"WGNTIUYF","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:WGNTIUYF6YXBBZ6GECITHSZS3X","target":"record","payload":{"canonical_record":{"source":{"id":"0901.0702","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-06T20:39:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1a774e40a0d75cad2f04b9fe30a5c4089d7c82cacc8746d6ccbaf8f5c77de29b","abstract_canon_sha256":"7b1ed5ffc7247ec4ba4df6bdf07b743d2ac33d5650b6ff21f8a498396390bd44"},"schema_version":"1.0"},"canonical_sha256":"b19b345305f62e10e7c6209133cb32dde66d955b3219e26871b78ab8f8f40209","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:56.610890Z","signature_b64":"SUqRXQVYWpeXFPYMMikLVfqO+rvVDEOwo9G9spO8H87JnO/CM2lZ2E24QNtTwE/lTp3CP7LT7DSJuA2X1UsYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b19b345305f62e10e7c6209133cb32dde66d955b3219e26871b78ab8f8f40209","last_reissued_at":"2026-05-18T02:24:56.610232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:56.610232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0901.0702","source_version":3,"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-18T02:24:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vtg2jYjoF0ru9L27b5h+5s8GoBE4oHXxHcneKYKbjkZGngGD5TSA5CvO9FHz5i5PoziZ4oIGselG3RcVOtXdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:16:51.797292Z"},"content_sha256":"dc24d4b73206366232a7e9ededa05277d2f34889744b154219c8f8b53126f527","schema_version":"1.0","event_id":"sha256:dc24d4b73206366232a7e9ededa05277d2f34889744b154219c8f8b53126f527"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:WGNTIUYF6YXBBZ6GECITHSZS3X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multidimensional Flash Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Vardy, Eitan Yaakobi, Jack K. Wolf, Paul H. Siegel","submitted_at":"2009-01-06T20:39:03Z","abstract_excerpt":"Flash memory is a non-volatile computer memory comprised of blocks of cells, wherein each cell can take on q different levels corresponding to the number of electrons it contains. Increasing the cell level is easy; however, reducing a cell level forces all the other cells in the same block to be erased. This erasing operation is undesirable and therefore has to be used as infrequently as possible. We consider the problem of designing codes for this purpose, where k bits are stored using a block of n cells with q levels each. The goal is to maximize the number of bit writes before an erase oper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.0702","kind":"arxiv","version":3},"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-18T02:24:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KpkDWil2/GiWq74zXUFV7ZdueyfWVbi4vsYqz7R8cDKH1rQPXa64Kdz+b3fjgnLXOaAF/hOsHiYTEIXaGBqKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:16:51.797949Z"},"content_sha256":"855ce2222cb1196b0f00f536398ff33f1bb704d8ec19808a13f4c099a146a862","schema_version":"1.0","event_id":"sha256:855ce2222cb1196b0f00f536398ff33f1bb704d8ec19808a13f4c099a146a862"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WGNTIUYF6YXBBZ6GECITHSZS3X/bundle.json","state_url":"https://pith.science/pith/WGNTIUYF6YXBBZ6GECITHSZS3X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WGNTIUYF6YXBBZ6GECITHSZS3X/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-05T05:16:51Z","links":{"resolver":"https://pith.science/pith/WGNTIUYF6YXBBZ6GECITHSZS3X","bundle":"https://pith.science/pith/WGNTIUYF6YXBBZ6GECITHSZS3X/bundle.json","state":"https://pith.science/pith/WGNTIUYF6YXBBZ6GECITHSZS3X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WGNTIUYF6YXBBZ6GECITHSZS3X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:WGNTIUYF6YXBBZ6GECITHSZS3X","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":"7b1ed5ffc7247ec4ba4df6bdf07b743d2ac33d5650b6ff21f8a498396390bd44","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-06T20:39:03Z","title_canon_sha256":"1a774e40a0d75cad2f04b9fe30a5c4089d7c82cacc8746d6ccbaf8f5c77de29b"},"schema_version":"1.0","source":{"id":"0901.0702","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.0702","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"arxiv_version","alias_value":"0901.0702v3","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.0702","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"pith_short_12","alias_value":"WGNTIUYF6YXB","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"WGNTIUYF6YXBBZ6G","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"WGNTIUYF","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:855ce2222cb1196b0f00f536398ff33f1bb704d8ec19808a13f4c099a146a862","target":"graph","created_at":"2026-05-18T02:24:56Z","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 comprised of blocks of cells, wherein each cell can take on q different levels corresponding to the number of electrons it contains. Increasing the cell level is easy; however, reducing a cell level forces all the other cells in the same block to be erased. This erasing operation is undesirable and therefore has to be used as infrequently as possible. We consider the problem of designing codes for this purpose, where k bits are stored using a block of n cells with q levels each. The goal is to maximize the number of bit writes before an erase oper","authors_text":"Alexander Vardy, Eitan Yaakobi, 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":"2009-01-06T20:39:03Z","title":"Multidimensional Flash Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.0702","kind":"arxiv","version":3},"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:dc24d4b73206366232a7e9ededa05277d2f34889744b154219c8f8b53126f527","target":"record","created_at":"2026-05-18T02:24:56Z","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":"7b1ed5ffc7247ec4ba4df6bdf07b743d2ac33d5650b6ff21f8a498396390bd44","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-06T20:39:03Z","title_canon_sha256":"1a774e40a0d75cad2f04b9fe30a5c4089d7c82cacc8746d6ccbaf8f5c77de29b"},"schema_version":"1.0","source":{"id":"0901.0702","kind":"arxiv","version":3}},"canonical_sha256":"b19b345305f62e10e7c6209133cb32dde66d955b3219e26871b78ab8f8f40209","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b19b345305f62e10e7c6209133cb32dde66d955b3219e26871b78ab8f8f40209","first_computed_at":"2026-05-18T02:24:56.610232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:56.610232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SUqRXQVYWpeXFPYMMikLVfqO+rvVDEOwo9G9spO8H87JnO/CM2lZ2E24QNtTwE/lTp3CP7LT7DSJuA2X1UsYAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:56.610890Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.0702","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc24d4b73206366232a7e9ededa05277d2f34889744b154219c8f8b53126f527","sha256:855ce2222cb1196b0f00f536398ff33f1bb704d8ec19808a13f4c099a146a862"],"state_sha256":"ae9ebcff6185fa54b7745440cd376f9c7060c197addf026edaa5d760eae913a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"byfoN4Pd3XKEzCF+D89fuA16QUFpoNok/Rkwt/cgwfUZ9+WeTR4bJo9t/ry3qK7Y87SJc3uceuuSWPkgz5gaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:16:51.801101Z","bundle_sha256":"e33686ba24d0e1d02e20ecd41b65cf6bb35dc052cf1aa17f5d7b5c8b049a0c59"}}