{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WILGLP6AILTCVKROVLSROAIGQD","short_pith_number":"pith:WILGLP6A","schema_version":"1.0","canonical_sha256":"b21665bfc042e62aaa2eaae517010680d341298dcb5e0eb907b9b57676777ccb","source":{"kind":"arxiv","id":"1809.04253","version":1},"attestation_state":"computed","paper":{"title":"Free Pseudodistance Growth Rates for Spatially Coupled LDPC Codes over the BEC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cunlu Zhou, David G. M. Mitchell, Roxana Smarandache","submitted_at":"2018-09-12T04:44:53Z","abstract_excerpt":"The minimum pseudoweight is an important parameter related to the decoding performance of LDPC codes with iterative message-passing decoding. In this paper, we consider ensembles of periodically time-varying spatially coupled LDPC (SC-LDPC) codes and the pseudocodewords arising from their finite graph covers of a fixed degree. We show that for certain $(J,K)$-regular SC-LDPC code ensembles and a fixed cover degree, the typical minimum pseudoweight of the unterminated (and associated tail-biting/terminated) SC-LDPC code ensembles grows linearly with the constraint (block) length as the constrai"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1809.04253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-12T04:44:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"213697f28dc194e721e2c790c238d83024f78ad61e151ed0cdf02c5e1fc88612","abstract_canon_sha256":"811c4b7407b8308bc4d14a799f52a03d0cd47ff709d09553c3321a4def5dd6e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:52.991934Z","signature_b64":"zeOh4CWVyIsJ7d2a0dwGnEDLTiPEiGQDMgW4fKIt9FaflcBkeu+ltc2cy2cNK0SC+7WMLbSzhmDKSf5+q39FDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b21665bfc042e62aaa2eaae517010680d341298dcb5e0eb907b9b57676777ccb","last_reissued_at":"2026-05-18T00:05:52.991192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:52.991192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Free Pseudodistance Growth Rates for Spatially Coupled LDPC Codes over the BEC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cunlu Zhou, David G. M. Mitchell, Roxana Smarandache","submitted_at":"2018-09-12T04:44:53Z","abstract_excerpt":"The minimum pseudoweight is an important parameter related to the decoding performance of LDPC codes with iterative message-passing decoding. In this paper, we consider ensembles of periodically time-varying spatially coupled LDPC (SC-LDPC) codes and the pseudocodewords arising from their finite graph covers of a fixed degree. We show that for certain $(J,K)$-regular SC-LDPC code ensembles and a fixed cover degree, the typical minimum pseudoweight of the unterminated (and associated tail-biting/terminated) SC-LDPC code ensembles grows linearly with the constraint (block) length as the constrai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04253","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.04253","created_at":"2026-05-18T00:05:52.991337+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.04253v1","created_at":"2026-05-18T00:05:52.991337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04253","created_at":"2026-05-18T00:05:52.991337+00:00"},{"alias_kind":"pith_short_12","alias_value":"WILGLP6AILTC","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WILGLP6AILTCVKRO","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WILGLP6A","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WILGLP6AILTCVKROVLSROAIGQD","json":"https://pith.science/pith/WILGLP6AILTCVKROVLSROAIGQD.json","graph_json":"https://pith.science/api/pith-number/WILGLP6AILTCVKROVLSROAIGQD/graph.json","events_json":"https://pith.science/api/pith-number/WILGLP6AILTCVKROVLSROAIGQD/events.json","paper":"https://pith.science/paper/WILGLP6A"},"agent_actions":{"view_html":"https://pith.science/pith/WILGLP6AILTCVKROVLSROAIGQD","download_json":"https://pith.science/pith/WILGLP6AILTCVKROVLSROAIGQD.json","view_paper":"https://pith.science/paper/WILGLP6A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.04253&json=true","fetch_graph":"https://pith.science/api/pith-number/WILGLP6AILTCVKROVLSROAIGQD/graph.json","fetch_events":"https://pith.science/api/pith-number/WILGLP6AILTCVKROVLSROAIGQD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WILGLP6AILTCVKROVLSROAIGQD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WILGLP6AILTCVKROVLSROAIGQD/action/storage_attestation","attest_author":"https://pith.science/pith/WILGLP6AILTCVKROVLSROAIGQD/action/author_attestation","sign_citation":"https://pith.science/pith/WILGLP6AILTCVKROVLSROAIGQD/action/citation_signature","submit_replication":"https://pith.science/pith/WILGLP6AILTCVKROVLSROAIGQD/action/replication_record"}},"created_at":"2026-05-18T00:05:52.991337+00:00","updated_at":"2026-05-18T00:05:52.991337+00:00"}