{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MBFMTQZUPJS2AMA3N67D6HIWM4","short_pith_number":"pith:MBFMTQZU","canonical_record":{"source":{"id":"1312.0972","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-03T22:52:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"28df6ab6334d323ac4075b909152e256b766d935f1a9dd851550cd51a3c81ead","abstract_canon_sha256":"615d4a551d5b886fbdae8d5de9b785701eba90cbfb2f98f737ee670b4031c852"},"schema_version":"1.0"},"canonical_sha256":"604ac9c3347a65a0301b6fbe3f1d166717758a68784785105a3baf8eb2718319","source":{"kind":"arxiv","id":"1312.0972","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0972","created_at":"2026-05-18T02:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0972v2","created_at":"2026-05-18T02:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0972","created_at":"2026-05-18T02:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"MBFMTQZUPJS2","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"MBFMTQZUPJS2AMA3","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"MBFMTQZU","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MBFMTQZUPJS2AMA3N67D6HIWM4","target":"record","payload":{"canonical_record":{"source":{"id":"1312.0972","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-03T22:52:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"28df6ab6334d323ac4075b909152e256b766d935f1a9dd851550cd51a3c81ead","abstract_canon_sha256":"615d4a551d5b886fbdae8d5de9b785701eba90cbfb2f98f737ee670b4031c852"},"schema_version":"1.0"},"canonical_sha256":"604ac9c3347a65a0301b6fbe3f1d166717758a68784785105a3baf8eb2718319","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:15.814724Z","signature_b64":"Qsp+qjamc2KDndCGM/E+pOgVlQpox/8Rt8KSgusV02CzY71cDEmSRThrll0fYQ+sylPSxrR0Dn7VrgZe9h6LAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"604ac9c3347a65a0301b6fbe3f1d166717758a68784785105a3baf8eb2718319","last_reissued_at":"2026-05-18T02:30:15.814236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:15.814236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.0972","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-05-18T02:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ehCI1r0vp+dQv2iztChQGA7TlkXa2lpxpALEI3b7wcI+qU1k19QHKqYStyb/G/FsRLFU6Ga1QogZtSl+hsC9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:41:26.213623Z"},"content_sha256":"a4336e2364a2c050b4561e66200530f479cbdcb3e3f8d300c603f1531f517162","schema_version":"1.0","event_id":"sha256:a4336e2364a2c050b4561e66200530f479cbdcb3e3f8d300c603f1531f517162"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MBFMTQZUPJS2AMA3N67D6HIWM4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rank-Modulation Rewrite Coding for Flash Memories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anxiao (Andrew) Jiang, Eitan Yaakobi, Eyal En Gad, Jehoshua Bruck","submitted_at":"2013-12-03T22:52:39Z","abstract_excerpt":"The current flash memory technology focuses on the cost minimization of its static storage capacity. However, the resulting approach supports a relatively small number of program-erase cycles. This technology is effective for consumer devices (e.g., smartphones and cameras) where the number of program-erase cycles is small. However, it is not economical for enterprise storage systems that require a large number of lifetime writes. The proposed approach in this paper for alleviating this problem consists of the efficient integration of two key ideas: (i) improving reliability and endurance by r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0972","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":""},"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:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FX0t5Xy0PQpW3MMHbuDfF12M3f+ZkUMTxbJhP4+kzSoycDBxO2kfx1b0HT5xK7Z+dLWlM1vlLW87TkYMkTrxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:41:26.213963Z"},"content_sha256":"9197b59f2d38a6c2b4bc2f79876f22f4ddd874047f0d2ce98535e07711f4904d","schema_version":"1.0","event_id":"sha256:9197b59f2d38a6c2b4bc2f79876f22f4ddd874047f0d2ce98535e07711f4904d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBFMTQZUPJS2AMA3N67D6HIWM4/bundle.json","state_url":"https://pith.science/pith/MBFMTQZUPJS2AMA3N67D6HIWM4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBFMTQZUPJS2AMA3N67D6HIWM4/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-05T12:41:26Z","links":{"resolver":"https://pith.science/pith/MBFMTQZUPJS2AMA3N67D6HIWM4","bundle":"https://pith.science/pith/MBFMTQZUPJS2AMA3N67D6HIWM4/bundle.json","state":"https://pith.science/pith/MBFMTQZUPJS2AMA3N67D6HIWM4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBFMTQZUPJS2AMA3N67D6HIWM4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MBFMTQZUPJS2AMA3N67D6HIWM4","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":"615d4a551d5b886fbdae8d5de9b785701eba90cbfb2f98f737ee670b4031c852","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-03T22:52:39Z","title_canon_sha256":"28df6ab6334d323ac4075b909152e256b766d935f1a9dd851550cd51a3c81ead"},"schema_version":"1.0","source":{"id":"1312.0972","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0972","created_at":"2026-05-18T02:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0972v2","created_at":"2026-05-18T02:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0972","created_at":"2026-05-18T02:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"MBFMTQZUPJS2","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"MBFMTQZUPJS2AMA3","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"MBFMTQZU","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:9197b59f2d38a6c2b4bc2f79876f22f4ddd874047f0d2ce98535e07711f4904d","target":"graph","created_at":"2026-05-18T02:30: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"},"paper":{"abstract_excerpt":"The current flash memory technology focuses on the cost minimization of its static storage capacity. However, the resulting approach supports a relatively small number of program-erase cycles. This technology is effective for consumer devices (e.g., smartphones and cameras) where the number of program-erase cycles is small. However, it is not economical for enterprise storage systems that require a large number of lifetime writes. The proposed approach in this paper for alleviating this problem consists of the efficient integration of two key ideas: (i) improving reliability and endurance by r","authors_text":"Anxiao (Andrew) Jiang, Eitan Yaakobi, Eyal En Gad, Jehoshua Bruck","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-03T22:52:39Z","title":"Rank-Modulation Rewrite Coding for Flash Memories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0972","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:a4336e2364a2c050b4561e66200530f479cbdcb3e3f8d300c603f1531f517162","target":"record","created_at":"2026-05-18T02:30: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":"615d4a551d5b886fbdae8d5de9b785701eba90cbfb2f98f737ee670b4031c852","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-03T22:52:39Z","title_canon_sha256":"28df6ab6334d323ac4075b909152e256b766d935f1a9dd851550cd51a3c81ead"},"schema_version":"1.0","source":{"id":"1312.0972","kind":"arxiv","version":2}},"canonical_sha256":"604ac9c3347a65a0301b6fbe3f1d166717758a68784785105a3baf8eb2718319","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"604ac9c3347a65a0301b6fbe3f1d166717758a68784785105a3baf8eb2718319","first_computed_at":"2026-05-18T02:30:15.814236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:15.814236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qsp+qjamc2KDndCGM/E+pOgVlQpox/8Rt8KSgusV02CzY71cDEmSRThrll0fYQ+sylPSxrR0Dn7VrgZe9h6LAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:15.814724Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0972","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4336e2364a2c050b4561e66200530f479cbdcb3e3f8d300c603f1531f517162","sha256:9197b59f2d38a6c2b4bc2f79876f22f4ddd874047f0d2ce98535e07711f4904d"],"state_sha256":"afeade0805829866d08feabe74064750aae56ea11819506dc60ee76ff7345948"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6lfpgxouQU+cjFuu8KiWPCofFkelCz3aK+teokWES1ueayePq5ktisXrnaHETbX1iO0kivqec+eb8p2xRPPsCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:41:26.215938Z","bundle_sha256":"e4c36ae714be9053ef82be02c8c4a3d7ac6a55117b89af6e4f89bd254b543ba0"}}