{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:JJNHMU2AP6YID4ZYEXHZIPEBUF","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":"932b48f37cb0f26d4dad1eac42307c8b52fdc63eb19eefb28d3d4cb5c5f2f1e9","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-13T12:24:08Z","title_canon_sha256":"4af0788b627080d7f2355f0183c7b2cf29d286aa301375c22def9a45a67a4619"},"schema_version":"1.0","source":{"id":"2505.08495","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.08495","created_at":"2026-07-05T11:02:31Z"},{"alias_kind":"arxiv_version","alias_value":"2505.08495v1","created_at":"2026-07-05T11:02:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.08495","created_at":"2026-07-05T11:02:31Z"},{"alias_kind":"pith_short_12","alias_value":"JJNHMU2AP6YI","created_at":"2026-07-05T11:02:31Z"},{"alias_kind":"pith_short_16","alias_value":"JJNHMU2AP6YID4ZY","created_at":"2026-07-05T11:02:31Z"},{"alias_kind":"pith_short_8","alias_value":"JJNHMU2A","created_at":"2026-07-05T11:02:31Z"}],"graph_snapshots":[{"event_id":"sha256:49df1bb6346256bf837180242e7cb5a156987325a80c2c326dfe9f25cdb3e90b","target":"graph","created_at":"2026-07-05T11:02:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.08495/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Lattice tilings of $\\mathbb{Z}^n$ by limited-magnitude error balls correspond to linear perfect codes under such error models and play a crucial role in flash memory applications. In this work, we establish three main results. First, we fully determine the existence of lattice tilings by $\\mathcal{B}(n,2,3,0)$ in all dimensions $n$. Second, we completely resolve the case $k_1=k_2+1$. Finally, we prove that for any integers $k_1>k_2\\ge0$ where $k_1+k_2+1$ is composite, no lattice tiling of $\\mathbb{Z}^n$ by the error ball $\\mathcal{B}(n,2,k_1,k_2)$ exists for sufficiently large $n$.","authors_text":"Daohua Wang, Ka Hin Leung, Ran Tao, Tao Zhang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-13T12:24:08Z","title":"On lattice tilings of $\\mathbb{Z}^n$ by limited magnitude error balls $\\mathcal{B}(n,2,k_{1},k_{2})$ with $k_1>k_2$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.08495","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:7836979af4b2d54b255ed8881e8c2c27d768477bd2ac6e3b5b390ff8b8a95122","target":"record","created_at":"2026-07-05T11:02:31Z","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":"932b48f37cb0f26d4dad1eac42307c8b52fdc63eb19eefb28d3d4cb5c5f2f1e9","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-13T12:24:08Z","title_canon_sha256":"4af0788b627080d7f2355f0183c7b2cf29d286aa301375c22def9a45a67a4619"},"schema_version":"1.0","source":{"id":"2505.08495","kind":"arxiv","version":1}},"canonical_sha256":"4a5a7653407fb081f33825cf943c81a1593ec9c72ca4595f3d53962cba32092a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a5a7653407fb081f33825cf943c81a1593ec9c72ca4595f3d53962cba32092a","first_computed_at":"2026-07-05T11:02:31.227440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:02:31.227440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O9ctatBEe7ofNz7VRBX8+3L4e2yQPO0v+tMYrIt5SP69Cg7pYGNaAJp9fqhEgolT6f10EpiMRpHRp6udtuMNAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:02:31.227952Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.08495","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7836979af4b2d54b255ed8881e8c2c27d768477bd2ac6e3b5b390ff8b8a95122","sha256:49df1bb6346256bf837180242e7cb5a156987325a80c2c326dfe9f25cdb3e90b"],"state_sha256":"749d422a8bacd66278a0505aa9c3edd890813f23f35c80f6eb4354104e83b9cc"}