{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DSO6HJ3CSGJOT74PHU5V3L5VNI","short_pith_number":"pith:DSO6HJ3C","schema_version":"1.0","canonical_sha256":"1c9de3a7629192e9ff8f3d3b5dafb56a0388c81f0f562a9b3c6b15180e1a83d9","source":{"kind":"arxiv","id":"1701.08492","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.08492","created_at":"2026-05-18T00:23:40.138736+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.08492v1","created_at":"2026-05-18T00:23:40.138736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08492","created_at":"2026-05-18T00:23:40.138736+00:00"},{"alias_kind":"pith_short_12","alias_value":"DSO6HJ3CSGJO","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DSO6HJ3CSGJOT74P","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DSO6HJ3C","created_at":"2026-05-18T12:31:12.930513+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/DSO6HJ3CSGJOT74PHU5V3L5VNI","json":"https://pith.science/pith/DSO6HJ3CSGJOT74PHU5V3L5VNI.json","graph_json":"https://pith.science/api/pith-number/DSO6HJ3CSGJOT74PHU5V3L5VNI/graph.json","events_json":"https://pith.science/api/pith-number/DSO6HJ3CSGJOT74PHU5V3L5VNI/events.json","paper":"https://pith.science/paper/DSO6HJ3C"},"agent_actions":{"view_html":"https://pith.science/pith/DSO6HJ3CSGJOT74PHU5V3L5VNI","download_json":"https://pith.science/pith/DSO6HJ3CSGJOT74PHU5V3L5VNI.json","view_paper":"https://pith.science/paper/DSO6HJ3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.08492&json=true","fetch_graph":"https://pith.science/api/pith-number/DSO6HJ3CSGJOT74PHU5V3L5VNI/graph.json","fetch_events":"https://pith.science/api/pith-number/DSO6HJ3CSGJOT74PHU5V3L5VNI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DSO6HJ3CSGJOT74PHU5V3L5VNI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DSO6HJ3CSGJOT74PHU5V3L5VNI/action/storage_attestation","attest_author":"https://pith.science/pith/DSO6HJ3CSGJOT74PHU5V3L5VNI/action/author_attestation","sign_citation":"https://pith.science/pith/DSO6HJ3CSGJOT74PHU5V3L5VNI/action/citation_signature","submit_replication":"https://pith.science/pith/DSO6HJ3CSGJOT74PHU5V3L5VNI/action/replication_record"}},"created_at":"2026-05-18T00:23:40.138736+00:00","updated_at":"2026-05-18T00:23:40.138736+00:00"}