{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DYCLOLG3TTLPOIYO7JSEXAQDMF","short_pith_number":"pith:DYCLOLG3","canonical_record":{"source":{"id":"1907.07111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-14T13:43:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5431bd8ee8c021e0f1b4b1b62a4271d63cc5c00a0631fcfef502421a7ef9e03d","abstract_canon_sha256":"f000e057232a6c88192ccf162ddeadb388d047af4af196ecf2d783dfd7f01ee4"},"schema_version":"1.0"},"canonical_sha256":"1e04b72cdb9cd6f7230efa644b8203617596fed7912f4c8e9719aa009dc4bcb1","source":{"kind":"arxiv","id":"1907.07111","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07111","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07111v1","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07111","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"DYCLOLG3TTLP","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DYCLOLG3TTLPOIYO","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DYCLOLG3","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DYCLOLG3TTLPOIYO7JSEXAQDMF","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-14T13:43:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5431bd8ee8c021e0f1b4b1b62a4271d63cc5c00a0631fcfef502421a7ef9e03d","abstract_canon_sha256":"f000e057232a6c88192ccf162ddeadb388d047af4af196ecf2d783dfd7f01ee4"},"schema_version":"1.0"},"canonical_sha256":"1e04b72cdb9cd6f7230efa644b8203617596fed7912f4c8e9719aa009dc4bcb1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:28.048882Z","signature_b64":"2Grv9d+wPwtel2kvuKcwVVtOcf0xxQvJH/CjJGo7cH1qbwyJJKHKjip1KNGzRCAwvCAZI19Yrp2T8h/PfQ4eCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e04b72cdb9cd6f7230efa644b8203617596fed7912f4c8e9719aa009dc4bcb1","last_reissued_at":"2026-05-17T23:40:28.048255Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:28.048255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07111","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:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pf2f43z00FnWtxgEKh8ZAnPTPBIP31XMQJ9zSUy3GJ/7MrBLhDv4Jh9wS0cHxj/4Ink/VGGMKFTwDhOd7TADCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:44:10.873773Z"},"content_sha256":"30ea8c90762e4bc4930d7bfb1129fce66903678ffddb4169ebc7a29c034966a8","schema_version":"1.0","event_id":"sha256:30ea8c90762e4bc4930d7bfb1129fce66903678ffddb4169ebc7a29c034966a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DYCLOLG3TTLPOIYO7JSEXAQDMF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction and enumeration for self-dual cyclic codes of even length over $\\mathbb{F}_{2^m} + u\\mathbb{F}_{2^m}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fanghui Ma, Fang-Wei Fu, Hai Q. Dinh, Yonglin Cao, Yuan Cao","submitted_at":"2019-07-14T13:43:24Z","abstract_excerpt":"Let $\\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $R=\\mathbb{F}_{2^m}+u\\mathbb{F}_{2^m}$ $(u^2=0)$ and $s,n$ be positive integers such that $n$ is odd. In this paper, we give an explicit representation for every self-dual cyclic code over the finite chain ring $R$ of length $2^sn$ and provide a calculation method to obtain all distinct codes. Moreover, we obtain a clear formula to count the number of all these self-dual cyclic codes. As an application, self-dual and $2$-quasi-cyclic codes over $\\mathbb{F}_{2^m}$ of length $2^{s+1}n$ can be obtained from self-dual cyclic code over "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07111","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:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZYh7N5ILI+BHDXhUWjk/fYezLKCQ4lCnjS/kUXGGm9ElaVQAXwZellCPosBFTr0IFZT+oy2S0HsR+uNyMyZ/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:44:10.874169Z"},"content_sha256":"ab2f292280e8b9d8a8e923c9598bae8c886eae56db18e4a24fde94458a354f2e","schema_version":"1.0","event_id":"sha256:ab2f292280e8b9d8a8e923c9598bae8c886eae56db18e4a24fde94458a354f2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DYCLOLG3TTLPOIYO7JSEXAQDMF/bundle.json","state_url":"https://pith.science/pith/DYCLOLG3TTLPOIYO7JSEXAQDMF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DYCLOLG3TTLPOIYO7JSEXAQDMF/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-01T13:44:10Z","links":{"resolver":"https://pith.science/pith/DYCLOLG3TTLPOIYO7JSEXAQDMF","bundle":"https://pith.science/pith/DYCLOLG3TTLPOIYO7JSEXAQDMF/bundle.json","state":"https://pith.science/pith/DYCLOLG3TTLPOIYO7JSEXAQDMF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DYCLOLG3TTLPOIYO7JSEXAQDMF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DYCLOLG3TTLPOIYO7JSEXAQDMF","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":"f000e057232a6c88192ccf162ddeadb388d047af4af196ecf2d783dfd7f01ee4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-14T13:43:24Z","title_canon_sha256":"5431bd8ee8c021e0f1b4b1b62a4271d63cc5c00a0631fcfef502421a7ef9e03d"},"schema_version":"1.0","source":{"id":"1907.07111","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07111","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07111v1","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07111","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"DYCLOLG3TTLP","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DYCLOLG3TTLPOIYO","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DYCLOLG3","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:ab2f292280e8b9d8a8e923c9598bae8c886eae56db18e4a24fde94458a354f2e","target":"graph","created_at":"2026-05-17T23:40:28Z","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":"Let $\\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $R=\\mathbb{F}_{2^m}+u\\mathbb{F}_{2^m}$ $(u^2=0)$ and $s,n$ be positive integers such that $n$ is odd. In this paper, we give an explicit representation for every self-dual cyclic code over the finite chain ring $R$ of length $2^sn$ and provide a calculation method to obtain all distinct codes. Moreover, we obtain a clear formula to count the number of all these self-dual cyclic codes. As an application, self-dual and $2$-quasi-cyclic codes over $\\mathbb{F}_{2^m}$ of length $2^{s+1}n$ can be obtained from self-dual cyclic code over ","authors_text":"Fanghui Ma, Fang-Wei Fu, Hai Q. Dinh, Yonglin Cao, Yuan Cao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-14T13:43:24Z","title":"Construction and enumeration for self-dual cyclic codes of even length over $\\mathbb{F}_{2^m} + u\\mathbb{F}_{2^m}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07111","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:30ea8c90762e4bc4930d7bfb1129fce66903678ffddb4169ebc7a29c034966a8","target":"record","created_at":"2026-05-17T23:40:28Z","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":"f000e057232a6c88192ccf162ddeadb388d047af4af196ecf2d783dfd7f01ee4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-14T13:43:24Z","title_canon_sha256":"5431bd8ee8c021e0f1b4b1b62a4271d63cc5c00a0631fcfef502421a7ef9e03d"},"schema_version":"1.0","source":{"id":"1907.07111","kind":"arxiv","version":1}},"canonical_sha256":"1e04b72cdb9cd6f7230efa644b8203617596fed7912f4c8e9719aa009dc4bcb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e04b72cdb9cd6f7230efa644b8203617596fed7912f4c8e9719aa009dc4bcb1","first_computed_at":"2026-05-17T23:40:28.048255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:28.048255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Grv9d+wPwtel2kvuKcwVVtOcf0xxQvJH/CjJGo7cH1qbwyJJKHKjip1KNGzRCAwvCAZI19Yrp2T8h/PfQ4eCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:28.048882Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07111","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30ea8c90762e4bc4930d7bfb1129fce66903678ffddb4169ebc7a29c034966a8","sha256:ab2f292280e8b9d8a8e923c9598bae8c886eae56db18e4a24fde94458a354f2e"],"state_sha256":"424995b8ed2cfb6ff05977123593ce9d84faa2de011a598469934aefb0cd1cd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rzHcIah5hlYD6FAWvB1az8KFIcI5yt7jr+DPiPkUgC3Te1Rihs0dy+C0gtuvTv/OvS3FFqXa6x75QSxRGQifCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:44:10.876161Z","bundle_sha256":"862a6903423196e5f1ccca6e00eafdd5d267cda2b1dfd2501becefad71af51dc"}}