{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DSO6HJ3CSGJOT74PHU5V3L5VNI","short_pith_number":"pith:DSO6HJ3C","canonical_record":{"source":{"id":"1701.08492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-30T06:44:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aa3f380bf8d3298031ee82535896ec17027b3a3881cb550153f5be73f7ad55ff","abstract_canon_sha256":"9fd77e249ef64cdc5f2097ffce412b4ffaf4044d849c59050a1203f085b798ba"},"schema_version":"1.0"},"canonical_sha256":"1c9de3a7629192e9ff8f3d3b5dafb56a0388c81f0f562a9b3c6b15180e1a83d9","source":{"kind":"arxiv","id":"1701.08492","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08492","created_at":"2026-05-18T00:23:40Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08492v1","created_at":"2026-05-18T00:23:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08492","created_at":"2026-05-18T00:23:40Z"},{"alias_kind":"pith_short_12","alias_value":"DSO6HJ3CSGJO","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DSO6HJ3CSGJOT74P","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DSO6HJ3C","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DSO6HJ3CSGJOT74PHU5V3L5VNI","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-30T06:44:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aa3f380bf8d3298031ee82535896ec17027b3a3881cb550153f5be73f7ad55ff","abstract_canon_sha256":"9fd77e249ef64cdc5f2097ffce412b4ffaf4044d849c59050a1203f085b798ba"},"schema_version":"1.0"},"canonical_sha256":"1c9de3a7629192e9ff8f3d3b5dafb56a0388c81f0f562a9b3c6b15180e1a83d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:40.139343Z","signature_b64":"/35szVitwWkKZ5UoA0TTN8JABA6+pJTKHGX7jLXUG5sXQmATM6KvQ6R4LTxg9LelgSnNylpF5l4/yWqw6bRJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c9de3a7629192e9ff8f3d3b5dafb56a0388c81f0f562a9b3c6b15180e1a83d9","last_reissued_at":"2026-05-18T00:23:40.138626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:40.138626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08492","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-18T00:23:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2LoFBcgS/pwftU+HZKTTux25LuOVSD6muMcGrL4M0EuAEUYdbNT/xcv6HTT2ljxtmhZsF2pQiu3+H6E0gZimDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:27:48.300196Z"},"content_sha256":"90ae968e392429850486f61ff02d82405715fb99bf36a3f83c05f11a86c177d2","schema_version":"1.0","event_id":"sha256:90ae968e392429850486f61ff02d82405715fb99bf36a3f83c05f11a86c177d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DSO6HJ3CSGJOT74PHU5V3L5VNI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Zero Error Capacity of Nearest Neighbor Error Channels with Multilevel Alphabet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Tadashi Wadayama, Takafumi Nakano","submitted_at":"2017-01-30T06:44:11Z","abstract_excerpt":"This paper studies the zero error capacity of the Nearest Neighbor Error (NNE) channels with a multilevel alphabet. In the NNE channels, a transmitted symbol is a $d$-tuple of elements in $\\{0,1,2,\\dots, n-1 \\}$. It is assumed that only one element error to a nearest neighbor element in a transmitted symbol can occur. The NNE channels can be considered as a special type of limited magnitude error channels, and it is closely related to error models for flash memories. In this paper, we derive a lower bound of the zero error capacity of the NNE channels based on a result of the perfect Lee codes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08492","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-18T00:23:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mUYf4lNhNI1+UZqVO38CLrUmcliVYo3JBCQUAerY7mN5a1/4+In+HxqKq3f7Z1DflMJaW67p/z1u9voIb5GLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:27:48.300591Z"},"content_sha256":"5d084dc343a543e6d7a731e1249117581d9a0eb3b5fa33e1c9597ef429b81a04","schema_version":"1.0","event_id":"sha256:5d084dc343a543e6d7a731e1249117581d9a0eb3b5fa33e1c9597ef429b81a04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DSO6HJ3CSGJOT74PHU5V3L5VNI/bundle.json","state_url":"https://pith.science/pith/DSO6HJ3CSGJOT74PHU5V3L5VNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DSO6HJ3CSGJOT74PHU5V3L5VNI/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-30T15:27:48Z","links":{"resolver":"https://pith.science/pith/DSO6HJ3CSGJOT74PHU5V3L5VNI","bundle":"https://pith.science/pith/DSO6HJ3CSGJOT74PHU5V3L5VNI/bundle.json","state":"https://pith.science/pith/DSO6HJ3CSGJOT74PHU5V3L5VNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DSO6HJ3CSGJOT74PHU5V3L5VNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DSO6HJ3CSGJOT74PHU5V3L5VNI","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":"9fd77e249ef64cdc5f2097ffce412b4ffaf4044d849c59050a1203f085b798ba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-30T06:44:11Z","title_canon_sha256":"aa3f380bf8d3298031ee82535896ec17027b3a3881cb550153f5be73f7ad55ff"},"schema_version":"1.0","source":{"id":"1701.08492","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08492","created_at":"2026-05-18T00:23:40Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08492v1","created_at":"2026-05-18T00:23:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08492","created_at":"2026-05-18T00:23:40Z"},{"alias_kind":"pith_short_12","alias_value":"DSO6HJ3CSGJO","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DSO6HJ3CSGJOT74P","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DSO6HJ3C","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:5d084dc343a543e6d7a731e1249117581d9a0eb3b5fa33e1c9597ef429b81a04","target":"graph","created_at":"2026-05-18T00:23:40Z","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":"This paper studies the zero error capacity of the Nearest Neighbor Error (NNE) channels with a multilevel alphabet. In the NNE channels, a transmitted symbol is a $d$-tuple of elements in $\\{0,1,2,\\dots, n-1 \\}$. It is assumed that only one element error to a nearest neighbor element in a transmitted symbol can occur. The NNE channels can be considered as a special type of limited magnitude error channels, and it is closely related to error models for flash memories. In this paper, we derive a lower bound of the zero error capacity of the NNE channels based on a result of the perfect Lee codes","authors_text":"Tadashi Wadayama, Takafumi Nakano","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-30T06:44:11Z","title":"On Zero Error Capacity of Nearest Neighbor Error Channels with Multilevel Alphabet"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08492","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:90ae968e392429850486f61ff02d82405715fb99bf36a3f83c05f11a86c177d2","target":"record","created_at":"2026-05-18T00:23:40Z","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":"9fd77e249ef64cdc5f2097ffce412b4ffaf4044d849c59050a1203f085b798ba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-30T06:44:11Z","title_canon_sha256":"aa3f380bf8d3298031ee82535896ec17027b3a3881cb550153f5be73f7ad55ff"},"schema_version":"1.0","source":{"id":"1701.08492","kind":"arxiv","version":1}},"canonical_sha256":"1c9de3a7629192e9ff8f3d3b5dafb56a0388c81f0f562a9b3c6b15180e1a83d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c9de3a7629192e9ff8f3d3b5dafb56a0388c81f0f562a9b3c6b15180e1a83d9","first_computed_at":"2026-05-18T00:23:40.138626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:40.138626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/35szVitwWkKZ5UoA0TTN8JABA6+pJTKHGX7jLXUG5sXQmATM6KvQ6R4LTxg9LelgSnNylpF5l4/yWqw6bRJDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:40.139343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08492","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90ae968e392429850486f61ff02d82405715fb99bf36a3f83c05f11a86c177d2","sha256:5d084dc343a543e6d7a731e1249117581d9a0eb3b5fa33e1c9597ef429b81a04"],"state_sha256":"c8b9d90556a5b5cf4453d315105e3e0d056e4bcdbfc055f3fa4e8c5f31cb4e56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a3VhG3I0gRPiaGnjemn7ohf1ucL56RkUVX1Brxp+XxyyIufjglmhQqZv3A7O/UOT6nfqOQq1lCGT6fRbk6KwCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:27:48.302727Z","bundle_sha256":"d8f83a29db6f4f513bf70400f5fc56bc4fc5595330f690769aa7d7927e2d27df"}}