{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZXQGUXVB6FM6FHZCUDZER3NO33","short_pith_number":"pith:ZXQGUXVB","canonical_record":{"source":{"id":"2402.02853","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2024-02-05T10:07:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d82d44e5deef6795952ef6bdbfbd2939b367f470c52df7d62ffd43c0c8768887","abstract_canon_sha256":"cdc6f26281e390e9e40227f606516c33b815d3181c3c66cfa6e9ec20224feab1"},"schema_version":"1.0"},"canonical_sha256":"cde06a5ea1f159e29f22a0f248edaedec4f34a25f511baea25b5db1e25daeea4","source":{"kind":"arxiv","id":"2402.02853","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.02853","created_at":"2026-07-05T08:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"2402.02853v2","created_at":"2026-07-05T08:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.02853","created_at":"2026-07-05T08:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZXQGUXVB6FM6","created_at":"2026-07-05T08:21:49Z"},{"alias_kind":"pith_short_16","alias_value":"ZXQGUXVB6FM6FHZC","created_at":"2026-07-05T08:21:49Z"},{"alias_kind":"pith_short_8","alias_value":"ZXQGUXVB","created_at":"2026-07-05T08:21:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZXQGUXVB6FM6FHZCUDZER3NO33","target":"record","payload":{"canonical_record":{"source":{"id":"2402.02853","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2024-02-05T10:07:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d82d44e5deef6795952ef6bdbfbd2939b367f470c52df7d62ffd43c0c8768887","abstract_canon_sha256":"cdc6f26281e390e9e40227f606516c33b815d3181c3c66cfa6e9ec20224feab1"},"schema_version":"1.0"},"canonical_sha256":"cde06a5ea1f159e29f22a0f248edaedec4f34a25f511baea25b5db1e25daeea4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:21:49.463658Z","signature_b64":"oCoi0k8YW7chkA+nSOloXxW001KxTUJvmxw8HUpLhooZ/72ALnTHGuhuufHXXKftM4Euw9LleuzMR8/uPcaJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cde06a5ea1f159e29f22a0f248edaedec4f34a25f511baea25b5db1e25daeea4","last_reissued_at":"2026-07-05T08:21:49.463170Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:21:49.463170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.02853","source_version":2,"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-07-05T08:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NlHSv+QZSw1YimLmsSP14xAVfuUj0PbY7Uwh6Ji9vr67DM64q4WhLk2ScwdWNBQFAmRLX8uBL3h6h2z9FpELDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:43:15.391852Z"},"content_sha256":"b6379fa17ff3cc0ed36d75e12e91d1bfe82101bb83fdeaaea1182ff1baf0cfcb","schema_version":"1.0","event_id":"sha256:b6379fa17ff3cc0ed36d75e12e91d1bfe82101bb83fdeaaea1182ff1baf0cfcb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZXQGUXVB6FM6FHZCUDZER3NO33","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Repeated-Root Cyclic Codes with Optimal Parameters or Best Parameters Known","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Conghui Xie, Cunsheng Ding, Hao Chen","submitted_at":"2024-02-05T10:07:37Z","abstract_excerpt":"Cyclic codes are the most studied subclass of linear codes and widely used in data storage and communication systems. Many cyclic codes have optimal parameters or the best parameters known. They are divided into simple-root cyclic codes and repeated-root cyclic codes. Although there are a huge number of references on cyclic codes, few of them are on repeated-root cyclic codes. Hence, repeated-root cyclic codes are rarely studied. There are a few families of distance-optimal repeated-root binary and $p$-ary cyclic codes for odd prime $p$ in the literature. However, it is open whether there exis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.02853","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.02853/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RqmIN5fsfVcE7uVq91phE2xp1NN/y6GueswdrC+llCjZGb0/bxox7Qce1VxEfVquH99MT5azFJXrH769JsrCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:43:15.392224Z"},"content_sha256":"d36b7eea596e9b4cd439cad602cc6ae9b195b38fd716e3e175f4a1b60dc66d7b","schema_version":"1.0","event_id":"sha256:d36b7eea596e9b4cd439cad602cc6ae9b195b38fd716e3e175f4a1b60dc66d7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXQGUXVB6FM6FHZCUDZER3NO33/bundle.json","state_url":"https://pith.science/pith/ZXQGUXVB6FM6FHZCUDZER3NO33/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXQGUXVB6FM6FHZCUDZER3NO33/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-07-07T09:43:15Z","links":{"resolver":"https://pith.science/pith/ZXQGUXVB6FM6FHZCUDZER3NO33","bundle":"https://pith.science/pith/ZXQGUXVB6FM6FHZCUDZER3NO33/bundle.json","state":"https://pith.science/pith/ZXQGUXVB6FM6FHZCUDZER3NO33/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXQGUXVB6FM6FHZCUDZER3NO33/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZXQGUXVB6FM6FHZCUDZER3NO33","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":"cdc6f26281e390e9e40227f606516c33b815d3181c3c66cfa6e9ec20224feab1","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2024-02-05T10:07:37Z","title_canon_sha256":"d82d44e5deef6795952ef6bdbfbd2939b367f470c52df7d62ffd43c0c8768887"},"schema_version":"1.0","source":{"id":"2402.02853","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.02853","created_at":"2026-07-05T08:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"2402.02853v2","created_at":"2026-07-05T08:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.02853","created_at":"2026-07-05T08:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZXQGUXVB6FM6","created_at":"2026-07-05T08:21:49Z"},{"alias_kind":"pith_short_16","alias_value":"ZXQGUXVB6FM6FHZC","created_at":"2026-07-05T08:21:49Z"},{"alias_kind":"pith_short_8","alias_value":"ZXQGUXVB","created_at":"2026-07-05T08:21:49Z"}],"graph_snapshots":[{"event_id":"sha256:d36b7eea596e9b4cd439cad602cc6ae9b195b38fd716e3e175f4a1b60dc66d7b","target":"graph","created_at":"2026-07-05T08:21:49Z","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/2402.02853/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Cyclic codes are the most studied subclass of linear codes and widely used in data storage and communication systems. Many cyclic codes have optimal parameters or the best parameters known. They are divided into simple-root cyclic codes and repeated-root cyclic codes. Although there are a huge number of references on cyclic codes, few of them are on repeated-root cyclic codes. Hence, repeated-root cyclic codes are rarely studied. There are a few families of distance-optimal repeated-root binary and $p$-ary cyclic codes for odd prime $p$ in the literature. However, it is open whether there exis","authors_text":"Conghui Xie, Cunsheng Ding, Hao Chen","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2024-02-05T10:07:37Z","title":"Repeated-Root Cyclic Codes with Optimal Parameters or Best Parameters Known"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.02853","kind":"arxiv","version":2},"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:b6379fa17ff3cc0ed36d75e12e91d1bfe82101bb83fdeaaea1182ff1baf0cfcb","target":"record","created_at":"2026-07-05T08:21:49Z","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":"cdc6f26281e390e9e40227f606516c33b815d3181c3c66cfa6e9ec20224feab1","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2024-02-05T10:07:37Z","title_canon_sha256":"d82d44e5deef6795952ef6bdbfbd2939b367f470c52df7d62ffd43c0c8768887"},"schema_version":"1.0","source":{"id":"2402.02853","kind":"arxiv","version":2}},"canonical_sha256":"cde06a5ea1f159e29f22a0f248edaedec4f34a25f511baea25b5db1e25daeea4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cde06a5ea1f159e29f22a0f248edaedec4f34a25f511baea25b5db1e25daeea4","first_computed_at":"2026-07-05T08:21:49.463170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:21:49.463170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oCoi0k8YW7chkA+nSOloXxW001KxTUJvmxw8HUpLhooZ/72ALnTHGuhuufHXXKftM4Euw9LleuzMR8/uPcaJCw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:21:49.463658Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.02853","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6379fa17ff3cc0ed36d75e12e91d1bfe82101bb83fdeaaea1182ff1baf0cfcb","sha256:d36b7eea596e9b4cd439cad602cc6ae9b195b38fd716e3e175f4a1b60dc66d7b"],"state_sha256":"8c746cd136931fc3a664d530d15a1eb54dc7ee78814662fc2534a6e574bc4242"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rls5Anu1P9oXkzbKZoXeueTiWZ5kUIe8tappOpywcZxKViz+K/7UeMaXH5XXwN5IHSQdPlO5Li/5WWGWlBxpAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:43:15.394261Z","bundle_sha256":"565c2d2bc5b9e95c4d480bff3ee03f021b43207d32ead945d30a6020ea0b5e78"}}