{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HSAS4UOVFX7BJFD6GAPPOO3CDG","short_pith_number":"pith:HSAS4UOV","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"},"canonical_sha256":"3c812e51d52dfe14947e301ef73b6219a8c2ff031ba5881401dc5f43f2065e77","source":{"kind":"arxiv","id":"1404.5021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5021","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5021v1","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5021","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"HSAS4UOVFX7B","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HSAS4UOVFX7BJFD6","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HSAS4UOV","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HSAS4UOVFX7BJFD6GAPPOO3CDG","target":"record","payload":{"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"},"canonical_sha256":"3c812e51d52dfe14947e301ef73b6219a8c2ff031ba5881401dc5f43f2065e77","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"},"source_kind":"arxiv","source_id":"1404.5021","source_version":1,"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:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XVV+bEfA6+IlKZeBhYfMcHxXPqqvn4eD3g48bMKNIndxiv2tNbhEF9PwPsyVUighj3OuKQl6PmJf+tGtfdCSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:37:39.478240Z"},"content_sha256":"05a23b2a1a47ebed9e5931009cb505618855d7255e1d79aeb0b814f5d358feed","schema_version":"1.0","event_id":"sha256:05a23b2a1a47ebed9e5931009cb505618855d7255e1d79aeb0b814f5d358feed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HSAS4UOVFX7BJFD6GAPPOO3CDG","target":"graph","payload":{"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"},"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:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hn34XtHwtkD29MEaKh7oFvfOtyQYEnt61SbZz5wPCLTwdwMGoz657sc4ckd/FL/B6YFWoVerWsDFsFQCsNfPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:37:39.478931Z"},"content_sha256":"234b160cadafac8c27f8ebe59cbf2043529d04d921cf53a0176aee9939762ed4","schema_version":"1.0","event_id":"sha256:234b160cadafac8c27f8ebe59cbf2043529d04d921cf53a0176aee9939762ed4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HSAS4UOVFX7BJFD6GAPPOO3CDG/bundle.json","state_url":"https://pith.science/pith/HSAS4UOVFX7BJFD6GAPPOO3CDG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HSAS4UOVFX7BJFD6GAPPOO3CDG/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-05-29T23:37:39Z","links":{"resolver":"https://pith.science/pith/HSAS4UOVFX7BJFD6GAPPOO3CDG","bundle":"https://pith.science/pith/HSAS4UOVFX7BJFD6GAPPOO3CDG/bundle.json","state":"https://pith.science/pith/HSAS4UOVFX7BJFD6GAPPOO3CDG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HSAS4UOVFX7BJFD6GAPPOO3CDG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HSAS4UOVFX7BJFD6GAPPOO3CDG","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":"64ea6f55d7b02dc199ca498c0ad89f8825b0248bac857833a2a8aa579030a058","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-20T06:21:25Z","title_canon_sha256":"311de9512a5f35c07060b03c07c32b6f6b8788736aaf01c6d24bf21c85431a3c"},"schema_version":"1.0","source":{"id":"1404.5021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5021","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5021v1","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5021","created_at":"2026-05-18T02:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"HSAS4UOVFX7B","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HSAS4UOVFX7BJFD6","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HSAS4UOV","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:234b160cadafac8c27f8ebe59cbf2043529d04d921cf53a0176aee9939762ed4","target":"graph","created_at":"2026-05-18T02:53:52Z","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":"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","authors_text":"Michal Horovitz, Tuvi Etzion","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-20T06:21:25Z","title":"Local Rank Modulation for Flash Memories II"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5021","kind":"arxiv","version":1},"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:05a23b2a1a47ebed9e5931009cb505618855d7255e1d79aeb0b814f5d358feed","target":"record","created_at":"2026-05-18T02:53:52Z","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":"64ea6f55d7b02dc199ca498c0ad89f8825b0248bac857833a2a8aa579030a058","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-20T06:21:25Z","title_canon_sha256":"311de9512a5f35c07060b03c07c32b6f6b8788736aaf01c6d24bf21c85431a3c"},"schema_version":"1.0","source":{"id":"1404.5021","kind":"arxiv","version":1}},"canonical_sha256":"3c812e51d52dfe14947e301ef73b6219a8c2ff031ba5881401dc5f43f2065e77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c812e51d52dfe14947e301ef73b6219a8c2ff031ba5881401dc5f43f2065e77","first_computed_at":"2026-05-18T02:53:52.192073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:52.192073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vsGon2OKnvY9Y7/8Qj297nDjTU39T6yOvwab4H4A6mG1ahRrjNOfUH0FL1eFJ6qwVLY8pZyWX3/+qY9ExBDVAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:52.192849Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05a23b2a1a47ebed9e5931009cb505618855d7255e1d79aeb0b814f5d358feed","sha256:234b160cadafac8c27f8ebe59cbf2043529d04d921cf53a0176aee9939762ed4"],"state_sha256":"998e7dc3e20888a3298feb9bc5513d89b8838f634ed9e1cbb3f8f85a48d047ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fABLb70ejkhtaIl699uLS19oUw0hQ2Sd7hsQ281tfAWttOrROqwMDtDQOh0sVdJhfJswHcLS0G6cYSXTsg8sBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T23:37:39.482638Z","bundle_sha256":"2c3bb2f19105014a0012221e3e371fbd750db516f9f577046594ef8214a9d6e5"}}