{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:G3FDWK4UYFFGFI7OMCNVEQKRRY","short_pith_number":"pith:G3FDWK4U","canonical_record":{"source":{"id":"2606.31294","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-30T08:10:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"25fa0eb74c00adbc6bc5d5a320df5f4aa35a34111fbb99dbfaf14d2bea59635c","abstract_canon_sha256":"82293435da33c6fe37b6a25237f6aed24485843c855e4510abb3782c23b3d6c3"},"schema_version":"1.0"},"canonical_sha256":"36ca3b2b94c14a62a3ee609b5241518e289856562d4ceb0acdb0c1858e5dd946","source":{"kind":"arxiv","id":"2606.31294","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31294","created_at":"2026-07-01T01:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31294v1","created_at":"2026-07-01T01:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31294","created_at":"2026-07-01T01:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"G3FDWK4UYFFG","created_at":"2026-07-01T01:17:58Z"},{"alias_kind":"pith_short_16","alias_value":"G3FDWK4UYFFGFI7O","created_at":"2026-07-01T01:17:58Z"},{"alias_kind":"pith_short_8","alias_value":"G3FDWK4U","created_at":"2026-07-01T01:17:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:G3FDWK4UYFFGFI7OMCNVEQKRRY","target":"record","payload":{"canonical_record":{"source":{"id":"2606.31294","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-30T08:10:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"25fa0eb74c00adbc6bc5d5a320df5f4aa35a34111fbb99dbfaf14d2bea59635c","abstract_canon_sha256":"82293435da33c6fe37b6a25237f6aed24485843c855e4510abb3782c23b3d6c3"},"schema_version":"1.0"},"canonical_sha256":"36ca3b2b94c14a62a3ee609b5241518e289856562d4ceb0acdb0c1858e5dd946","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:17:58.351004Z","signature_b64":"Fkv2quLjiNukOxOMxY3kBgBcyu7PuI79BXiPCluXs+5sLcCAzNBokn1mgl50NGKQXpfjVbml3ZGk2RaqWmfgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36ca3b2b94c14a62a3ee609b5241518e289856562d4ceb0acdb0c1858e5dd946","last_reissued_at":"2026-07-01T01:17:58.350552Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:17:58.350552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.31294","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-07-01T01:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ddDeF3V5MyoqYuluiJFw7wVDGMbfpfS6jGsdbLq9wxxp2D9/eqs2NPm1NaDms6AoA2vZNwfzsD5RCIbx5QNICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:54:06.943806Z"},"content_sha256":"bce97c73343236dd7369693a9d17c4a7f9dbe866bff3fb0f31f0818844c6ad1b","schema_version":"1.0","event_id":"sha256:bce97c73343236dd7369693a9d17c4a7f9dbe866bff3fb0f31f0818844c6ad1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:G3FDWK4UYFFGFI7OMCNVEQKRRY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-Dual Cyclic Codes with Improved Minimum Distance Estimates via Extending the Chen-Ding Construction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bofeng Huang, Chang-An Zhao, Jingwei Zhang","submitted_at":"2026-06-30T08:10:38Z","abstract_excerpt":"Self-dual cyclic codes have garnered significant interest owing to their rich algebraic structures and wide-ranging applicability. Their construction and the establishment of lower bounds on their minimum distances are fundamental problems in coding theory. Chen and Ding laid an important foundation for the construction of self-dual cyclic codes in the case where the multiplicative order of $q$ module $n$, denoted by $\\operatorname{ord}_n(q)$, is odd. Building on their work, we extend the investigation to the case of even order $\\operatorname{ord}_n(q)$ and demonstrate that the minimum distanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31294","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.31294/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-01T01:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3OhUDWysdx4XgeJbEPLlN9kFxR38lBjRgxh9zQvOt5L4iHt7NtZlorbqoiJUyWpzRWMAUc0pNIq//IeYVvsaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:54:06.944342Z"},"content_sha256":"da6987eefc5b99a1e7e7446f1a594c44655ff1d0c921905835b5fecc353ff4f8","schema_version":"1.0","event_id":"sha256:da6987eefc5b99a1e7e7446f1a594c44655ff1d0c921905835b5fecc353ff4f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G3FDWK4UYFFGFI7OMCNVEQKRRY/bundle.json","state_url":"https://pith.science/pith/G3FDWK4UYFFGFI7OMCNVEQKRRY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G3FDWK4UYFFGFI7OMCNVEQKRRY/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-08-17T12:54:06Z","links":{"resolver":"https://pith.science/pith/G3FDWK4UYFFGFI7OMCNVEQKRRY","bundle":"https://pith.science/pith/G3FDWK4UYFFGFI7OMCNVEQKRRY/bundle.json","state":"https://pith.science/pith/G3FDWK4UYFFGFI7OMCNVEQKRRY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G3FDWK4UYFFGFI7OMCNVEQKRRY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:G3FDWK4UYFFGFI7OMCNVEQKRRY","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":"82293435da33c6fe37b6a25237f6aed24485843c855e4510abb3782c23b3d6c3","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-30T08:10:38Z","title_canon_sha256":"25fa0eb74c00adbc6bc5d5a320df5f4aa35a34111fbb99dbfaf14d2bea59635c"},"schema_version":"1.0","source":{"id":"2606.31294","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31294","created_at":"2026-07-01T01:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31294v1","created_at":"2026-07-01T01:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31294","created_at":"2026-07-01T01:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"G3FDWK4UYFFG","created_at":"2026-07-01T01:17:58Z"},{"alias_kind":"pith_short_16","alias_value":"G3FDWK4UYFFGFI7O","created_at":"2026-07-01T01:17:58Z"},{"alias_kind":"pith_short_8","alias_value":"G3FDWK4U","created_at":"2026-07-01T01:17:58Z"}],"graph_snapshots":[{"event_id":"sha256:da6987eefc5b99a1e7e7446f1a594c44655ff1d0c921905835b5fecc353ff4f8","target":"graph","created_at":"2026-07-01T01:17:58Z","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/2606.31294/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Self-dual cyclic codes have garnered significant interest owing to their rich algebraic structures and wide-ranging applicability. Their construction and the establishment of lower bounds on their minimum distances are fundamental problems in coding theory. Chen and Ding laid an important foundation for the construction of self-dual cyclic codes in the case where the multiplicative order of $q$ module $n$, denoted by $\\operatorname{ord}_n(q)$, is odd. Building on their work, we extend the investigation to the case of even order $\\operatorname{ord}_n(q)$ and demonstrate that the minimum distanc","authors_text":"Bofeng Huang, Chang-An Zhao, Jingwei Zhang","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-30T08:10:38Z","title":"Self-Dual Cyclic Codes with Improved Minimum Distance Estimates via Extending the Chen-Ding Construction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31294","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:bce97c73343236dd7369693a9d17c4a7f9dbe866bff3fb0f31f0818844c6ad1b","target":"record","created_at":"2026-07-01T01:17:58Z","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":"82293435da33c6fe37b6a25237f6aed24485843c855e4510abb3782c23b3d6c3","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-30T08:10:38Z","title_canon_sha256":"25fa0eb74c00adbc6bc5d5a320df5f4aa35a34111fbb99dbfaf14d2bea59635c"},"schema_version":"1.0","source":{"id":"2606.31294","kind":"arxiv","version":1}},"canonical_sha256":"36ca3b2b94c14a62a3ee609b5241518e289856562d4ceb0acdb0c1858e5dd946","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36ca3b2b94c14a62a3ee609b5241518e289856562d4ceb0acdb0c1858e5dd946","first_computed_at":"2026-07-01T01:17:58.350552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-01T01:17:58.350552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fkv2quLjiNukOxOMxY3kBgBcyu7PuI79BXiPCluXs+5sLcCAzNBokn1mgl50NGKQXpfjVbml3ZGk2RaqWmfgDw==","signature_status":"signed_v1","signed_at":"2026-07-01T01:17:58.351004Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.31294","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bce97c73343236dd7369693a9d17c4a7f9dbe866bff3fb0f31f0818844c6ad1b","sha256:da6987eefc5b99a1e7e7446f1a594c44655ff1d0c921905835b5fecc353ff4f8"],"state_sha256":"91c64be1bcc1b566ff92dfbd44227d9322db9c306722e79b627ffb91842b8954"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9xhfmvV32RccK1R3/gHxf0HoaBdCMMV36tm7hRtuHizRNkkVzShpMTeinRoerQ1yW8u01TlbZ6BtwzugHqx3Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T12:54:06.949186Z","bundle_sha256":"bb82eb668682d5a169396475f2618cd37c31c5037f9fbbc2b958659558b45468"}}