{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NIOA3RNMVPP5N47DLOXAI7OFF4","short_pith_number":"pith:NIOA3RNM","canonical_record":{"source":{"id":"1810.01137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-02T09:35:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0132a24814da98c4d37932d67c33fe0cb4aa7d236562bed18919b33eeb7ce89b","abstract_canon_sha256":"0a85f97e47b030875ae81981f481fbdc18fa89891e5b0b2658f2dcd0c03baaaa"},"schema_version":"1.0"},"canonical_sha256":"6a1c0dc5acabdfd6f3e35bae047dc52f3381c9b14be4caeb776b4ec3e3e5a802","source":{"kind":"arxiv","id":"1810.01137","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01137","created_at":"2026-05-18T00:04:18Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01137v1","created_at":"2026-05-18T00:04:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01137","created_at":"2026-05-18T00:04:18Z"},{"alias_kind":"pith_short_12","alias_value":"NIOA3RNMVPP5","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NIOA3RNMVPP5N47D","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NIOA3RNM","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NIOA3RNMVPP5N47DLOXAI7OFF4","target":"record","payload":{"canonical_record":{"source":{"id":"1810.01137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-02T09:35:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0132a24814da98c4d37932d67c33fe0cb4aa7d236562bed18919b33eeb7ce89b","abstract_canon_sha256":"0a85f97e47b030875ae81981f481fbdc18fa89891e5b0b2658f2dcd0c03baaaa"},"schema_version":"1.0"},"canonical_sha256":"6a1c0dc5acabdfd6f3e35bae047dc52f3381c9b14be4caeb776b4ec3e3e5a802","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:18.703561Z","signature_b64":"fhGBTodD7YbH/gleVXtY+44Qw1NL8vnbOLiD0shd0j/D7JpRt9hFHeJqazODAObmpk5eMiFeWZHGk25X4U9pCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a1c0dc5acabdfd6f3e35bae047dc52f3381c9b14be4caeb776b4ec3e3e5a802","last_reissued_at":"2026-05-18T00:04:18.702850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:18.702850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.01137","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-18T00:04:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aXYE1yiX67owozBqEB7eybDbKXSLFHlLMJSSDn6Fvw2ysaJWQRMEOhsFewut059UGb6ntR0VPFVK/0J3XSeQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:45:25.005106Z"},"content_sha256":"7b7b0b7327442ac4aad8e7dfc0df17fd7a07cfa34c11d21f6382a10580512c06","schema_version":"1.0","event_id":"sha256:7b7b0b7327442ac4aad8e7dfc0df17fd7a07cfa34c11d21f6382a10580512c06"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NIOA3RNMVPP5N47DLOXAI7OFF4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Avoiding Burst-like Error Patterns in Windowed Decoding of Spatially Coupled LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kevin Klaiber, Laurent Schmalen, Sebastian Cammerer, Stephan ten Brink","submitted_at":"2018-10-02T09:35:56Z","abstract_excerpt":"In this work, we analyze efficient window shift schemes for windowed decoding of spatially coupled low-density parity-check (SC-LDPC) codes, which is known to yield close-tooptimal decoding results when compared to full belief propagation (BP) decoding. However, a drawback of windowed decoding is that either a significant amount of window updates are required leading to unnecessary high decoding complexity or the decoder suffers from sporadic burst-like error patterns, causing a decoder stall. To tackle this effect and, thus, to reduce the average decoding complexity, the basic idea is to enab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01137","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-18T00:04:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QeeFdEeXuUzRPnI91unD2QVnfZV7OhhVnMRrJGx6gkRKycjse5a7AB1Xbi9MXGtmDbDZ8SH175RZG4VFw/r1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:45:25.005816Z"},"content_sha256":"4acbdc03fab623cd3e9e249eddfe67792117d6b3703f68dd13840e92f3224c87","schema_version":"1.0","event_id":"sha256:4acbdc03fab623cd3e9e249eddfe67792117d6b3703f68dd13840e92f3224c87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NIOA3RNMVPP5N47DLOXAI7OFF4/bundle.json","state_url":"https://pith.science/pith/NIOA3RNMVPP5N47DLOXAI7OFF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NIOA3RNMVPP5N47DLOXAI7OFF4/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:45:25Z","links":{"resolver":"https://pith.science/pith/NIOA3RNMVPP5N47DLOXAI7OFF4","bundle":"https://pith.science/pith/NIOA3RNMVPP5N47DLOXAI7OFF4/bundle.json","state":"https://pith.science/pith/NIOA3RNMVPP5N47DLOXAI7OFF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NIOA3RNMVPP5N47DLOXAI7OFF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NIOA3RNMVPP5N47DLOXAI7OFF4","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":"0a85f97e47b030875ae81981f481fbdc18fa89891e5b0b2658f2dcd0c03baaaa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-02T09:35:56Z","title_canon_sha256":"0132a24814da98c4d37932d67c33fe0cb4aa7d236562bed18919b33eeb7ce89b"},"schema_version":"1.0","source":{"id":"1810.01137","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01137","created_at":"2026-05-18T00:04:18Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01137v1","created_at":"2026-05-18T00:04:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01137","created_at":"2026-05-18T00:04:18Z"},{"alias_kind":"pith_short_12","alias_value":"NIOA3RNMVPP5","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NIOA3RNMVPP5N47D","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NIOA3RNM","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:4acbdc03fab623cd3e9e249eddfe67792117d6b3703f68dd13840e92f3224c87","target":"graph","created_at":"2026-05-18T00:04:18Z","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 work, we analyze efficient window shift schemes for windowed decoding of spatially coupled low-density parity-check (SC-LDPC) codes, which is known to yield close-tooptimal decoding results when compared to full belief propagation (BP) decoding. However, a drawback of windowed decoding is that either a significant amount of window updates are required leading to unnecessary high decoding complexity or the decoder suffers from sporadic burst-like error patterns, causing a decoder stall. To tackle this effect and, thus, to reduce the average decoding complexity, the basic idea is to enab","authors_text":"Kevin Klaiber, Laurent Schmalen, Sebastian Cammerer, Stephan ten Brink","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-02T09:35:56Z","title":"Avoiding Burst-like Error Patterns in Windowed Decoding of Spatially Coupled LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01137","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:7b7b0b7327442ac4aad8e7dfc0df17fd7a07cfa34c11d21f6382a10580512c06","target":"record","created_at":"2026-05-18T00:04:18Z","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":"0a85f97e47b030875ae81981f481fbdc18fa89891e5b0b2658f2dcd0c03baaaa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-02T09:35:56Z","title_canon_sha256":"0132a24814da98c4d37932d67c33fe0cb4aa7d236562bed18919b33eeb7ce89b"},"schema_version":"1.0","source":{"id":"1810.01137","kind":"arxiv","version":1}},"canonical_sha256":"6a1c0dc5acabdfd6f3e35bae047dc52f3381c9b14be4caeb776b4ec3e3e5a802","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a1c0dc5acabdfd6f3e35bae047dc52f3381c9b14be4caeb776b4ec3e3e5a802","first_computed_at":"2026-05-18T00:04:18.702850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:18.702850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fhGBTodD7YbH/gleVXtY+44Qw1NL8vnbOLiD0shd0j/D7JpRt9hFHeJqazODAObmpk5eMiFeWZHGk25X4U9pCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:18.703561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.01137","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b7b0b7327442ac4aad8e7dfc0df17fd7a07cfa34c11d21f6382a10580512c06","sha256:4acbdc03fab623cd3e9e249eddfe67792117d6b3703f68dd13840e92f3224c87"],"state_sha256":"7df3fa14d1c52f2bc4bccc34765dc68532e92e3c6c76009b3b1eba71f34d771c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jkwUO5DXYTROzitCJQLA9Lw32Z03DGM86VXz+bJTzj9HIamm9VF3ez5X0w17V3awqOff5JsVFP8/SXziSq8YCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:45:25.009956Z","bundle_sha256":"cb3f7a734f64218906c22fe02669aea09322a8cfc222ef80e8d46ec643f010f6"}}