{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HSAS4UOVFX7BJFD6GAPPOO3CDG","short_pith_number":"pith:HSAS4UOV","schema_version":"1.0","canonical_sha256":"3c812e51d52dfe14947e301ef73b6219a8c2ff031ba5881401dc5f43f2065e77","source":{"kind":"arxiv","id":"1404.5021","version":1},"attestation_state":"computed","paper":{"title":"Local Rank Modulation for Flash Memories II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michal Horovitz, Tuvi Etzion","submitted_at":"2014-04-20T06:21:25Z","abstract_excerpt":"Local rank modulation scheme was suggested recently for representing information in flash memories in order to overcome drawbacks of rank modulation. For $0 < s\\leq t\\leq n$ with $s$ divides $n$, an $(s,t,n)$-LRM scheme is a local rank modulation scheme where the $n$ cells are locally viewed cyclically through a sliding window of size $t$ resulting in a sequence of small permutations which requires less comparisons and less distinct values. The gap between two such windows equals to $s$. In this work, encoding, decoding, and asymptotic enumeration of the $(1,3,n)$-LRM scheme is studied. The te"},"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":"1404.5021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-20T06:21:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"311de9512a5f35c07060b03c07c32b6f6b8788736aaf01c6d24bf21c85431a3c","abstract_canon_sha256":"64ea6f55d7b02dc199ca498c0ad89f8825b0248bac857833a2a8aa579030a058"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:52.192849Z","signature_b64":"vsGon2OKnvY9Y7/8Qj297nDjTU39T6yOvwab4H4A6mG1ahRrjNOfUH0FL1eFJ6qwVLY8pZyWX3/+qY9ExBDVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c812e51d52dfe14947e301ef73b6219a8c2ff031ba5881401dc5f43f2065e77","last_reissued_at":"2026-05-18T02:53:52.192073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:52.192073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Rank Modulation for Flash Memories II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michal Horovitz, Tuvi Etzion","submitted_at":"2014-04-20T06:21:25Z","abstract_excerpt":"Local rank modulation scheme was suggested recently for representing information in flash memories in order to overcome drawbacks of rank modulation. For $0 < s\\leq t\\leq n$ with $s$ divides $n$, an $(s,t,n)$-LRM scheme is a local rank modulation scheme where the $n$ cells are locally viewed cyclically through a sliding window of size $t$ resulting in a sequence of small permutations which requires less comparisons and less distinct values. The gap between two such windows equals to $s$. In this work, encoding, decoding, and asymptotic enumeration of the $(1,3,n)$-LRM scheme is studied. The te"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5021","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":"1404.5021","created_at":"2026-05-18T02:53:52.192196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5021v1","created_at":"2026-05-18T02:53:52.192196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5021","created_at":"2026-05-18T02:53:52.192196+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSAS4UOVFX7B","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSAS4UOVFX7BJFD6","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSAS4UOV","created_at":"2026-05-18T12:28:30.664211+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/HSAS4UOVFX7BJFD6GAPPOO3CDG","json":"https://pith.science/pith/HSAS4UOVFX7BJFD6GAPPOO3CDG.json","graph_json":"https://pith.science/api/pith-number/HSAS4UOVFX7BJFD6GAPPOO3CDG/graph.json","events_json":"https://pith.science/api/pith-number/HSAS4UOVFX7BJFD6GAPPOO3CDG/events.json","paper":"https://pith.science/paper/HSAS4UOV"},"agent_actions":{"view_html":"https://pith.science/pith/HSAS4UOVFX7BJFD6GAPPOO3CDG","download_json":"https://pith.science/pith/HSAS4UOVFX7BJFD6GAPPOO3CDG.json","view_paper":"https://pith.science/paper/HSAS4UOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5021&json=true","fetch_graph":"https://pith.science/api/pith-number/HSAS4UOVFX7BJFD6GAPPOO3CDG/graph.json","fetch_events":"https://pith.science/api/pith-number/HSAS4UOVFX7BJFD6GAPPOO3CDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSAS4UOVFX7BJFD6GAPPOO3CDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSAS4UOVFX7BJFD6GAPPOO3CDG/action/storage_attestation","attest_author":"https://pith.science/pith/HSAS4UOVFX7BJFD6GAPPOO3CDG/action/author_attestation","sign_citation":"https://pith.science/pith/HSAS4UOVFX7BJFD6GAPPOO3CDG/action/citation_signature","submit_replication":"https://pith.science/pith/HSAS4UOVFX7BJFD6GAPPOO3CDG/action/replication_record"}},"created_at":"2026-05-18T02:53:52.192196+00:00","updated_at":"2026-05-18T02:53:52.192196+00:00"}