{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5LY45767SNXHNE2CG7PVFIK2P6","short_pith_number":"pith:5LY45767","schema_version":"1.0","canonical_sha256":"eaf1ceffdf936e76934237df52a15a7fa748d6a05540adc64c1fa8668908879c","source":{"kind":"arxiv","id":"1903.01148","version":1},"attestation_state":"computed","paper":{"title":"Asymmetric Single Magnitude Four Error Correcting Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Derong Xie, Jinquan Luo","submitted_at":"2019-03-04T09:32:48Z","abstract_excerpt":"Limited magnitude asymmetric error model is well suited for flash memory. In this paper, we consider the construction of asymmetric codes correcting single error over $\\mathbb{Z}_{2^{k}r}$ and which are based on so called $B_{1}[4](2^{k}r)$ set. In fact, we reduce the construction of a maximal size $B_{1}[4](2^{k}r)$ set for $k\\geq3$ to the construction of a maximal size $B_{1}[4](2^{k-3}r)$ set. Finally, we give a explicit formula of a maximal size $B_{1}[4](4r)$ set and some lower bounds of a maximal size $B_{1}[4](2r)$ set. By computer searching up to $q\\leq106$, we conjecture that those lo"},"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":"1903.01148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-04T09:32:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d81156b4d09c8dcfd196b808d58c8fc7c5e2b349e1a1d4b7039082be258c70a6","abstract_canon_sha256":"2238913ed481dd9fa46eeb720732fd0f19e5c6d07e5b0b744eee0e3c0ff1828e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:12.157195Z","signature_b64":"05L1LPnvF20H8xBMtuOnBygGv4HrbktSMqAPNm+kBpfZ839S4BYSOGtvjiKa50iyfDF8Orx1T83fFjA1YR3FCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaf1ceffdf936e76934237df52a15a7fa748d6a05540adc64c1fa8668908879c","last_reissued_at":"2026-05-17T23:52:12.156478Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:12.156478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymmetric Single Magnitude Four Error Correcting Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Derong Xie, Jinquan Luo","submitted_at":"2019-03-04T09:32:48Z","abstract_excerpt":"Limited magnitude asymmetric error model is well suited for flash memory. In this paper, we consider the construction of asymmetric codes correcting single error over $\\mathbb{Z}_{2^{k}r}$ and which are based on so called $B_{1}[4](2^{k}r)$ set. In fact, we reduce the construction of a maximal size $B_{1}[4](2^{k}r)$ set for $k\\geq3$ to the construction of a maximal size $B_{1}[4](2^{k-3}r)$ set. Finally, we give a explicit formula of a maximal size $B_{1}[4](4r)$ set and some lower bounds of a maximal size $B_{1}[4](2r)$ set. By computer searching up to $q\\leq106$, we conjecture that those lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01148","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":"1903.01148","created_at":"2026-05-17T23:52:12.156605+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01148v1","created_at":"2026-05-17T23:52:12.156605+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01148","created_at":"2026-05-17T23:52:12.156605+00:00"},{"alias_kind":"pith_short_12","alias_value":"5LY45767SNXH","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5LY45767SNXHNE2C","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5LY45767","created_at":"2026-05-18T12:33:10.108867+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/5LY45767SNXHNE2CG7PVFIK2P6","json":"https://pith.science/pith/5LY45767SNXHNE2CG7PVFIK2P6.json","graph_json":"https://pith.science/api/pith-number/5LY45767SNXHNE2CG7PVFIK2P6/graph.json","events_json":"https://pith.science/api/pith-number/5LY45767SNXHNE2CG7PVFIK2P6/events.json","paper":"https://pith.science/paper/5LY45767"},"agent_actions":{"view_html":"https://pith.science/pith/5LY45767SNXHNE2CG7PVFIK2P6","download_json":"https://pith.science/pith/5LY45767SNXHNE2CG7PVFIK2P6.json","view_paper":"https://pith.science/paper/5LY45767","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01148&json=true","fetch_graph":"https://pith.science/api/pith-number/5LY45767SNXHNE2CG7PVFIK2P6/graph.json","fetch_events":"https://pith.science/api/pith-number/5LY45767SNXHNE2CG7PVFIK2P6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5LY45767SNXHNE2CG7PVFIK2P6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5LY45767SNXHNE2CG7PVFIK2P6/action/storage_attestation","attest_author":"https://pith.science/pith/5LY45767SNXHNE2CG7PVFIK2P6/action/author_attestation","sign_citation":"https://pith.science/pith/5LY45767SNXHNE2CG7PVFIK2P6/action/citation_signature","submit_replication":"https://pith.science/pith/5LY45767SNXHNE2CG7PVFIK2P6/action/replication_record"}},"created_at":"2026-05-17T23:52:12.156605+00:00","updated_at":"2026-05-17T23:52:12.156605+00:00"}