{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DARDKMWLKFCMBWKDNID5WCUAR5","short_pith_number":"pith:DARDKMWL","schema_version":"1.0","canonical_sha256":"18223532cb5144c0d9436a07db0a808f535bdcf64fab9776aa853143c32f9c33","source":{"kind":"arxiv","id":"1311.4864","version":1},"attestation_state":"computed","paper":{"title":"Local Rank Modulation for Flash Memories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michal Horovitz","submitted_at":"2013-11-19T20:29:42Z","abstract_excerpt":"Local rank modulation scheme was suggested recently for representing information in flash memories in order to overcome drawbacks of rank modulation. For $s\\leq t\\leq n$ with $s|n$, $(s,t,n)$-LRM scheme is a local rank modulation scheme where the $n$ cells are locally viewed through a sliding window of size $t$ resulting in a sequence of small permutations which requires less comparisons and less distinct values. The distance between two windows equals to $s$. To get the simplest hardware implementation the case of sliding window of size two was presented. Gray codes and constant weight Gray c"},"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":"1311.4864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-19T20:29:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a3c2ce4a48ce0dbc9b819636688a0e1d24f4fcf5f3e4522a06efc90a0dd379ef","abstract_canon_sha256":"c9abc7fd479f4a973ae4985ffb64c2e3352a5797e8e50b0b1fa9d02ca3b21ffa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:43.318328Z","signature_b64":"0/6CC4EgXKTC1VVkHc4uI/GCf+2FG8x0ut/1eiHTWC7GeHngbGb0VSo2wBpvEXsYUUvuoPmXAnjdEGHukTVbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18223532cb5144c0d9436a07db0a808f535bdcf64fab9776aa853143c32f9c33","last_reissued_at":"2026-05-18T03:06:43.317914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:43.317914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Rank Modulation for Flash Memories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michal Horovitz","submitted_at":"2013-11-19T20:29:42Z","abstract_excerpt":"Local rank modulation scheme was suggested recently for representing information in flash memories in order to overcome drawbacks of rank modulation. For $s\\leq t\\leq n$ with $s|n$, $(s,t,n)$-LRM scheme is a local rank modulation scheme where the $n$ cells are locally viewed through a sliding window of size $t$ resulting in a sequence of small permutations which requires less comparisons and less distinct values. The distance between two windows equals to $s$. To get the simplest hardware implementation the case of sliding window of size two was presented. Gray codes and constant weight Gray c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4864","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":"1311.4864","created_at":"2026-05-18T03:06:43.317978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.4864v1","created_at":"2026-05-18T03:06:43.317978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4864","created_at":"2026-05-18T03:06:43.317978+00:00"},{"alias_kind":"pith_short_12","alias_value":"DARDKMWLKFCM","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"DARDKMWLKFCMBWKD","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"DARDKMWL","created_at":"2026-05-18T12:27:40.988391+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/DARDKMWLKFCMBWKDNID5WCUAR5","json":"https://pith.science/pith/DARDKMWLKFCMBWKDNID5WCUAR5.json","graph_json":"https://pith.science/api/pith-number/DARDKMWLKFCMBWKDNID5WCUAR5/graph.json","events_json":"https://pith.science/api/pith-number/DARDKMWLKFCMBWKDNID5WCUAR5/events.json","paper":"https://pith.science/paper/DARDKMWL"},"agent_actions":{"view_html":"https://pith.science/pith/DARDKMWLKFCMBWKDNID5WCUAR5","download_json":"https://pith.science/pith/DARDKMWLKFCMBWKDNID5WCUAR5.json","view_paper":"https://pith.science/paper/DARDKMWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.4864&json=true","fetch_graph":"https://pith.science/api/pith-number/DARDKMWLKFCMBWKDNID5WCUAR5/graph.json","fetch_events":"https://pith.science/api/pith-number/DARDKMWLKFCMBWKDNID5WCUAR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DARDKMWLKFCMBWKDNID5WCUAR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DARDKMWLKFCMBWKDNID5WCUAR5/action/storage_attestation","attest_author":"https://pith.science/pith/DARDKMWLKFCMBWKDNID5WCUAR5/action/author_attestation","sign_citation":"https://pith.science/pith/DARDKMWLKFCMBWKDNID5WCUAR5/action/citation_signature","submit_replication":"https://pith.science/pith/DARDKMWLKFCMBWKDNID5WCUAR5/action/replication_record"}},"created_at":"2026-05-18T03:06:43.317978+00:00","updated_at":"2026-05-18T03:06:43.317978+00:00"}