{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MBFMTQZUPJS2AMA3N67D6HIWM4","short_pith_number":"pith:MBFMTQZU","schema_version":"1.0","canonical_sha256":"604ac9c3347a65a0301b6fbe3f1d166717758a68784785105a3baf8eb2718319","source":{"kind":"arxiv","id":"1312.0972","version":2},"attestation_state":"computed","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"},"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.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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.0972","created_at":"2026-05-18T02:30:15.814324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0972v2","created_at":"2026-05-18T02:30:15.814324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0972","created_at":"2026-05-18T02:30:15.814324+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBFMTQZUPJS2","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBFMTQZUPJS2AMA3","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBFMTQZU","created_at":"2026-05-18T12:27:51.066281+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/MBFMTQZUPJS2AMA3N67D6HIWM4","json":"https://pith.science/pith/MBFMTQZUPJS2AMA3N67D6HIWM4.json","graph_json":"https://pith.science/api/pith-number/MBFMTQZUPJS2AMA3N67D6HIWM4/graph.json","events_json":"https://pith.science/api/pith-number/MBFMTQZUPJS2AMA3N67D6HIWM4/events.json","paper":"https://pith.science/paper/MBFMTQZU"},"agent_actions":{"view_html":"https://pith.science/pith/MBFMTQZUPJS2AMA3N67D6HIWM4","download_json":"https://pith.science/pith/MBFMTQZUPJS2AMA3N67D6HIWM4.json","view_paper":"https://pith.science/paper/MBFMTQZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0972&json=true","fetch_graph":"https://pith.science/api/pith-number/MBFMTQZUPJS2AMA3N67D6HIWM4/graph.json","fetch_events":"https://pith.science/api/pith-number/MBFMTQZUPJS2AMA3N67D6HIWM4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBFMTQZUPJS2AMA3N67D6HIWM4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBFMTQZUPJS2AMA3N67D6HIWM4/action/storage_attestation","attest_author":"https://pith.science/pith/MBFMTQZUPJS2AMA3N67D6HIWM4/action/author_attestation","sign_citation":"https://pith.science/pith/MBFMTQZUPJS2AMA3N67D6HIWM4/action/citation_signature","submit_replication":"https://pith.science/pith/MBFMTQZUPJS2AMA3N67D6HIWM4/action/replication_record"}},"created_at":"2026-05-18T02:30:15.814324+00:00","updated_at":"2026-05-18T02:30:15.814324+00:00"}