{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SK3R6JHNYDRGDD3K3VI67GVK6M","short_pith_number":"pith:SK3R6JHN","canonical_record":{"source":{"id":"1904.07158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-15T16:15:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4fbb2222bb217d38be1b379290f6c035846f5e763a0463a854fb2d43d41ef115","abstract_canon_sha256":"1abc6e5edeed8b8530db88a862d6cde66ba8b58cd53cba6fcfc5edb2a8be1ce2"},"schema_version":"1.0"},"canonical_sha256":"92b71f24edc0e2618f6add51ef9aaaf302ecc278c7d5d3db883560d26aefabb6","source":{"kind":"arxiv","id":"1904.07158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07158","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07158v1","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07158","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"SK3R6JHNYDRG","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SK3R6JHNYDRGDD3K","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SK3R6JHN","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SK3R6JHNYDRGDD3K3VI67GVK6M","target":"record","payload":{"canonical_record":{"source":{"id":"1904.07158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-15T16:15:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4fbb2222bb217d38be1b379290f6c035846f5e763a0463a854fb2d43d41ef115","abstract_canon_sha256":"1abc6e5edeed8b8530db88a862d6cde66ba8b58cd53cba6fcfc5edb2a8be1ce2"},"schema_version":"1.0"},"canonical_sha256":"92b71f24edc0e2618f6add51ef9aaaf302ecc278c7d5d3db883560d26aefabb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:35.076999Z","signature_b64":"YqzxDAaK4Cm+VWFxSshy9W9UFSm0/AUik4XNW0Y+ci+5IgexBJgL1Ma0FaGa6y6gfxoHzwSpCzbXjhhHttwCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92b71f24edc0e2618f6add51ef9aaaf302ecc278c7d5d3db883560d26aefabb6","last_reissued_at":"2026-05-17T23:48:35.076572Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:35.076572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.07158","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-17T23:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9gEruFhGDNZIIQiRCu5UTmiNSZrGv2p7yfIkQsStLZTdlaKHSHRqY1XRevdVkoBpGH6VxXeSXMfzWsLESQxdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:46:09.112262Z"},"content_sha256":"53be34bd623eb0f16ab8d67c6764fe5d61986e413ac8dd1358409156517fac20","schema_version":"1.0","event_id":"sha256:53be34bd623eb0f16ab8d67c6764fe5d61986e413ac8dd1358409156517fac20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SK3R6JHNYDRGDD3K3VI67GVK6M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Search and Elimination of Harmful Objects in Optimized QC SC-LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Mitchell, Franco Chiaraluce, Marco Baldi, Massimo Battaglioni","submitted_at":"2019-04-15T16:15:48Z","abstract_excerpt":"The error correction performance of low-density parity-check (LDPC) codes under iterative message-passing decoding is degraded by the presence of certain harmful objects existing in their Tanner graph representation. Depending on the context, such harmful objects are known as stopping sets, trapping sets, absorbing sets, or pseudocodewords. In this paper, we propose a general procedure based on edge spreading that enables the design of quasi-cyclic (QC) spatially coupled low-density parity-check codes (SC-LDPCCs) that are derived from QC-LDPC block codes and possess a significantly reduced mul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07158","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-17T23:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qqzEQdUz64uN642NJHg7u4tRyFFAMXVuOKceS+LLPoWV+aJg5jgp0lAof3Cg5gvZQ4YOktkCr7374gClOtnLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:46:09.112618Z"},"content_sha256":"2bd126174e2928688acf157763f1fc9344a0de2b9d0329ea772c953f9b355cfa","schema_version":"1.0","event_id":"sha256:2bd126174e2928688acf157763f1fc9344a0de2b9d0329ea772c953f9b355cfa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SK3R6JHNYDRGDD3K3VI67GVK6M/bundle.json","state_url":"https://pith.science/pith/SK3R6JHNYDRGDD3K3VI67GVK6M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SK3R6JHNYDRGDD3K3VI67GVK6M/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-03T20:46:09Z","links":{"resolver":"https://pith.science/pith/SK3R6JHNYDRGDD3K3VI67GVK6M","bundle":"https://pith.science/pith/SK3R6JHNYDRGDD3K3VI67GVK6M/bundle.json","state":"https://pith.science/pith/SK3R6JHNYDRGDD3K3VI67GVK6M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SK3R6JHNYDRGDD3K3VI67GVK6M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SK3R6JHNYDRGDD3K3VI67GVK6M","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":"1abc6e5edeed8b8530db88a862d6cde66ba8b58cd53cba6fcfc5edb2a8be1ce2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-15T16:15:48Z","title_canon_sha256":"4fbb2222bb217d38be1b379290f6c035846f5e763a0463a854fb2d43d41ef115"},"schema_version":"1.0","source":{"id":"1904.07158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07158","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07158v1","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07158","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"SK3R6JHNYDRG","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SK3R6JHNYDRGDD3K","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SK3R6JHN","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:2bd126174e2928688acf157763f1fc9344a0de2b9d0329ea772c953f9b355cfa","target":"graph","created_at":"2026-05-17T23:48:35Z","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 error correction performance of low-density parity-check (LDPC) codes under iterative message-passing decoding is degraded by the presence of certain harmful objects existing in their Tanner graph representation. Depending on the context, such harmful objects are known as stopping sets, trapping sets, absorbing sets, or pseudocodewords. In this paper, we propose a general procedure based on edge spreading that enables the design of quasi-cyclic (QC) spatially coupled low-density parity-check codes (SC-LDPCCs) that are derived from QC-LDPC block codes and possess a significantly reduced mul","authors_text":"David Mitchell, Franco Chiaraluce, Marco Baldi, Massimo Battaglioni","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-15T16:15:48Z","title":"Efficient Search and Elimination of Harmful Objects in Optimized QC SC-LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07158","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:53be34bd623eb0f16ab8d67c6764fe5d61986e413ac8dd1358409156517fac20","target":"record","created_at":"2026-05-17T23:48:35Z","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":"1abc6e5edeed8b8530db88a862d6cde66ba8b58cd53cba6fcfc5edb2a8be1ce2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-15T16:15:48Z","title_canon_sha256":"4fbb2222bb217d38be1b379290f6c035846f5e763a0463a854fb2d43d41ef115"},"schema_version":"1.0","source":{"id":"1904.07158","kind":"arxiv","version":1}},"canonical_sha256":"92b71f24edc0e2618f6add51ef9aaaf302ecc278c7d5d3db883560d26aefabb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92b71f24edc0e2618f6add51ef9aaaf302ecc278c7d5d3db883560d26aefabb6","first_computed_at":"2026-05-17T23:48:35.076572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:35.076572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YqzxDAaK4Cm+VWFxSshy9W9UFSm0/AUik4XNW0Y+ci+5IgexBJgL1Ma0FaGa6y6gfxoHzwSpCzbXjhhHttwCBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:35.076999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.07158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53be34bd623eb0f16ab8d67c6764fe5d61986e413ac8dd1358409156517fac20","sha256:2bd126174e2928688acf157763f1fc9344a0de2b9d0329ea772c953f9b355cfa"],"state_sha256":"9724fd49a3420cae5f222aa8ca6b75e20e9381bde1a64749d65ae08aba6e891f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PNm6puOQg+UOMqwT+Gz8A50txsOdeEgCTBNmkgMI2zPRfHAjGoV6qW7h0qeN13GiDNlA7p9OFPrRCRxW+X4NCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:46:09.114527Z","bundle_sha256":"8080970ad3d9908558c087264accf34e465e7ee34b2ad0d592d1059465304d8f"}}