{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NQL66SPA3MFJN2S6EWJSMYIXTW","short_pith_number":"pith:NQL66SPA","canonical_record":{"source":{"id":"1506.02820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-09T08:27:08Z","cross_cats_sorted":["cs.CR","cs.DM","math.CO","math.IT","math.NT"],"title_canon_sha256":"944be9b4d747545444e3271b07a7a190d0b6d1574a47908b92e9d4ded7ba4815","abstract_canon_sha256":"d8c3a7b6f1fd55942b91e0fa18743625dcf6d77e281f47d632a6b12bce1618a7"},"schema_version":"1.0"},"canonical_sha256":"6c17ef49e0db0a96ea5e25932661179d8a88ff2a598fe3d07f7da26531f2553c","source":{"kind":"arxiv","id":"1506.02820","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02820","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02820v1","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02820","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"pith_short_12","alias_value":"NQL66SPA3MFJ","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NQL66SPA3MFJN2S6","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NQL66SPA","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NQL66SPA3MFJN2S6EWJSMYIXTW","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-09T08:27:08Z","cross_cats_sorted":["cs.CR","cs.DM","math.CO","math.IT","math.NT"],"title_canon_sha256":"944be9b4d747545444e3271b07a7a190d0b6d1574a47908b92e9d4ded7ba4815","abstract_canon_sha256":"d8c3a7b6f1fd55942b91e0fa18743625dcf6d77e281f47d632a6b12bce1618a7"},"schema_version":"1.0"},"canonical_sha256":"6c17ef49e0db0a96ea5e25932661179d8a88ff2a598fe3d07f7da26531f2553c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:40.826027Z","signature_b64":"b73swiiNcd7+emVKLZhu633M/mZacwY/M8G1uyigbJo33PiOr0ZmbZ3WGZ4o/UTZrO5eiMs2JEyUeZ5WYLKBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c17ef49e0db0a96ea5e25932661179d8a88ff2a598fe3d07f7da26531f2553c","last_reissued_at":"2026-05-18T01:55:40.825386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:40.825386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02820","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-18T01:55:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OMgjmP101dk+gXeFdXsb81g0kEYQrCPYCVFiYguXofr84zHz7a7Hj4n14rRpbN+nt5KCYl/Eeg5gh/qPFqbUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T03:45:21.995728Z"},"content_sha256":"c7bffa7e499f8d1b8ec5288408f02ae102faff4a7e069ec4e9a3f70ed5123d18","schema_version":"1.0","event_id":"sha256:c7bffa7e499f8d1b8ec5288408f02ae102faff4a7e069ec4e9a3f70ed5123d18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NQL66SPA3MFJN2S6EWJSMYIXTW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decoding of Repeated-Root Cyclic Codes up to New Bounds on Their Minimum Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DM","math.CO","math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Alexander Zeh, Markus Ulmschneider","submitted_at":"2015-06-09T08:27:08Z","abstract_excerpt":"The well-known approach of Bose, Ray-Chaudhuri and Hocquenghem and its generalization by Hartmann and Tzeng are lower bounds on the minimum distance of simple-root cyclic codes. We generalize these two bounds to the case of repeated-root cyclic codes and present a syndrome-based burst error decoding algorithm with guaranteed decoding radius based on an associated folded cyclic code. Furthermore, we present a third technique for bounding the minimum Hamming distance based on the embedding of a given repeated-root cyclic code into a repeated-root cyclic product code. A second quadratic-time prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02820","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-18T01:55:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l8k/qXSqSTqQnhq2xHMhyFiSmb5sJFcumkSIObZj3+uy7c0INKqrzhP/+V472OajOBFlJtg/eQclMLKi410MDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T03:45:21.996097Z"},"content_sha256":"efbcf72745439ebe1b1f4c924b31c33a54531b845abd48f794a6da9afd5e7f21","schema_version":"1.0","event_id":"sha256:efbcf72745439ebe1b1f4c924b31c33a54531b845abd48f794a6da9afd5e7f21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQL66SPA3MFJN2S6EWJSMYIXTW/bundle.json","state_url":"https://pith.science/pith/NQL66SPA3MFJN2S6EWJSMYIXTW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQL66SPA3MFJN2S6EWJSMYIXTW/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:45:21Z","links":{"resolver":"https://pith.science/pith/NQL66SPA3MFJN2S6EWJSMYIXTW","bundle":"https://pith.science/pith/NQL66SPA3MFJN2S6EWJSMYIXTW/bundle.json","state":"https://pith.science/pith/NQL66SPA3MFJN2S6EWJSMYIXTW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQL66SPA3MFJN2S6EWJSMYIXTW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NQL66SPA3MFJN2S6EWJSMYIXTW","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":"d8c3a7b6f1fd55942b91e0fa18743625dcf6d77e281f47d632a6b12bce1618a7","cross_cats_sorted":["cs.CR","cs.DM","math.CO","math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-09T08:27:08Z","title_canon_sha256":"944be9b4d747545444e3271b07a7a190d0b6d1574a47908b92e9d4ded7ba4815"},"schema_version":"1.0","source":{"id":"1506.02820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02820","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02820v1","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02820","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"pith_short_12","alias_value":"NQL66SPA3MFJ","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NQL66SPA3MFJN2S6","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NQL66SPA","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:efbcf72745439ebe1b1f4c924b31c33a54531b845abd48f794a6da9afd5e7f21","target":"graph","created_at":"2026-05-18T01:55:40Z","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":"The well-known approach of Bose, Ray-Chaudhuri and Hocquenghem and its generalization by Hartmann and Tzeng are lower bounds on the minimum distance of simple-root cyclic codes. We generalize these two bounds to the case of repeated-root cyclic codes and present a syndrome-based burst error decoding algorithm with guaranteed decoding radius based on an associated folded cyclic code. Furthermore, we present a third technique for bounding the minimum Hamming distance based on the embedding of a given repeated-root cyclic code into a repeated-root cyclic product code. A second quadratic-time prob","authors_text":"Alexander Zeh, Markus Ulmschneider","cross_cats":["cs.CR","cs.DM","math.CO","math.IT","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-09T08:27:08Z","title":"Decoding of Repeated-Root Cyclic Codes up to New Bounds on Their Minimum Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02820","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:c7bffa7e499f8d1b8ec5288408f02ae102faff4a7e069ec4e9a3f70ed5123d18","target":"record","created_at":"2026-05-18T01:55:40Z","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":"d8c3a7b6f1fd55942b91e0fa18743625dcf6d77e281f47d632a6b12bce1618a7","cross_cats_sorted":["cs.CR","cs.DM","math.CO","math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-09T08:27:08Z","title_canon_sha256":"944be9b4d747545444e3271b07a7a190d0b6d1574a47908b92e9d4ded7ba4815"},"schema_version":"1.0","source":{"id":"1506.02820","kind":"arxiv","version":1}},"canonical_sha256":"6c17ef49e0db0a96ea5e25932661179d8a88ff2a598fe3d07f7da26531f2553c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c17ef49e0db0a96ea5e25932661179d8a88ff2a598fe3d07f7da26531f2553c","first_computed_at":"2026-05-18T01:55:40.825386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:40.825386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b73swiiNcd7+emVKLZhu633M/mZacwY/M8G1uyigbJo33PiOr0ZmbZ3WGZ4o/UTZrO5eiMs2JEyUeZ5WYLKBDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:40.826027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7bffa7e499f8d1b8ec5288408f02ae102faff4a7e069ec4e9a3f70ed5123d18","sha256:efbcf72745439ebe1b1f4c924b31c33a54531b845abd48f794a6da9afd5e7f21"],"state_sha256":"ce5d515d182798c76d3a3bb940470399b5e1f07ec8a3d2836191a8e5d7a47080"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1Ul78pNqoAwzbqSc+PZviHXMKmE60p4GTC1aQpzonVeLscajg4D8OPqN8wK6b9+jF1QPKa8ydu3qoko3wn4Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T03:45:21.998080Z","bundle_sha256":"d4957d1f187ab2d9e1696ad5b0457e8a327ff6a876ca390b5fb6a664166dd53b"}}