{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2R4SUSIOQ7DSVACTM6VA7VG7KS","short_pith_number":"pith:2R4SUSIO","canonical_record":{"source":{"id":"1806.02951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-08T02:48:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e6f72e4c36f5472bc9d489046a2db915deb8139ca36045fa86cc4e7d6a1ff705","abstract_canon_sha256":"400003eb9ac5024a0d63d58b7a7ae02942fd5398776466f33b0dc5c623f49673"},"schema_version":"1.0"},"canonical_sha256":"d4792a490e87c72a805367aa0fd4df54931a43524e3f243132ebe97415cb433e","source":{"kind":"arxiv","id":"1806.02951","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02951","created_at":"2026-05-18T00:13:54Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02951v1","created_at":"2026-05-18T00:13:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02951","created_at":"2026-05-18T00:13:54Z"},{"alias_kind":"pith_short_12","alias_value":"2R4SUSIOQ7DS","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2R4SUSIOQ7DSVACT","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2R4SUSIO","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2R4SUSIOQ7DSVACTM6VA7VG7KS","target":"record","payload":{"canonical_record":{"source":{"id":"1806.02951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-08T02:48:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e6f72e4c36f5472bc9d489046a2db915deb8139ca36045fa86cc4e7d6a1ff705","abstract_canon_sha256":"400003eb9ac5024a0d63d58b7a7ae02942fd5398776466f33b0dc5c623f49673"},"schema_version":"1.0"},"canonical_sha256":"d4792a490e87c72a805367aa0fd4df54931a43524e3f243132ebe97415cb433e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:54.188351Z","signature_b64":"uH1FnAi0zM2PLIDcKRqeJNn8TbkqfrwZzLsjkaFWDganaJ8SrQkN0DoSZORQ7oAQwH0BxzvZwjJts43NdHpRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4792a490e87c72a805367aa0fd4df54931a43524e3f243132ebe97415cb433e","last_reissued_at":"2026-05-18T00:13:54.187511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:54.187511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.02951","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:13:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hSgFh/xT/lO2gmFV5ET1h2AO8kgFFOEbzE9+PSmCMI5M1hp8bEyuTTO4ZlDlYKavgPwUSYogLXdqBP4/FxDcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:50:38.497920Z"},"content_sha256":"c0a9ee35f45d8c60efe34c0979f9cf053048e75f942a04830b96a07567dbe542","schema_version":"1.0","event_id":"sha256:c0a9ee35f45d8c60efe34c0979f9cf053048e75f942a04830b96a07567dbe542"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2R4SUSIOQ7DSVACTM6VA7VG7KS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On self-dual and LCD double circulant and double negacirculant codes over $\\mathbb{F}_q + u\\mathbb{F}_q$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongwei Zhu, Lin Sok, Liqin Qian, Minjia Shi, Patrick Sol\\'e","submitted_at":"2018-06-08T02:48:18Z","abstract_excerpt":"Double circulant codes of length $2n$ over the semilocal ring $R = \\mathbb{F}_q + u\\mathbb{F}_q,\\, u^2=u,$ are studied when $q$ is an odd prime power, and $-1$ is a square in $\\mathbb{F}_q.$ Double negacirculant codes of length $2n$ are studied over $R$ when $n$ is even and $q$ is an odd prime power. Exact enumeration of self-dual and LCD such codes for given length $2n$ is given. Employing a duality-preserving Gray map, self-dual and LCD codes of length $4n$ over $\\mathbb{F}_q$ are constructed. Using random coding and the Artin conjecture, the relative distance of these codes is bounded below"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02951","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:13:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+NaNS1DLoES7Es7+MgTt31zkYoR7LAtYvgb/gfNu4usqZwgKym1JDn/z2u2sNLBK6UfCH6rN7+LRW16RDPrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:50:38.498497Z"},"content_sha256":"584ad344d3884923e6f4d3bfe4c4592dabe3b3af3689c09e331501edcc6c0927","schema_version":"1.0","event_id":"sha256:584ad344d3884923e6f4d3bfe4c4592dabe3b3af3689c09e331501edcc6c0927"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2R4SUSIOQ7DSVACTM6VA7VG7KS/bundle.json","state_url":"https://pith.science/pith/2R4SUSIOQ7DSVACTM6VA7VG7KS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2R4SUSIOQ7DSVACTM6VA7VG7KS/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-18T22:50:38Z","links":{"resolver":"https://pith.science/pith/2R4SUSIOQ7DSVACTM6VA7VG7KS","bundle":"https://pith.science/pith/2R4SUSIOQ7DSVACTM6VA7VG7KS/bundle.json","state":"https://pith.science/pith/2R4SUSIOQ7DSVACTM6VA7VG7KS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2R4SUSIOQ7DSVACTM6VA7VG7KS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2R4SUSIOQ7DSVACTM6VA7VG7KS","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":"400003eb9ac5024a0d63d58b7a7ae02942fd5398776466f33b0dc5c623f49673","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-08T02:48:18Z","title_canon_sha256":"e6f72e4c36f5472bc9d489046a2db915deb8139ca36045fa86cc4e7d6a1ff705"},"schema_version":"1.0","source":{"id":"1806.02951","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02951","created_at":"2026-05-18T00:13:54Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02951v1","created_at":"2026-05-18T00:13:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02951","created_at":"2026-05-18T00:13:54Z"},{"alias_kind":"pith_short_12","alias_value":"2R4SUSIOQ7DS","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2R4SUSIOQ7DSVACT","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2R4SUSIO","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:584ad344d3884923e6f4d3bfe4c4592dabe3b3af3689c09e331501edcc6c0927","target":"graph","created_at":"2026-05-18T00:13:54Z","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":"Double circulant codes of length $2n$ over the semilocal ring $R = \\mathbb{F}_q + u\\mathbb{F}_q,\\, u^2=u,$ are studied when $q$ is an odd prime power, and $-1$ is a square in $\\mathbb{F}_q.$ Double negacirculant codes of length $2n$ are studied over $R$ when $n$ is even and $q$ is an odd prime power. Exact enumeration of self-dual and LCD such codes for given length $2n$ is given. Employing a duality-preserving Gray map, self-dual and LCD codes of length $4n$ over $\\mathbb{F}_q$ are constructed. Using random coding and the Artin conjecture, the relative distance of these codes is bounded below","authors_text":"Hongwei Zhu, Lin Sok, Liqin Qian, Minjia Shi, Patrick Sol\\'e","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-08T02:48:18Z","title":"On self-dual and LCD double circulant and double negacirculant codes over $\\mathbb{F}_q + u\\mathbb{F}_q$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02951","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:c0a9ee35f45d8c60efe34c0979f9cf053048e75f942a04830b96a07567dbe542","target":"record","created_at":"2026-05-18T00:13:54Z","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":"400003eb9ac5024a0d63d58b7a7ae02942fd5398776466f33b0dc5c623f49673","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-08T02:48:18Z","title_canon_sha256":"e6f72e4c36f5472bc9d489046a2db915deb8139ca36045fa86cc4e7d6a1ff705"},"schema_version":"1.0","source":{"id":"1806.02951","kind":"arxiv","version":1}},"canonical_sha256":"d4792a490e87c72a805367aa0fd4df54931a43524e3f243132ebe97415cb433e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4792a490e87c72a805367aa0fd4df54931a43524e3f243132ebe97415cb433e","first_computed_at":"2026-05-18T00:13:54.187511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:54.187511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uH1FnAi0zM2PLIDcKRqeJNn8TbkqfrwZzLsjkaFWDganaJ8SrQkN0DoSZORQ7oAQwH0BxzvZwjJts43NdHpRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:54.188351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02951","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0a9ee35f45d8c60efe34c0979f9cf053048e75f942a04830b96a07567dbe542","sha256:584ad344d3884923e6f4d3bfe4c4592dabe3b3af3689c09e331501edcc6c0927"],"state_sha256":"8d5738423d851cbb506a2886b75347c2f3d14cf9484f5c3d87519276e88e1615"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xZGWGZ75mm4jB9zrP5qlx1NntmCrhSwU/jYCfRUu8id1RT/XHwKFUO5O+cZ2MsLmLKJghmbSM7FM/XJX1btPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T22:50:38.500333Z","bundle_sha256":"9cad81eea0b98ab69f9534e083e0ff0556158a42fee290668fb45d0537d2e2bc"}}