{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZDEWC3R4VJETRQGNLMW2TGEDJR","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":"9878342f7cbec89cb55d7f36ec81003355f24ccf39e9e7022880339bbfc521aa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-08T13:44:43Z","title_canon_sha256":"17ec51c880c598aa1d3bcc45e7cd292a1c38446a5b232bcffcf4233cf582c79e"},"schema_version":"1.0","source":{"id":"1908.03070","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03070","created_at":"2026-07-04T23:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03070v1","created_at":"2026-07-04T23:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03070","created_at":"2026-07-04T23:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZDEWC3R4VJET","created_at":"2026-07-04T23:52:25Z"},{"alias_kind":"pith_short_16","alias_value":"ZDEWC3R4VJETRQGN","created_at":"2026-07-04T23:52:25Z"},{"alias_kind":"pith_short_8","alias_value":"ZDEWC3R4","created_at":"2026-07-04T23:52:25Z"}],"graph_snapshots":[{"event_id":"sha256:05671a9e5ba4c7a434516522bfef1f88e28cb6a4123f39c301c479352d6af513","target":"graph","created_at":"2026-07-04T23:52:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.03070/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"As a subclass of linear codes, cyclic codes have efficient encoding and decoding algorithms, so they are widely used in many areas such as consumer electronics, data storage systems and communication systems. In this paper, we give a general construction of optimal p-ary cyclic codes which leads to three explicit constructions. In addition, another class of p-ary optimal cyclic codes are presented.","authors_text":"Xiwang Cao, Yan Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-08T13:44:43Z","title":"Optimal p-ary cyclic codes with two zeros"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03070","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:9f41789b046001d7582ff55648fe84024e4f0ff878ab438170f6cf988ea0d837","target":"record","created_at":"2026-07-04T23:52:25Z","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":"9878342f7cbec89cb55d7f36ec81003355f24ccf39e9e7022880339bbfc521aa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-08T13:44:43Z","title_canon_sha256":"17ec51c880c598aa1d3bcc45e7cd292a1c38446a5b232bcffcf4233cf582c79e"},"schema_version":"1.0","source":{"id":"1908.03070","kind":"arxiv","version":1}},"canonical_sha256":"c8c9616e3caa4938c0cd5b2da998834c65cb497929a56ce504bd8cde9fbfb12b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8c9616e3caa4938c0cd5b2da998834c65cb497929a56ce504bd8cde9fbfb12b","first_computed_at":"2026-07-04T23:52:25.925339Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:52:25.925339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EIvpNnddNOl9WYhgjaGeMasWyowiUcGZzhMMnY95Mqbpcc+OQYEJaFCdKIv0uDLooketsg/ydCxT2UsXBT55BQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:52:25.925850Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03070","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f41789b046001d7582ff55648fe84024e4f0ff878ab438170f6cf988ea0d837","sha256:05671a9e5ba4c7a434516522bfef1f88e28cb6a4123f39c301c479352d6af513"],"state_sha256":"4be1071c4581c6cf7f688f81ac9b69785c7845fee0a7fd28e09d4686797a38d9"}