{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IZA5JBH2YBN5JVVS3NU7OV3WTN","short_pith_number":"pith:IZA5JBH2","canonical_record":{"source":{"id":"1607.02677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-10T02:06:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"23d8dea5452052c8f4eff51d0759d4a764a3b5c8f843e549258db1041cff6730","abstract_canon_sha256":"37b4bbc736c8b417758df9eaaae4c81a5a173549b17795ebe0cc861a97c2bb5c"},"schema_version":"1.0"},"canonical_sha256":"4641d484fac05bd4d6b2db69f757769b47c642cb9b660e8ffdcc0e051e33846f","source":{"kind":"arxiv","id":"1607.02677","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02677","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02677v1","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02677","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"pith_short_12","alias_value":"IZA5JBH2YBN5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IZA5JBH2YBN5JVVS","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IZA5JBH2","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IZA5JBH2YBN5JVVS3NU7OV3WTN","target":"record","payload":{"canonical_record":{"source":{"id":"1607.02677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-10T02:06:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"23d8dea5452052c8f4eff51d0759d4a764a3b5c8f843e549258db1041cff6730","abstract_canon_sha256":"37b4bbc736c8b417758df9eaaae4c81a5a173549b17795ebe0cc861a97c2bb5c"},"schema_version":"1.0"},"canonical_sha256":"4641d484fac05bd4d6b2db69f757769b47c642cb9b660e8ffdcc0e051e33846f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:16.446189Z","signature_b64":"1GrXrkJnmvgsqXHO/4mGX4i/nk1ndXwgpQWj0JRsL9Wm5ZbbEECf1k4CtX5JrCex9CWxRViR1p4FN+uXyi9JDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4641d484fac05bd4d6b2db69f757769b47c642cb9b660e8ffdcc0e051e33846f","last_reissued_at":"2026-05-18T01:11:16.445725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:16.445725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.02677","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-18T01:11:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v+KalM8V7xp51Rh92kfGr5O/u68ZGD2Fo1n3kzsrnFSrya4NkmtTxcoV6o0Hl7TkOvoH1jut6pPiHPgplM4PDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:44:15.108673Z"},"content_sha256":"0dbdf3742b1d3af20e17609720cde021f68e5469b8e6eb1d68157136d64abcf2","schema_version":"1.0","event_id":"sha256:0dbdf3742b1d3af20e17609720cde021f68e5469b8e6eb1d68157136d64abcf2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IZA5JBH2YBN5JVVS3NU7OV3WTN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction of Cyclic and Constacyclic Codes for b-symbol Read Channels Meeting the Plotkin-like Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jin Li, Keqin Feng, Minghui Yang","submitted_at":"2016-07-10T02:06:42Z","abstract_excerpt":"The symbol-pair codes over finite fields have been raised for symbol-pair read channels and motivated by application of high-density data storage technologies [1, 2]. Their generalization is the code for b-symbol read channels (b > 2). Many MDS codes for b-symbol read channels have been constructed which meet the Singleton-like bound ([3, 4, 10] for b = 2 and [11] for b > 2). In this paper we show the Plotkin-like bound and present a construction on irreducible cyclic codes and constacyclic codes meeting the Plotkin-like bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02677","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-18T01:11:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vo/CGN/skMferc/l/rlwvxskNHwq0nOsaUk3CZQlD2idPscu4qinQoH8Qixuwb1drbAGREB1xx6k3SigkCoKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:44:15.109020Z"},"content_sha256":"e2c154fa7646a6a837cc962c1718b55bb2e33ac5f9c225604829c1f083b7fef7","schema_version":"1.0","event_id":"sha256:e2c154fa7646a6a837cc962c1718b55bb2e33ac5f9c225604829c1f083b7fef7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZA5JBH2YBN5JVVS3NU7OV3WTN/bundle.json","state_url":"https://pith.science/pith/IZA5JBH2YBN5JVVS3NU7OV3WTN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZA5JBH2YBN5JVVS3NU7OV3WTN/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-06-02T13:44:15Z","links":{"resolver":"https://pith.science/pith/IZA5JBH2YBN5JVVS3NU7OV3WTN","bundle":"https://pith.science/pith/IZA5JBH2YBN5JVVS3NU7OV3WTN/bundle.json","state":"https://pith.science/pith/IZA5JBH2YBN5JVVS3NU7OV3WTN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZA5JBH2YBN5JVVS3NU7OV3WTN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IZA5JBH2YBN5JVVS3NU7OV3WTN","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":"37b4bbc736c8b417758df9eaaae4c81a5a173549b17795ebe0cc861a97c2bb5c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-10T02:06:42Z","title_canon_sha256":"23d8dea5452052c8f4eff51d0759d4a764a3b5c8f843e549258db1041cff6730"},"schema_version":"1.0","source":{"id":"1607.02677","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02677","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02677v1","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02677","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"pith_short_12","alias_value":"IZA5JBH2YBN5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IZA5JBH2YBN5JVVS","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IZA5JBH2","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:e2c154fa7646a6a837cc962c1718b55bb2e33ac5f9c225604829c1f083b7fef7","target":"graph","created_at":"2026-05-18T01:11:16Z","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":"The symbol-pair codes over finite fields have been raised for symbol-pair read channels and motivated by application of high-density data storage technologies [1, 2]. Their generalization is the code for b-symbol read channels (b > 2). Many MDS codes for b-symbol read channels have been constructed which meet the Singleton-like bound ([3, 4, 10] for b = 2 and [11] for b > 2). In this paper we show the Plotkin-like bound and present a construction on irreducible cyclic codes and constacyclic codes meeting the Plotkin-like bound.","authors_text":"Jin Li, Keqin Feng, Minghui Yang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-10T02:06:42Z","title":"Construction of Cyclic and Constacyclic Codes for b-symbol Read Channels Meeting the Plotkin-like Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02677","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:0dbdf3742b1d3af20e17609720cde021f68e5469b8e6eb1d68157136d64abcf2","target":"record","created_at":"2026-05-18T01:11:16Z","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":"37b4bbc736c8b417758df9eaaae4c81a5a173549b17795ebe0cc861a97c2bb5c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-10T02:06:42Z","title_canon_sha256":"23d8dea5452052c8f4eff51d0759d4a764a3b5c8f843e549258db1041cff6730"},"schema_version":"1.0","source":{"id":"1607.02677","kind":"arxiv","version":1}},"canonical_sha256":"4641d484fac05bd4d6b2db69f757769b47c642cb9b660e8ffdcc0e051e33846f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4641d484fac05bd4d6b2db69f757769b47c642cb9b660e8ffdcc0e051e33846f","first_computed_at":"2026-05-18T01:11:16.445725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:16.445725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1GrXrkJnmvgsqXHO/4mGX4i/nk1ndXwgpQWj0JRsL9Wm5ZbbEECf1k4CtX5JrCex9CWxRViR1p4FN+uXyi9JDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:16.446189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.02677","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0dbdf3742b1d3af20e17609720cde021f68e5469b8e6eb1d68157136d64abcf2","sha256:e2c154fa7646a6a837cc962c1718b55bb2e33ac5f9c225604829c1f083b7fef7"],"state_sha256":"4143e2ff989796047bc300a01af17d3aacc9b64dd03d66c0b32e7c912dc9b62f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qQp4CzmujJ0GyRLIUpQa24wC8HxY+mZrqO+TS46HYN4h+uE5Fp3kNPVqCO7vCklZIi6YJmAWMLp05XhOVr4+BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:44:15.111200Z","bundle_sha256":"26df382867f4dd07583a7dbf861b7fc5b915e81ca7c7361dcf0f8ca777115a0c"}}