{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PMMFXKEVYOK4QYZTDDLCRFB524","short_pith_number":"pith:PMMFXKEV","schema_version":"1.0","canonical_sha256":"7b185ba895c395c8633318d628943dd71e4250a5ae9f946299ed205bb4c70d83","source":{"kind":"arxiv","id":"1507.05732","version":1},"attestation_state":"computed","paper":{"title":"Complete Weight Enumerator of a Family of Linear Codes from Cyclotomy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chang-An Zhao, Shudi Yang, Zhang-An Yao","submitted_at":"2015-07-21T07:54:58Z","abstract_excerpt":"Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for a prime $p$, we determine the explicit complete weight enumerators of a family of linear codes over $\\mathbb{F}_p$ with defining set related to cyclotomy. These codes may have applications in cryptography and secret sharing schemes."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1507.05732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-21T07:54:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"41d583017c0137f3f1b00a96d8fa3c197475c103194760a79b5ed7194ebe2535","abstract_canon_sha256":"ad22c8a0c3b3262deb55052c235c649eaa2df05b6472b8b1cf7118c9e82f7a1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:32.627964Z","signature_b64":"d+ltj7oFoM3E/o/HS52ZOtUkmuGGnxCBleJeB9i67NKOP3Fw4nVmsAIbnSR74HUFq+TAsUnyvCO3gwnyWK4YCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b185ba895c395c8633318d628943dd71e4250a5ae9f946299ed205bb4c70d83","last_reissued_at":"2026-05-18T01:36:32.627421Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:32.627421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete Weight Enumerator of a Family of Linear Codes from Cyclotomy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chang-An Zhao, Shudi Yang, Zhang-An Yao","submitted_at":"2015-07-21T07:54:58Z","abstract_excerpt":"Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for a prime $p$, we determine the explicit complete weight enumerators of a family of linear codes over $\\mathbb{F}_p$ with defining set related to cyclotomy. These codes may have applications in cryptography and secret sharing schemes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05732","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.05732","created_at":"2026-05-18T01:36:32.627549+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05732v1","created_at":"2026-05-18T01:36:32.627549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05732","created_at":"2026-05-18T01:36:32.627549+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMMFXKEVYOK4","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMMFXKEVYOK4QYZT","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMMFXKEV","created_at":"2026-05-18T12:29:37.295048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PMMFXKEVYOK4QYZTDDLCRFB524","json":"https://pith.science/pith/PMMFXKEVYOK4QYZTDDLCRFB524.json","graph_json":"https://pith.science/api/pith-number/PMMFXKEVYOK4QYZTDDLCRFB524/graph.json","events_json":"https://pith.science/api/pith-number/PMMFXKEVYOK4QYZTDDLCRFB524/events.json","paper":"https://pith.science/paper/PMMFXKEV"},"agent_actions":{"view_html":"https://pith.science/pith/PMMFXKEVYOK4QYZTDDLCRFB524","download_json":"https://pith.science/pith/PMMFXKEVYOK4QYZTDDLCRFB524.json","view_paper":"https://pith.science/paper/PMMFXKEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05732&json=true","fetch_graph":"https://pith.science/api/pith-number/PMMFXKEVYOK4QYZTDDLCRFB524/graph.json","fetch_events":"https://pith.science/api/pith-number/PMMFXKEVYOK4QYZTDDLCRFB524/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMMFXKEVYOK4QYZTDDLCRFB524/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMMFXKEVYOK4QYZTDDLCRFB524/action/storage_attestation","attest_author":"https://pith.science/pith/PMMFXKEVYOK4QYZTDDLCRFB524/action/author_attestation","sign_citation":"https://pith.science/pith/PMMFXKEVYOK4QYZTDDLCRFB524/action/citation_signature","submit_replication":"https://pith.science/pith/PMMFXKEVYOK4QYZTDDLCRFB524/action/replication_record"}},"created_at":"2026-05-18T01:36:32.627549+00:00","updated_at":"2026-05-18T01:36:32.627549+00:00"}