{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LSY6V5ETAXQF57JJSSEGMBU3NB","short_pith_number":"pith:LSY6V5ET","canonical_record":{"source":{"id":"1401.4484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-17T22:12:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e196ed6bc7ebb5f8fdb4a13ddbbc1b2312c2b6953ae34bc833e70ddfc41a13f1","abstract_canon_sha256":"b8dca1975b08bec52d35ce2528828285c55e1dae5c40cb6febd69606f8258c18"},"schema_version":"1.0"},"canonical_sha256":"5cb1eaf49305e05efd29948866069b68654e2ee0abfa7fcde7dd9ffe0269f020","source":{"kind":"arxiv","id":"1401.4484","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4484","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4484v1","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4484","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"LSY6V5ETAXQF","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LSY6V5ETAXQF57JJ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LSY6V5ET","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LSY6V5ETAXQF57JJSSEGMBU3NB","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-17T22:12:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e196ed6bc7ebb5f8fdb4a13ddbbc1b2312c2b6953ae34bc833e70ddfc41a13f1","abstract_canon_sha256":"b8dca1975b08bec52d35ce2528828285c55e1dae5c40cb6febd69606f8258c18"},"schema_version":"1.0"},"canonical_sha256":"5cb1eaf49305e05efd29948866069b68654e2ee0abfa7fcde7dd9ffe0269f020","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:45.564121Z","signature_b64":"sVzpK+Xda8tSLcJsnKvhebrK6NqMb1SP2LqlMha1sC+pYLITl0irxUdPgNqL0at4uPTmB51Xv81pG8vOtFk9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cb1eaf49305e05efd29948866069b68654e2ee0abfa7fcde7dd9ffe0269f020","last_reissued_at":"2026-05-18T03:01:45.563423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:45.563423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4484","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-18T03:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YYyhR8TqTU5EQu6MpMLI1KTqu4I6Ieu1cxHKoLkDKOlcVFNIeNfKsfrTspnbKBVPjYdET+omPEnlMQ7+MeCpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:39:40.572532Z"},"content_sha256":"9399a81e9dda27209047a0fa7750582e433f61e010f45351042a1d6bd8c33ef9","schema_version":"1.0","event_id":"sha256:9399a81e9dda27209047a0fa7750582e433f61e010f45351042a1d6bd8c33ef9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LSY6V5ETAXQF57JJSSEGMBU3NB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Codes for Rank Modulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eitan Yaakobi, Sarit Buzaglo","submitted_at":"2014-01-17T22:12:18Z","abstract_excerpt":"Motivated by the rank modulation scheme, a recent work by Sala and Dolecek explored the study of constraint codes for permutations. The constraint studied by them is inherited by the inter-cell interference phenomenon in flash memories, where high-level cells can inadvertently increase the level of low-level cells.\n  In this paper, the model studied by Sala and Dolecek is extended into two constraints. A permutation $\\sigma \\in S_n$ satisfies the \\emph{two-neighbor $k$-constraint} if for all $2 \\leq i \\leq n-1$ either $|\\sigma(i-1)-\\sigma(i)|\\leq k$ or $|\\sigma(i)-\\sigma(i+1)|\\leq k$, and it s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4484","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-18T03:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D6AK2hHpqheL0DwVNlwu0p2Q11Aq+Wh0g2hH+/kpNFljMiEYoq4cuAp5UJzSlw7guZPR8Dc5zfJBUeIfJy/oDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:39:40.572914Z"},"content_sha256":"60285eb88c71f625643921542e0193325ceb4bc62d9c5d49291452cf9fea07ac","schema_version":"1.0","event_id":"sha256:60285eb88c71f625643921542e0193325ceb4bc62d9c5d49291452cf9fea07ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSY6V5ETAXQF57JJSSEGMBU3NB/bundle.json","state_url":"https://pith.science/pith/LSY6V5ETAXQF57JJSSEGMBU3NB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSY6V5ETAXQF57JJSSEGMBU3NB/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-05T16:39:40Z","links":{"resolver":"https://pith.science/pith/LSY6V5ETAXQF57JJSSEGMBU3NB","bundle":"https://pith.science/pith/LSY6V5ETAXQF57JJSSEGMBU3NB/bundle.json","state":"https://pith.science/pith/LSY6V5ETAXQF57JJSSEGMBU3NB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSY6V5ETAXQF57JJSSEGMBU3NB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LSY6V5ETAXQF57JJSSEGMBU3NB","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":"b8dca1975b08bec52d35ce2528828285c55e1dae5c40cb6febd69606f8258c18","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-17T22:12:18Z","title_canon_sha256":"e196ed6bc7ebb5f8fdb4a13ddbbc1b2312c2b6953ae34bc833e70ddfc41a13f1"},"schema_version":"1.0","source":{"id":"1401.4484","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4484","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4484v1","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4484","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"LSY6V5ETAXQF","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LSY6V5ETAXQF57JJ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LSY6V5ET","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:60285eb88c71f625643921542e0193325ceb4bc62d9c5d49291452cf9fea07ac","target":"graph","created_at":"2026-05-18T03:01:45Z","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":"Motivated by the rank modulation scheme, a recent work by Sala and Dolecek explored the study of constraint codes for permutations. The constraint studied by them is inherited by the inter-cell interference phenomenon in flash memories, where high-level cells can inadvertently increase the level of low-level cells.\n  In this paper, the model studied by Sala and Dolecek is extended into two constraints. A permutation $\\sigma \\in S_n$ satisfies the \\emph{two-neighbor $k$-constraint} if for all $2 \\leq i \\leq n-1$ either $|\\sigma(i-1)-\\sigma(i)|\\leq k$ or $|\\sigma(i)-\\sigma(i+1)|\\leq k$, and it s","authors_text":"Eitan Yaakobi, Sarit Buzaglo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-17T22:12:18Z","title":"Constrained Codes for Rank Modulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4484","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:9399a81e9dda27209047a0fa7750582e433f61e010f45351042a1d6bd8c33ef9","target":"record","created_at":"2026-05-18T03:01:45Z","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":"b8dca1975b08bec52d35ce2528828285c55e1dae5c40cb6febd69606f8258c18","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-17T22:12:18Z","title_canon_sha256":"e196ed6bc7ebb5f8fdb4a13ddbbc1b2312c2b6953ae34bc833e70ddfc41a13f1"},"schema_version":"1.0","source":{"id":"1401.4484","kind":"arxiv","version":1}},"canonical_sha256":"5cb1eaf49305e05efd29948866069b68654e2ee0abfa7fcde7dd9ffe0269f020","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cb1eaf49305e05efd29948866069b68654e2ee0abfa7fcde7dd9ffe0269f020","first_computed_at":"2026-05-18T03:01:45.563423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:45.563423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sVzpK+Xda8tSLcJsnKvhebrK6NqMb1SP2LqlMha1sC+pYLITl0irxUdPgNqL0at4uPTmB51Xv81pG8vOtFk9AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:45.564121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4484","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9399a81e9dda27209047a0fa7750582e433f61e010f45351042a1d6bd8c33ef9","sha256:60285eb88c71f625643921542e0193325ceb4bc62d9c5d49291452cf9fea07ac"],"state_sha256":"2fcbdd376f8132fe03069bac8e5be9f3d28a60d2b74fb583226280476ad395f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iz4xVdWZts8r4B2FPiWUsAqDLN0Orfmq2JkYnv6AHtzDcSMfau/YSM9Z3c3BXulWASW4MLODTc0C2gyIrKOvBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:39:40.574984Z","bundle_sha256":"2ce134b9182c7bdceb1617a4a795619e65ac68643f95b95609e2e99d58d111aa"}}