{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XCNYB6DAVFGVXGY43L35GZ55VJ","short_pith_number":"pith:XCNYB6DA","canonical_record":{"source":{"id":"1501.05927","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-23T19:49:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"88c00742f419bd2481241af5d89cb7592e4ebb76a1bcbf031e4cbeb9f5f45be6","abstract_canon_sha256":"37bb0ad2acdbc0c7eae91de6bfd17ed4ac46c9c95465e065d6910d323f31cebc"},"schema_version":"1.0"},"canonical_sha256":"b89b80f860a94d5b9b1cdaf7d367bdaa5946d15fd239ce9301a5f60c248d4e2e","source":{"kind":"arxiv","id":"1501.05927","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05927","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05927v2","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05927","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"XCNYB6DAVFGV","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XCNYB6DAVFGVXGY4","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XCNYB6DA","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XCNYB6DAVFGVXGY43L35GZ55VJ","target":"record","payload":{"canonical_record":{"source":{"id":"1501.05927","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-23T19:49:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"88c00742f419bd2481241af5d89cb7592e4ebb76a1bcbf031e4cbeb9f5f45be6","abstract_canon_sha256":"37bb0ad2acdbc0c7eae91de6bfd17ed4ac46c9c95465e065d6910d323f31cebc"},"schema_version":"1.0"},"canonical_sha256":"b89b80f860a94d5b9b1cdaf7d367bdaa5946d15fd239ce9301a5f60c248d4e2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:47.193434Z","signature_b64":"VnwlZNAfozX1lWNru26HoNOb3df/9BH5AkSKruglReGfDtJvjVM04tPwdHkdp906uap8CW0Togw5Z3U2egFbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b89b80f860a94d5b9b1cdaf7d367bdaa5946d15fd239ce9301a5f60c248d4e2e","last_reissued_at":"2026-05-18T02:28:47.193042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:47.193042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.05927","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-18T02:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"seTQqgrS35BAyCeDUDvtlUF2/Z4pduDDsJgj5OfR2QAkZlA5YLwzgjYg1e+t9+Ui8e2K1Y0FSOe5hVp/EbP2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:38:23.148012Z"},"content_sha256":"e40e3d10663c3b5a65c2ec3593151518d094c9bc42ca1b341ac2f389ca84ac53","schema_version":"1.0","event_id":"sha256:e40e3d10663c3b5a65c2ec3593151518d094c9bc42ca1b341ac2f389ca84ac53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XCNYB6DAVFGVXGY43L35GZ55VJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple-Symbol Interleaved RS Codes and Two-Pass Decoding Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Chini, J. Zhou, M. Kilani, Z. Wang","submitted_at":"2015-01-23T19:49:16Z","abstract_excerpt":"For communication systems with heavy burst noise, an optimal Forward Error Correction (FEC) scheme is expected to have a large burst error correction capacity while simultaneously owning moderate random error correction capability. This letter presents a new FEC scheme based on multiple-symbol interleaved Reed-Solomon codes and an associated two-pass decoding algorithm. It is shown that the proposed multi-symbol interleaved coding scheme can achieve nearly twice as much as the burst error correction capability of conventional symbol-interleaved Reed-Solomon codes with the same code length and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05927","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-18T02:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/rSq24IDEaZ32iQjwYsG8dFFGJ//2jKUM7Bo2jAunJoIZ6Mi0eKIk1vM65r4kmcCU65/3riVKC0cegYbuEdGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:38:23.148373Z"},"content_sha256":"23f0a6479fb64bc17e64eced2c0cf9a4b7f1b8d04112baa040ab706b1bff9993","schema_version":"1.0","event_id":"sha256:23f0a6479fb64bc17e64eced2c0cf9a4b7f1b8d04112baa040ab706b1bff9993"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCNYB6DAVFGVXGY43L35GZ55VJ/bundle.json","state_url":"https://pith.science/pith/XCNYB6DAVFGVXGY43L35GZ55VJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCNYB6DAVFGVXGY43L35GZ55VJ/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-01T15:38:23Z","links":{"resolver":"https://pith.science/pith/XCNYB6DAVFGVXGY43L35GZ55VJ","bundle":"https://pith.science/pith/XCNYB6DAVFGVXGY43L35GZ55VJ/bundle.json","state":"https://pith.science/pith/XCNYB6DAVFGVXGY43L35GZ55VJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCNYB6DAVFGVXGY43L35GZ55VJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XCNYB6DAVFGVXGY43L35GZ55VJ","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":"37bb0ad2acdbc0c7eae91de6bfd17ed4ac46c9c95465e065d6910d323f31cebc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-23T19:49:16Z","title_canon_sha256":"88c00742f419bd2481241af5d89cb7592e4ebb76a1bcbf031e4cbeb9f5f45be6"},"schema_version":"1.0","source":{"id":"1501.05927","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05927","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05927v2","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05927","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"XCNYB6DAVFGV","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XCNYB6DAVFGVXGY4","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XCNYB6DA","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:23f0a6479fb64bc17e64eced2c0cf9a4b7f1b8d04112baa040ab706b1bff9993","target":"graph","created_at":"2026-05-18T02:28:47Z","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":"For communication systems with heavy burst noise, an optimal Forward Error Correction (FEC) scheme is expected to have a large burst error correction capacity while simultaneously owning moderate random error correction capability. This letter presents a new FEC scheme based on multiple-symbol interleaved Reed-Solomon codes and an associated two-pass decoding algorithm. It is shown that the proposed multi-symbol interleaved coding scheme can achieve nearly twice as much as the burst error correction capability of conventional symbol-interleaved Reed-Solomon codes with the same code length and ","authors_text":"A. Chini, J. Zhou, M. Kilani, Z. Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-23T19:49:16Z","title":"Multiple-Symbol Interleaved RS Codes and Two-Pass Decoding Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05927","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:e40e3d10663c3b5a65c2ec3593151518d094c9bc42ca1b341ac2f389ca84ac53","target":"record","created_at":"2026-05-18T02:28:47Z","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":"37bb0ad2acdbc0c7eae91de6bfd17ed4ac46c9c95465e065d6910d323f31cebc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-23T19:49:16Z","title_canon_sha256":"88c00742f419bd2481241af5d89cb7592e4ebb76a1bcbf031e4cbeb9f5f45be6"},"schema_version":"1.0","source":{"id":"1501.05927","kind":"arxiv","version":2}},"canonical_sha256":"b89b80f860a94d5b9b1cdaf7d367bdaa5946d15fd239ce9301a5f60c248d4e2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b89b80f860a94d5b9b1cdaf7d367bdaa5946d15fd239ce9301a5f60c248d4e2e","first_computed_at":"2026-05-18T02:28:47.193042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:47.193042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VnwlZNAfozX1lWNru26HoNOb3df/9BH5AkSKruglReGfDtJvjVM04tPwdHkdp906uap8CW0Togw5Z3U2egFbCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:47.193434Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05927","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e40e3d10663c3b5a65c2ec3593151518d094c9bc42ca1b341ac2f389ca84ac53","sha256:23f0a6479fb64bc17e64eced2c0cf9a4b7f1b8d04112baa040ab706b1bff9993"],"state_sha256":"234a4fa1d6af31331d28b9217857ce574ed413b6c9a950451aef846406eb38fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BUlS7c6OEGXtEHnQ9LyT90ociiC7zlp11FQgZvz4AIRPEkI6aD2sLx/421BoVb55JccTXQVfgmo3seEfg76CAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T15:38:23.150281Z","bundle_sha256":"92c2f40fa1c62e6d2408ca21c5e9b082f27cc47f6295dfeadf6b5aec5526406f"}}