{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:73PN3BAFLKVUYJQO4OSVJQJTX4","short_pith_number":"pith:73PN3BAF","canonical_record":{"source":{"id":"1701.02075","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T06:55:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4f9e42710a5ae14ba2c47603ceafe1d68a4ecd25a33ca8cabebb3f85036ed388","abstract_canon_sha256":"2928edbd20719c86615efafa82c3f56bd89d5243be5212d2db57f62df3862ecd"},"schema_version":"1.0"},"canonical_sha256":"fededd84055aab4c260ee3a554c133bf2594d494f89b6ea58eff491abd217037","source":{"kind":"arxiv","id":"1701.02075","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02075","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02075v3","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02075","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"pith_short_12","alias_value":"73PN3BAFLKVU","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"73PN3BAFLKVUYJQO","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"73PN3BAF","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:73PN3BAFLKVUYJQO4OSVJQJTX4","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02075","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T06:55:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4f9e42710a5ae14ba2c47603ceafe1d68a4ecd25a33ca8cabebb3f85036ed388","abstract_canon_sha256":"2928edbd20719c86615efafa82c3f56bd89d5243be5212d2db57f62df3862ecd"},"schema_version":"1.0"},"canonical_sha256":"fededd84055aab4c260ee3a554c133bf2594d494f89b6ea58eff491abd217037","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:51.405464Z","signature_b64":"0K48jrsBhY1YwSactTPUFfv/Zhl3ZL8GeHgYmMdgnMd2wKLGu2dR2g1FxBtiZraol93fez053QWkAs6F7sloBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fededd84055aab4c260ee3a554c133bf2594d494f89b6ea58eff491abd217037","last_reissued_at":"2026-05-18T00:46:51.404835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:51.404835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02075","source_version":3,"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:46:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/MEu+Ud2RtsxL9T4YchmplYXxzm/l+K8qscJfG0Yq7hCx1CvyMPKt1bZcPPagwaRPZu33yvbMkjDRtr6+tUWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:35:32.678365Z"},"content_sha256":"eb49fb8f0c43f01322f3fdacbaccb8e26f2d30c955e4d847dfffc2da9739b38e","schema_version":"1.0","event_id":"sha256:eb49fb8f0c43f01322f3fdacbaccb8e26f2d30c955e4d847dfffc2da9739b38e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:73PN3BAFLKVUYJQO4OSVJQJTX4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Construction of Linear Codes and Their Complete Weight Enumerators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chunming Tang, Shudi Yang, Xiangli Kong","submitted_at":"2017-01-09T06:55:52Z","abstract_excerpt":"Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and $\\text{Tr}$ be the absolute trace function from $\\mathbb{F}_r$ onto $\\mathbb{F}_p$. In this paper, we give a construction of linear codes by defining the code $ C_{D}=\\{(\\mathrm{Tr}(ax))_{x\\in D}: a \\in \\mathbb{F}_{r} \\}, $ where $ D =\\left\\{x\\in \\mathbb{F}_{r} : \\mathrm{Tr}(x)=1, \\mathrm{Tr}(x^2)=0 \\right\\}. $ Its complete weight enumerator and weight enumerator ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02075","kind":"arxiv","version":3},"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:46:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EwEokMFH7I9zagxv3K3NemesHikpeqBZTBlIxp54DAICgpfWvXhrbQxeU4gyv2Hpa4funjIIRZk1Jdl8mw6JDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:35:32.678705Z"},"content_sha256":"c2c0e39f6bf891b84e243798f2ba604e4136188eeed8996e2e8546a4218251db","schema_version":"1.0","event_id":"sha256:c2c0e39f6bf891b84e243798f2ba604e4136188eeed8996e2e8546a4218251db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/73PN3BAFLKVUYJQO4OSVJQJTX4/bundle.json","state_url":"https://pith.science/pith/73PN3BAFLKVUYJQO4OSVJQJTX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/73PN3BAFLKVUYJQO4OSVJQJTX4/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-28T14:35:32Z","links":{"resolver":"https://pith.science/pith/73PN3BAFLKVUYJQO4OSVJQJTX4","bundle":"https://pith.science/pith/73PN3BAFLKVUYJQO4OSVJQJTX4/bundle.json","state":"https://pith.science/pith/73PN3BAFLKVUYJQO4OSVJQJTX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/73PN3BAFLKVUYJQO4OSVJQJTX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:73PN3BAFLKVUYJQO4OSVJQJTX4","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":"2928edbd20719c86615efafa82c3f56bd89d5243be5212d2db57f62df3862ecd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T06:55:52Z","title_canon_sha256":"4f9e42710a5ae14ba2c47603ceafe1d68a4ecd25a33ca8cabebb3f85036ed388"},"schema_version":"1.0","source":{"id":"1701.02075","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02075","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02075v3","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02075","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"pith_short_12","alias_value":"73PN3BAFLKVU","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"73PN3BAFLKVUYJQO","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"73PN3BAF","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:c2c0e39f6bf891b84e243798f2ba604e4136188eeed8996e2e8546a4218251db","target":"graph","created_at":"2026-05-18T00:46:51Z","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":"Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and $\\text{Tr}$ be the absolute trace function from $\\mathbb{F}_r$ onto $\\mathbb{F}_p$. In this paper, we give a construction of linear codes by defining the code $ C_{D}=\\{(\\mathrm{Tr}(ax))_{x\\in D}: a \\in \\mathbb{F}_{r} \\}, $ where $ D =\\left\\{x\\in \\mathbb{F}_{r} : \\mathrm{Tr}(x)=1, \\mathrm{Tr}(x^2)=0 \\right\\}. $ Its complete weight enumerator and weight enumerator ar","authors_text":"Chunming Tang, Shudi Yang, Xiangli Kong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T06:55:52Z","title":"A Construction of Linear Codes and Their Complete Weight Enumerators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02075","kind":"arxiv","version":3},"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:eb49fb8f0c43f01322f3fdacbaccb8e26f2d30c955e4d847dfffc2da9739b38e","target":"record","created_at":"2026-05-18T00:46:51Z","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":"2928edbd20719c86615efafa82c3f56bd89d5243be5212d2db57f62df3862ecd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T06:55:52Z","title_canon_sha256":"4f9e42710a5ae14ba2c47603ceafe1d68a4ecd25a33ca8cabebb3f85036ed388"},"schema_version":"1.0","source":{"id":"1701.02075","kind":"arxiv","version":3}},"canonical_sha256":"fededd84055aab4c260ee3a554c133bf2594d494f89b6ea58eff491abd217037","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fededd84055aab4c260ee3a554c133bf2594d494f89b6ea58eff491abd217037","first_computed_at":"2026-05-18T00:46:51.404835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:51.404835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0K48jrsBhY1YwSactTPUFfv/Zhl3ZL8GeHgYmMdgnMd2wKLGu2dR2g1FxBtiZraol93fez053QWkAs6F7sloBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:51.405464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02075","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb49fb8f0c43f01322f3fdacbaccb8e26f2d30c955e4d847dfffc2da9739b38e","sha256:c2c0e39f6bf891b84e243798f2ba604e4136188eeed8996e2e8546a4218251db"],"state_sha256":"cfad4f90c77e14484a9d18744945dcf45ab39ddd1db88585c5d8532df9b80925"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/2FHrggZ3Wt780qaWYNHVP1MltGKPZ5uEOlYo+X9e9sgSdZcsWsLF8hIscZAsz2an+29c/YAv91W8mzJxIKBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:35:32.680663Z","bundle_sha256":"9656874cac207b99b007e10e6558094709aa35c6f858af6d4a827278c5d059a3"}}