{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3NUIFZAUMGRJPEPX2OI5B2JWYV","short_pith_number":"pith:3NUIFZAU","canonical_record":{"source":{"id":"1703.10758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-31T05:18:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2452294b7105443114841c42c2ccd5aa3ab4a69fe2d7c725771fed1214fb0ae9","abstract_canon_sha256":"fda00618ff03ce5cba7e273e9ae4d959e30b30cd5917668f8c8cf9e0bfd4fe14"},"schema_version":"1.0"},"canonical_sha256":"db6882e41461a29791f7d391d0e936c56cb79778d13d1c3b01f8d9fed8a511b5","source":{"kind":"arxiv","id":"1703.10758","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10758","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10758v1","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10758","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"pith_short_12","alias_value":"3NUIFZAUMGRJ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3NUIFZAUMGRJPEPX","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3NUIFZAU","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3NUIFZAUMGRJPEPX2OI5B2JWYV","target":"record","payload":{"canonical_record":{"source":{"id":"1703.10758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-31T05:18:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2452294b7105443114841c42c2ccd5aa3ab4a69fe2d7c725771fed1214fb0ae9","abstract_canon_sha256":"fda00618ff03ce5cba7e273e9ae4d959e30b30cd5917668f8c8cf9e0bfd4fe14"},"schema_version":"1.0"},"canonical_sha256":"db6882e41461a29791f7d391d0e936c56cb79778d13d1c3b01f8d9fed8a511b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:32.760820Z","signature_b64":"vCMrmM9r5qfjk2N4/65ke9Bqva/j2ZInNa1vKiBNzq56hvGlLV95zPcIqizRw7VkkSDlEZccTd0erCZ5q3tbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db6882e41461a29791f7d391d0e936c56cb79778d13d1c3b01f8d9fed8a511b5","last_reissued_at":"2026-05-18T00:47:32.760373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:32.760373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.10758","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-18T00:47:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yipCCVi3rI254F2HImNBNtaNfxCLcMkClREyjKCigzIJdkwkrKkT4ng7SmL1AKHerfPDXxBY9bnMou7FNlTtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:08:29.197153Z"},"content_sha256":"ba012a15a0a0270b46188cad55cb7c28374b7bcef5246672ca9b3e248149a0e1","schema_version":"1.0","event_id":"sha256:ba012a15a0a0270b46188cad55cb7c28374b7bcef5246672ca9b3e248149a0e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3NUIFZAUMGRJPEPX2OI5B2JWYV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On cyclic codes of composite length and the minimal distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Maosheng Xiong","submitted_at":"2017-03-31T05:18:16Z","abstract_excerpt":"In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and dimension over the same finite field. However, not much is known about these codes. In this paper we explain some of the mysteries of the numerical data by developing a general method on cyclic codes of composite length and on estimating the minimal distance. Inspired by the new method, we also provide a general construction of cyclic codes of composite len"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10758","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-18T00:47:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dSzp3DHwbGMcGbuhEYuWUdf8nhPoCu4kolmI3uNiWTQF4iQY4uYZzSpK5wm5hQiIpfPcu116PshkH5JsYb3HAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:08:29.197520Z"},"content_sha256":"c824daf69a26b7d5e23aad556f63a73349b00ed4b07daa5bbdd00b37b43cfbaa","schema_version":"1.0","event_id":"sha256:c824daf69a26b7d5e23aad556f63a73349b00ed4b07daa5bbdd00b37b43cfbaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NUIFZAUMGRJPEPX2OI5B2JWYV/bundle.json","state_url":"https://pith.science/pith/3NUIFZAUMGRJPEPX2OI5B2JWYV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NUIFZAUMGRJPEPX2OI5B2JWYV/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-22T23:08:29Z","links":{"resolver":"https://pith.science/pith/3NUIFZAUMGRJPEPX2OI5B2JWYV","bundle":"https://pith.science/pith/3NUIFZAUMGRJPEPX2OI5B2JWYV/bundle.json","state":"https://pith.science/pith/3NUIFZAUMGRJPEPX2OI5B2JWYV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NUIFZAUMGRJPEPX2OI5B2JWYV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3NUIFZAUMGRJPEPX2OI5B2JWYV","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":"fda00618ff03ce5cba7e273e9ae4d959e30b30cd5917668f8c8cf9e0bfd4fe14","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-31T05:18:16Z","title_canon_sha256":"2452294b7105443114841c42c2ccd5aa3ab4a69fe2d7c725771fed1214fb0ae9"},"schema_version":"1.0","source":{"id":"1703.10758","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10758","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10758v1","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10758","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"pith_short_12","alias_value":"3NUIFZAUMGRJ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3NUIFZAUMGRJPEPX","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3NUIFZAU","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:c824daf69a26b7d5e23aad556f63a73349b00ed4b07daa5bbdd00b37b43cfbaa","target":"graph","created_at":"2026-05-18T00:47:32Z","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":"In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and dimension over the same finite field. However, not much is known about these codes. In this paper we explain some of the mysteries of the numerical data by developing a general method on cyclic codes of composite length and on estimating the minimal distance. Inspired by the new method, we also provide a general construction of cyclic codes of composite len","authors_text":"Maosheng Xiong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-31T05:18:16Z","title":"On cyclic codes of composite length and the minimal distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10758","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:ba012a15a0a0270b46188cad55cb7c28374b7bcef5246672ca9b3e248149a0e1","target":"record","created_at":"2026-05-18T00:47:32Z","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":"fda00618ff03ce5cba7e273e9ae4d959e30b30cd5917668f8c8cf9e0bfd4fe14","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-31T05:18:16Z","title_canon_sha256":"2452294b7105443114841c42c2ccd5aa3ab4a69fe2d7c725771fed1214fb0ae9"},"schema_version":"1.0","source":{"id":"1703.10758","kind":"arxiv","version":1}},"canonical_sha256":"db6882e41461a29791f7d391d0e936c56cb79778d13d1c3b01f8d9fed8a511b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db6882e41461a29791f7d391d0e936c56cb79778d13d1c3b01f8d9fed8a511b5","first_computed_at":"2026-05-18T00:47:32.760373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:32.760373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vCMrmM9r5qfjk2N4/65ke9Bqva/j2ZInNa1vKiBNzq56hvGlLV95zPcIqizRw7VkkSDlEZccTd0erCZ5q3tbCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:32.760820Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.10758","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba012a15a0a0270b46188cad55cb7c28374b7bcef5246672ca9b3e248149a0e1","sha256:c824daf69a26b7d5e23aad556f63a73349b00ed4b07daa5bbdd00b37b43cfbaa"],"state_sha256":"3828b7e292976cc4d21d292bd62a14a5f731b58c562f807a08f01a1f504ebc4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YpmcDL5qFWeu6KQ6u3zeWfWuHvi9w0kcVN6oFQ0U9myvCuYoOlpUQnFMa4M0Fa/fuNT5ucAhd7B3DPvRqZ8zCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:08:29.199495Z","bundle_sha256":"344e43468135219353faa438bb52a81abd28fee2a8342e51431df00eff091acf"}}