{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HBPKSNMKFUA6W2ZACNVWWZS6SD","short_pith_number":"pith:HBPKSNMK","canonical_record":{"source":{"id":"1301.6231","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-26T10:47:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d51ae85469da439275009164c28320f8822267245b355f8b3ebdc3437a20b8c0","abstract_canon_sha256":"ee5b71d4e85f67d7d0c360960b9c691e183b27dd305a354fc5ea48af29632e70"},"schema_version":"1.0"},"canonical_sha256":"385ea9358a2d01eb6b20136b6b665e90f30128eb44deac42fa17b807e2815e2d","source":{"kind":"arxiv","id":"1301.6231","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6231","created_at":"2026-05-18T03:19:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6231v2","created_at":"2026-05-18T03:19:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6231","created_at":"2026-05-18T03:19:45Z"},{"alias_kind":"pith_short_12","alias_value":"HBPKSNMKFUA6","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HBPKSNMKFUA6W2ZA","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HBPKSNMK","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HBPKSNMKFUA6W2ZACNVWWZS6SD","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6231","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-26T10:47:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d51ae85469da439275009164c28320f8822267245b355f8b3ebdc3437a20b8c0","abstract_canon_sha256":"ee5b71d4e85f67d7d0c360960b9c691e183b27dd305a354fc5ea48af29632e70"},"schema_version":"1.0"},"canonical_sha256":"385ea9358a2d01eb6b20136b6b665e90f30128eb44deac42fa17b807e2815e2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:45.721648Z","signature_b64":"YX+sQ7pMDqLuZQXXzT73z7R+OPOk3sfJusQHLpKrclYAl6dtWKGHUrwjT5zhbWjndDV6OSur5TzJKX9tMC4JDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"385ea9358a2d01eb6b20136b6b665e90f30128eb44deac42fa17b807e2815e2d","last_reissued_at":"2026-05-18T03:19:45.720837Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:45.720837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6231","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-05-18T03:19:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4oDAm151VWO8oZr5cOqwauKXP/wKYq7oEdPnjIOZBEuiCp2H1BBtSM1gFf2wF7odwTlRrPdRJi4lm5f5o1LfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T03:46:57.834516Z"},"content_sha256":"64cb525a1feb2634401a6f3847ae8f209620be3eb53caad52f1bfb4eeba1a912","schema_version":"1.0","event_id":"sha256:64cb525a1feb2634401a6f3847ae8f209620be3eb53caad52f1bfb4eeba1a912"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HBPKSNMKFUA6W2ZACNVWWZS6SD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Zeh, Antonia Wachter-Zeh, Maximilien Gadouleau, Sergey Bezzateev","submitted_at":"2013-01-26T10:47:19Z","abstract_excerpt":"Two generalizations of the Hartmann--Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a cyclic product code. Furthermore, we show that unique decoding up to this bound is always possible and outline a quadratic-time syndrome-based error decoding algorithm. The second bound is stronger and the proof is more involved.\n  Our technique of embedding the code into a cyclic product code can be applied to other bounds, too and therefore generalizes them."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6231","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":""},"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-18T03:19:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AlNESrxoCxClFEwOR5CSP+pPB9/7Z/W+R0J2hcCPcLmWyNH3TLr4wVU/abhH6TIVHJ33ohrhNpl42tMey0D+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T03:46:57.834862Z"},"content_sha256":"c8be9fc95be1a0005a28cfa0089949b6cddaa20d4ca66162c4ead7f5ad4bdad7","schema_version":"1.0","event_id":"sha256:c8be9fc95be1a0005a28cfa0089949b6cddaa20d4ca66162c4ead7f5ad4bdad7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HBPKSNMKFUA6W2ZACNVWWZS6SD/bundle.json","state_url":"https://pith.science/pith/HBPKSNMKFUA6W2ZACNVWWZS6SD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HBPKSNMKFUA6W2ZACNVWWZS6SD/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-06-21T03:46:57Z","links":{"resolver":"https://pith.science/pith/HBPKSNMKFUA6W2ZACNVWWZS6SD","bundle":"https://pith.science/pith/HBPKSNMKFUA6W2ZACNVWWZS6SD/bundle.json","state":"https://pith.science/pith/HBPKSNMKFUA6W2ZACNVWWZS6SD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HBPKSNMKFUA6W2ZACNVWWZS6SD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HBPKSNMKFUA6W2ZACNVWWZS6SD","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":"ee5b71d4e85f67d7d0c360960b9c691e183b27dd305a354fc5ea48af29632e70","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-26T10:47:19Z","title_canon_sha256":"d51ae85469da439275009164c28320f8822267245b355f8b3ebdc3437a20b8c0"},"schema_version":"1.0","source":{"id":"1301.6231","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6231","created_at":"2026-05-18T03:19:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6231v2","created_at":"2026-05-18T03:19:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6231","created_at":"2026-05-18T03:19:45Z"},{"alias_kind":"pith_short_12","alias_value":"HBPKSNMKFUA6","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HBPKSNMKFUA6W2ZA","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HBPKSNMK","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:c8be9fc95be1a0005a28cfa0089949b6cddaa20d4ca66162c4ead7f5ad4bdad7","target":"graph","created_at":"2026-05-18T03:19:45Z","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":"Two generalizations of the Hartmann--Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a cyclic product code. Furthermore, we show that unique decoding up to this bound is always possible and outline a quadratic-time syndrome-based error decoding algorithm. The second bound is stronger and the proof is more involved.\n  Our technique of embedding the code into a cyclic product code can be applied to other bounds, too and therefore generalizes them.","authors_text":"Alexander Zeh, Antonia Wachter-Zeh, Maximilien Gadouleau, Sergey Bezzateev","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-26T10:47:19Z","title":"Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6231","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:64cb525a1feb2634401a6f3847ae8f209620be3eb53caad52f1bfb4eeba1a912","target":"record","created_at":"2026-05-18T03:19:45Z","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":"ee5b71d4e85f67d7d0c360960b9c691e183b27dd305a354fc5ea48af29632e70","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-26T10:47:19Z","title_canon_sha256":"d51ae85469da439275009164c28320f8822267245b355f8b3ebdc3437a20b8c0"},"schema_version":"1.0","source":{"id":"1301.6231","kind":"arxiv","version":2}},"canonical_sha256":"385ea9358a2d01eb6b20136b6b665e90f30128eb44deac42fa17b807e2815e2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"385ea9358a2d01eb6b20136b6b665e90f30128eb44deac42fa17b807e2815e2d","first_computed_at":"2026-05-18T03:19:45.720837Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:45.720837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YX+sQ7pMDqLuZQXXzT73z7R+OPOk3sfJusQHLpKrclYAl6dtWKGHUrwjT5zhbWjndDV6OSur5TzJKX9tMC4JDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:45.721648Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6231","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64cb525a1feb2634401a6f3847ae8f209620be3eb53caad52f1bfb4eeba1a912","sha256:c8be9fc95be1a0005a28cfa0089949b6cddaa20d4ca66162c4ead7f5ad4bdad7"],"state_sha256":"3508223ea91598e9d05b9d7e9220b9beab3feaeb29a5a203e9670228ec71b734"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7EMLsTPaVxR8hpUYSXWHowah+2Ru1IQL/cakWsEBbhL0yzJaUXeFI+i6HUd22YSE1siIFV0ADMSY3O4HzijbBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T03:46:57.836835Z","bundle_sha256":"c439f207f45942b16df60c00fee8558ad2c054774611b7ec792c63e60bfd6022"}}