{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QV3QXI6EYO2SHD7HOI47PENL7H","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":"1676b4a4be05677ba50aa4c968d9d62061a9a0550660a9ea1e0b2ea75d117589","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-05T01:46:46Z","title_canon_sha256":"c4d385d7289dc7de7c407a40be13d4b6d023e3d11b6c8babd48a9e95e0fb5272"},"schema_version":"1.0","source":{"id":"1309.1218","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1218","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1218v1","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1218","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"QV3QXI6EYO2S","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QV3QXI6EYO2SHD7H","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QV3QXI6E","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:76c6a09916c35f7aed2f5176de2d6bda93e1334f6ab147d9cab2cb764e925212","target":"graph","created_at":"2026-05-18T03:14:07Z","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":"Cyclic codes are an important subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics. In this paper, two families of optimal ternary cyclic codes are presented. The first family of cyclic codes has parameters $[3^m-1, 3^m-1-2m, 4]$ and contains a class of conjectured cyclic codes and several new classes of optimal cyclic codes. The second family of cyclic codes has parameters $[3^m-1, 3^m-2-2m, 5]$ and contains a number of classes of cyclic codes that are obtained from perfect nonlinear functions over $\\fthreem$, where $m>1$ ","authors_text":"Chunlei Li, Cunsheng Ding, Nian Li, Tor Helleseth, Xiaohu Tang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-05T01:46:46Z","title":"Optimal Ternary Cyclic Codes with Minimum Distance Four and Five"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1218","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:30760e35d5a1e934fc34912aceb62a34a8c879a23cd1c6a87f26eeb8a67d7cb7","target":"record","created_at":"2026-05-18T03:14:07Z","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":"1676b4a4be05677ba50aa4c968d9d62061a9a0550660a9ea1e0b2ea75d117589","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-05T01:46:46Z","title_canon_sha256":"c4d385d7289dc7de7c407a40be13d4b6d023e3d11b6c8babd48a9e95e0fb5272"},"schema_version":"1.0","source":{"id":"1309.1218","kind":"arxiv","version":1}},"canonical_sha256":"85770ba3c4c3b5238fe77239f791abf9f13e75657780a1a70d973121fc04aeb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85770ba3c4c3b5238fe77239f791abf9f13e75657780a1a70d973121fc04aeb5","first_computed_at":"2026-05-18T03:14:07.959291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:07.959291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MnfxNYJMAXe+aJKP4SUwDqfAfvFfo9I9y5XjVKNLKtXUYAp9RQz4BZmLdlEz1GgKOLkYygqs6yLRzqlubqwtBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:07.959886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1218","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30760e35d5a1e934fc34912aceb62a34a8c879a23cd1c6a87f26eeb8a67d7cb7","sha256:76c6a09916c35f7aed2f5176de2d6bda93e1334f6ab147d9cab2cb764e925212"],"state_sha256":"f19e023972d136b11d5238deb2171c5e3aaa84d84a61c6f01b70deff248bfc16"}