{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WFLNJUQUI33SISVQGPHL2CYEHG","short_pith_number":"pith:WFLNJUQU","canonical_record":{"source":{"id":"1901.02603","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-09T04:55:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"da47687b13c7b5f32c115148c205e2f86a615715bcb03f0b456c58f24c82f40d","abstract_canon_sha256":"788fd3362d7a37f8cf59dacd0824cdaaf0f0d21a60bc36a5f090a0179e7a7498"},"schema_version":"1.0"},"canonical_sha256":"b156d4d21446f7244ab033cebd0b0439afbcb7b7cb8f6d63147d29b82ed1bf7d","source":{"kind":"arxiv","id":"1901.02603","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02603","created_at":"2026-05-17T23:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02603v2","created_at":"2026-05-17T23:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02603","created_at":"2026-05-17T23:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"WFLNJUQUI33S","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WFLNJUQUI33SISVQ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WFLNJUQU","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WFLNJUQUI33SISVQGPHL2CYEHG","target":"record","payload":{"canonical_record":{"source":{"id":"1901.02603","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-09T04:55:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"da47687b13c7b5f32c115148c205e2f86a615715bcb03f0b456c58f24c82f40d","abstract_canon_sha256":"788fd3362d7a37f8cf59dacd0824cdaaf0f0d21a60bc36a5f090a0179e7a7498"},"schema_version":"1.0"},"canonical_sha256":"b156d4d21446f7244ab033cebd0b0439afbcb7b7cb8f6d63147d29b82ed1bf7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:52.970420Z","signature_b64":"cx9kVelFVtuL+OoTiHOE/Cu8+yLve2UXObfhVcyxgrcAv2cXzrT5AuEXpxJ+tA34G/nt22vfkfaTzkDuW3CODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b156d4d21446f7244ab033cebd0b0439afbcb7b7cb8f6d63147d29b82ed1bf7d","last_reissued_at":"2026-05-17T23:55:52.969925Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:52.969925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.02603","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-17T23:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H8q/OPsu8OiSbujr9xjQLi5TnxtvBklDG/1kQ11n4HRQJsOoMdYEejEbHW2ikMU/9N0w2tx1IX5SZ5C1+pnnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:05:34.696861Z"},"content_sha256":"66f32f955fba68295149a3e547e941eb963bbbd09b02c8159129ee8e5d492ef2","schema_version":"1.0","event_id":"sha256:66f32f955fba68295149a3e547e941eb963bbbd09b02c8159129ee8e5d492ef2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WFLNJUQUI33SISVQGPHL2CYEHG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Segmentation-Discarding Ordered-Statistic Decoding for Linear Block Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Branka Vucetic, Chentao Yue, Mahyar Shirvanimoghaddam, Yonghui Li","submitted_at":"2019-01-09T04:55:45Z","abstract_excerpt":"In this paper, we propose an efficient reliability based segmentation-discarding decoding (SDD) algorithm for short block-length codes. A novel segmentation-discarding technique is proposed along with the stopping rule to significantly reduce the decoding complexity without a significant performance degradation compared to ordered statistics decoding (OSD). In the proposed decoder, the list of test error patterns (TEPs) is divided into several segments according to carefully selected boundaries and every segment is checked separately during the reprocessing stage. Decoding is performed under t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02603","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-17T23:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZrRJkob0mF6U8pti9tejtItpbQO/ajcLbLCaRI138YfFDFPxyIBTwFgi9P7li7XvskXXshisr50CiERBeULcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:05:34.697547Z"},"content_sha256":"c087bdd86d9c0d92558bfc5b4f352acd92973a138188685f43529e0e0cbe4642","schema_version":"1.0","event_id":"sha256:c087bdd86d9c0d92558bfc5b4f352acd92973a138188685f43529e0e0cbe4642"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WFLNJUQUI33SISVQGPHL2CYEHG/bundle.json","state_url":"https://pith.science/pith/WFLNJUQUI33SISVQGPHL2CYEHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WFLNJUQUI33SISVQGPHL2CYEHG/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-05-25T15:05:34Z","links":{"resolver":"https://pith.science/pith/WFLNJUQUI33SISVQGPHL2CYEHG","bundle":"https://pith.science/pith/WFLNJUQUI33SISVQGPHL2CYEHG/bundle.json","state":"https://pith.science/pith/WFLNJUQUI33SISVQGPHL2CYEHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WFLNJUQUI33SISVQGPHL2CYEHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WFLNJUQUI33SISVQGPHL2CYEHG","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":"788fd3362d7a37f8cf59dacd0824cdaaf0f0d21a60bc36a5f090a0179e7a7498","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-09T04:55:45Z","title_canon_sha256":"da47687b13c7b5f32c115148c205e2f86a615715bcb03f0b456c58f24c82f40d"},"schema_version":"1.0","source":{"id":"1901.02603","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02603","created_at":"2026-05-17T23:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02603v2","created_at":"2026-05-17T23:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02603","created_at":"2026-05-17T23:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"WFLNJUQUI33S","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WFLNJUQUI33SISVQ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WFLNJUQU","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:c087bdd86d9c0d92558bfc5b4f352acd92973a138188685f43529e0e0cbe4642","target":"graph","created_at":"2026-05-17T23:55:52Z","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":"In this paper, we propose an efficient reliability based segmentation-discarding decoding (SDD) algorithm for short block-length codes. A novel segmentation-discarding technique is proposed along with the stopping rule to significantly reduce the decoding complexity without a significant performance degradation compared to ordered statistics decoding (OSD). In the proposed decoder, the list of test error patterns (TEPs) is divided into several segments according to carefully selected boundaries and every segment is checked separately during the reprocessing stage. Decoding is performed under t","authors_text":"Branka Vucetic, Chentao Yue, Mahyar Shirvanimoghaddam, Yonghui Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-09T04:55:45Z","title":"Segmentation-Discarding Ordered-Statistic Decoding for Linear Block Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02603","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:66f32f955fba68295149a3e547e941eb963bbbd09b02c8159129ee8e5d492ef2","target":"record","created_at":"2026-05-17T23:55:52Z","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":"788fd3362d7a37f8cf59dacd0824cdaaf0f0d21a60bc36a5f090a0179e7a7498","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-09T04:55:45Z","title_canon_sha256":"da47687b13c7b5f32c115148c205e2f86a615715bcb03f0b456c58f24c82f40d"},"schema_version":"1.0","source":{"id":"1901.02603","kind":"arxiv","version":2}},"canonical_sha256":"b156d4d21446f7244ab033cebd0b0439afbcb7b7cb8f6d63147d29b82ed1bf7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b156d4d21446f7244ab033cebd0b0439afbcb7b7cb8f6d63147d29b82ed1bf7d","first_computed_at":"2026-05-17T23:55:52.969925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:52.969925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cx9kVelFVtuL+OoTiHOE/Cu8+yLve2UXObfhVcyxgrcAv2cXzrT5AuEXpxJ+tA34G/nt22vfkfaTzkDuW3CODQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:52.970420Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.02603","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66f32f955fba68295149a3e547e941eb963bbbd09b02c8159129ee8e5d492ef2","sha256:c087bdd86d9c0d92558bfc5b4f352acd92973a138188685f43529e0e0cbe4642"],"state_sha256":"8335ecbc580b623f77585acfa541983261cf95e84c46386de5fc7283afa41206"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nl+k3D5pbTRnj3gWd3LJEybxTFaj/n7NkM02s4Nm2kzDG5DGN4uA2su40QPVUx4UXJ91Cw98oyAVsgpHVomHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:05:34.701204Z","bundle_sha256":"c9496c97193298cdc433ca060bc8b1c74018e6b7e800165c6a5df939943367cf"}}