{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IFVOB6N3DBVMFRX5Q45C3U57KE","short_pith_number":"pith:IFVOB6N3","canonical_record":{"source":{"id":"1901.08230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-24T04:32:07Z","cross_cats_sorted":["cs.IT","math.IT","math.NT"],"title_canon_sha256":"7af6a33942e214b61f6f47cca8c1750d9f35d15a4aeb7d2cfa724afc1b76ac5d","abstract_canon_sha256":"6567a785827e18745e95d10f0c9a9354e4dd314636c6246690837ad4e0d99339"},"schema_version":"1.0"},"canonical_sha256":"416ae0f9bb186ac2c6fd873a2dd3bf5135a1813f64d0ebb263b5ba3d1b93e41a","source":{"kind":"arxiv","id":"1901.08230","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08230","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08230v1","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08230","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"pith_short_12","alias_value":"IFVOB6N3DBVM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IFVOB6N3DBVMFRX5","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IFVOB6N3","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IFVOB6N3DBVMFRX5Q45C3U57KE","target":"record","payload":{"canonical_record":{"source":{"id":"1901.08230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-24T04:32:07Z","cross_cats_sorted":["cs.IT","math.IT","math.NT"],"title_canon_sha256":"7af6a33942e214b61f6f47cca8c1750d9f35d15a4aeb7d2cfa724afc1b76ac5d","abstract_canon_sha256":"6567a785827e18745e95d10f0c9a9354e4dd314636c6246690837ad4e0d99339"},"schema_version":"1.0"},"canonical_sha256":"416ae0f9bb186ac2c6fd873a2dd3bf5135a1813f64d0ebb263b5ba3d1b93e41a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:37.598893Z","signature_b64":"7z+nnTSizGCANvm47pDFZ3e0RxmtTpQGqf8YMd0kn1koukG0TH4PTewmpZ48WLouQdVVTXd6wTU8iBtBbgWoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"416ae0f9bb186ac2c6fd873a2dd3bf5135a1813f64d0ebb263b5ba3d1b93e41a","last_reissued_at":"2026-05-17T23:55:37.598481Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:37.598481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.08230","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-17T23:55:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TAAYj3ZJnxdiso5VReyAHSwSoJvTd/kqosXyhNp0sxfJvvWNF3y0ZJrVSb4s1YVuQuv9uiNf6oPIBm+eCadfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:18:07.049071Z"},"content_sha256":"da412ce6be40fb2368dcf54e204a1de3ff08a18c2fcd32d2ab1d53263aec320b","schema_version":"1.0","event_id":"sha256:da412ce6be40fb2368dcf54e204a1de3ff08a18c2fcd32d2ab1d53263aec320b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IFVOB6N3DBVMFRX5Q45C3U57KE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On an open problem about a class of optimal ternary cyclic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.NT"],"primary_cat":"math.CO","authors_text":"Dongchun Han, Haode Yan","submitted_at":"2019-01-24T04:32:07Z","abstract_excerpt":"Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems and communication systems as they have efficient encoding and decoding algorithms. In this paper, we settle an open problem about a class of optimal ternary cyclic codes which was proposed by Ding and Helleseth. Let $C_{(1,e)}$ be a cyclic code of length $3^m-1$ over GF(3) with two nonzeros $\\alpha$ and $\\alpha^e$, where $\\alpha$ is a generator of $GF(3^m)^*$ and e is a given integer. It is shown that $C_{(1,e)}$ is optimal with parameters $[3^m-1,3^m-1-2m,4]$ if one of the following"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08230","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-17T23:55:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sD6hdwNv9+uVO5nwXGao/IJmhNCnn2ubBjfuczhQsEnQZjJeibY9KCAgkW8XISNurMvnTodyhKZJy/0ro7eDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:18:07.049778Z"},"content_sha256":"5c293fab165aad3aecf4014a2d2b756929812874f85e454f2abf4049f62ead1e","schema_version":"1.0","event_id":"sha256:5c293fab165aad3aecf4014a2d2b756929812874f85e454f2abf4049f62ead1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFVOB6N3DBVMFRX5Q45C3U57KE/bundle.json","state_url":"https://pith.science/pith/IFVOB6N3DBVMFRX5Q45C3U57KE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFVOB6N3DBVMFRX5Q45C3U57KE/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-23T20:18:07Z","links":{"resolver":"https://pith.science/pith/IFVOB6N3DBVMFRX5Q45C3U57KE","bundle":"https://pith.science/pith/IFVOB6N3DBVMFRX5Q45C3U57KE/bundle.json","state":"https://pith.science/pith/IFVOB6N3DBVMFRX5Q45C3U57KE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFVOB6N3DBVMFRX5Q45C3U57KE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IFVOB6N3DBVMFRX5Q45C3U57KE","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":"6567a785827e18745e95d10f0c9a9354e4dd314636c6246690837ad4e0d99339","cross_cats_sorted":["cs.IT","math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-24T04:32:07Z","title_canon_sha256":"7af6a33942e214b61f6f47cca8c1750d9f35d15a4aeb7d2cfa724afc1b76ac5d"},"schema_version":"1.0","source":{"id":"1901.08230","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08230","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08230v1","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08230","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"pith_short_12","alias_value":"IFVOB6N3DBVM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IFVOB6N3DBVMFRX5","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IFVOB6N3","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:5c293fab165aad3aecf4014a2d2b756929812874f85e454f2abf4049f62ead1e","target":"graph","created_at":"2026-05-17T23:55:37Z","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 a subclass of linear codes and have applications in consumer electronics, data storage systems and communication systems as they have efficient encoding and decoding algorithms. In this paper, we settle an open problem about a class of optimal ternary cyclic codes which was proposed by Ding and Helleseth. Let $C_{(1,e)}$ be a cyclic code of length $3^m-1$ over GF(3) with two nonzeros $\\alpha$ and $\\alpha^e$, where $\\alpha$ is a generator of $GF(3^m)^*$ and e is a given integer. It is shown that $C_{(1,e)}$ is optimal with parameters $[3^m-1,3^m-1-2m,4]$ if one of the following","authors_text":"Dongchun Han, Haode Yan","cross_cats":["cs.IT","math.IT","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-24T04:32:07Z","title":"On an open problem about a class of optimal ternary cyclic codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08230","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:da412ce6be40fb2368dcf54e204a1de3ff08a18c2fcd32d2ab1d53263aec320b","target":"record","created_at":"2026-05-17T23:55:37Z","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":"6567a785827e18745e95d10f0c9a9354e4dd314636c6246690837ad4e0d99339","cross_cats_sorted":["cs.IT","math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-24T04:32:07Z","title_canon_sha256":"7af6a33942e214b61f6f47cca8c1750d9f35d15a4aeb7d2cfa724afc1b76ac5d"},"schema_version":"1.0","source":{"id":"1901.08230","kind":"arxiv","version":1}},"canonical_sha256":"416ae0f9bb186ac2c6fd873a2dd3bf5135a1813f64d0ebb263b5ba3d1b93e41a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"416ae0f9bb186ac2c6fd873a2dd3bf5135a1813f64d0ebb263b5ba3d1b93e41a","first_computed_at":"2026-05-17T23:55:37.598481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:37.598481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7z+nnTSizGCANvm47pDFZ3e0RxmtTpQGqf8YMd0kn1koukG0TH4PTewmpZ48WLouQdVVTXd6wTU8iBtBbgWoCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:37.598893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.08230","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da412ce6be40fb2368dcf54e204a1de3ff08a18c2fcd32d2ab1d53263aec320b","sha256:5c293fab165aad3aecf4014a2d2b756929812874f85e454f2abf4049f62ead1e"],"state_sha256":"4e88930cb5c96de37193834e93515d522df23174491f8a035ebe89208d63a0da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u+nuFicoX7s43nPixpG/sG7EBcnAPkDrvs7gIzBZ/yRgoRqWYpUuN3LciFk1NrqHoYRgTV8F1/1cOhK1aNZ6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T20:18:07.053434Z","bundle_sha256":"801a51f971e39f85042091de9ab53f5601960b0a855714073987585b2a01d338"}}