{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5LY45767SNXHNE2CG7PVFIK2P6","short_pith_number":"pith:5LY45767","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"},"canonical_sha256":"eaf1ceffdf936e76934237df52a15a7fa748d6a05540adc64c1fa8668908879c","source":{"kind":"arxiv","id":"1903.01148","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01148","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01148v1","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01148","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"5LY45767SNXH","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5LY45767SNXHNE2C","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5LY45767","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5LY45767SNXHNE2CG7PVFIK2P6","target":"record","payload":{"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"},"canonical_sha256":"eaf1ceffdf936e76934237df52a15a7fa748d6a05540adc64c1fa8668908879c","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"},"source_kind":"arxiv","source_id":"1903.01148","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-17T23:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"54iCfeH7ItKdlkbQzhFE/RCleQ8NFpSmMIFQwRsWBAqUhqYN2L2aYYtJqUKaglC+S4c4FjJxhMq2qqgx1JyxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:45:12.080257Z"},"content_sha256":"27c0f98a7b8fba538a793d27dd9617d324bef35aa11fc8c806628c7885b39990","schema_version":"1.0","event_id":"sha256:27c0f98a7b8fba538a793d27dd9617d324bef35aa11fc8c806628c7885b39990"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5LY45767SNXHNE2CG7PVFIK2P6","target":"graph","payload":{"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"},"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-17T23:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RsNlPiLSsxqO++g8BYAuN7+ZnplwZvDEsw4wCOjooFZKEsApvQzsICXWq4uM0S1QiXIPqiPO1IiR58gAV4+IDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:45:12.080747Z"},"content_sha256":"08ea04c07739d587a25158a17fed816337d8a6ccc76aa956092ac77a4665d0e1","schema_version":"1.0","event_id":"sha256:08ea04c07739d587a25158a17fed816337d8a6ccc76aa956092ac77a4665d0e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LY45767SNXHNE2CG7PVFIK2P6/bundle.json","state_url":"https://pith.science/pith/5LY45767SNXHNE2CG7PVFIK2P6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LY45767SNXHNE2CG7PVFIK2P6/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-31T04:45:12Z","links":{"resolver":"https://pith.science/pith/5LY45767SNXHNE2CG7PVFIK2P6","bundle":"https://pith.science/pith/5LY45767SNXHNE2CG7PVFIK2P6/bundle.json","state":"https://pith.science/pith/5LY45767SNXHNE2CG7PVFIK2P6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LY45767SNXHNE2CG7PVFIK2P6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5LY45767SNXHNE2CG7PVFIK2P6","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":"2238913ed481dd9fa46eeb720732fd0f19e5c6d07e5b0b744eee0e3c0ff1828e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-04T09:32:48Z","title_canon_sha256":"d81156b4d09c8dcfd196b808d58c8fc7c5e2b349e1a1d4b7039082be258c70a6"},"schema_version":"1.0","source":{"id":"1903.01148","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01148","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01148v1","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01148","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"5LY45767SNXH","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5LY45767SNXHNE2C","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5LY45767","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:08ea04c07739d587a25158a17fed816337d8a6ccc76aa956092ac77a4665d0e1","target":"graph","created_at":"2026-05-17T23:52:12Z","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":"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","authors_text":"Derong Xie, Jinquan Luo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-04T09:32:48Z","title":"Asymmetric Single Magnitude Four Error Correcting Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01148","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:27c0f98a7b8fba538a793d27dd9617d324bef35aa11fc8c806628c7885b39990","target":"record","created_at":"2026-05-17T23:52:12Z","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":"2238913ed481dd9fa46eeb720732fd0f19e5c6d07e5b0b744eee0e3c0ff1828e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-04T09:32:48Z","title_canon_sha256":"d81156b4d09c8dcfd196b808d58c8fc7c5e2b349e1a1d4b7039082be258c70a6"},"schema_version":"1.0","source":{"id":"1903.01148","kind":"arxiv","version":1}},"canonical_sha256":"eaf1ceffdf936e76934237df52a15a7fa748d6a05540adc64c1fa8668908879c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eaf1ceffdf936e76934237df52a15a7fa748d6a05540adc64c1fa8668908879c","first_computed_at":"2026-05-17T23:52:12.156478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:12.156478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"05L1LPnvF20H8xBMtuOnBygGv4HrbktSMqAPNm+kBpfZ839S4BYSOGtvjiKa50iyfDF8Orx1T83fFjA1YR3FCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:12.157195Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01148","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27c0f98a7b8fba538a793d27dd9617d324bef35aa11fc8c806628c7885b39990","sha256:08ea04c07739d587a25158a17fed816337d8a6ccc76aa956092ac77a4665d0e1"],"state_sha256":"b25b0b0c088ca312c87ab82e13fbe889aae966c5200667bdf31e0edfd86d709e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uoe7MhIa1O7uKedZXH0gldYlKwNWIi9T9Olam3BdriUTg49CORwlmZFMNxce5oyTASdpaCrY/2+50z6U9blKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:45:12.084903Z","bundle_sha256":"dcb95e6c06d51d49bf9b107c3ebbb159a9200e23dfb6409eea6df1da5d272d8f"}}