{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UZJQHWDRTZ3I7Z6DAR5WVI4SUB","short_pith_number":"pith:UZJQHWDR","schema_version":"1.0","canonical_sha256":"a65303d8719e768fe7c3047b6aa392a07e7cc05a82b6a9a0eb13fd27a1cd997a","source":{"kind":"arxiv","id":"1310.3724","version":1},"attestation_state":"computed","paper":{"title":"Spatially Coupled Sparse Codes on Graphs - Theory and Practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello, David G. M. Mitchell, Joerg Kliewer, Jr., Lara Dolecek, Roxana Smarandache, Thomas E. Fuja","submitted_at":"2013-10-14T15:37:39Z","abstract_excerpt":"Since the discovery of turbo codes 20 years ago and the subsequent re-discovery of low-density parity-check codes a few years later, the field of channel coding has experienced a number of major advances. Up until that time, code designers were usually happy with performance that came within a few decibels of the Shannon Limit, primarily due to implementation complexity constraints, whereas the new coding techniques now allow performance within a small fraction of a decibel of capacity with modest encoding and decoding complexity. Due to these significant improvements, coding standards in appl"},"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":"1310.3724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-14T15:37:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d6200ebd36973dfb9eddd982517edccc092ca60e23b8fd5b23a53a626294ee12","abstract_canon_sha256":"a7dc75eaae5583625312a774d7df1272a0e6fce1b90f8bea274ae55a0e588ce6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:41.923152Z","signature_b64":"L4Pz7GXNruQ6XaScaTekmh0HhKiMHztUOM6YAI+fFQ1a7yYpERddwYypIzrujCaTn88z5by0ZNmt34GjRNF0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a65303d8719e768fe7c3047b6aa392a07e7cc05a82b6a9a0eb13fd27a1cd997a","last_reissued_at":"2026-05-18T00:58:41.922413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:41.922413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatially Coupled Sparse Codes on Graphs - Theory and Practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello, David G. M. Mitchell, Joerg Kliewer, Jr., Lara Dolecek, Roxana Smarandache, Thomas E. Fuja","submitted_at":"2013-10-14T15:37:39Z","abstract_excerpt":"Since the discovery of turbo codes 20 years ago and the subsequent re-discovery of low-density parity-check codes a few years later, the field of channel coding has experienced a number of major advances. Up until that time, code designers were usually happy with performance that came within a few decibels of the Shannon Limit, primarily due to implementation complexity constraints, whereas the new coding techniques now allow performance within a small fraction of a decibel of capacity with modest encoding and decoding complexity. Due to these significant improvements, coding standards in appl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3724","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":"1310.3724","created_at":"2026-05-18T00:58:41.922544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.3724v1","created_at":"2026-05-18T00:58:41.922544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3724","created_at":"2026-05-18T00:58:41.922544+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZJQHWDRTZ3I","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZJQHWDRTZ3I7Z6D","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZJQHWDR","created_at":"2026-05-18T12:28:02.375192+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/UZJQHWDRTZ3I7Z6DAR5WVI4SUB","json":"https://pith.science/pith/UZJQHWDRTZ3I7Z6DAR5WVI4SUB.json","graph_json":"https://pith.science/api/pith-number/UZJQHWDRTZ3I7Z6DAR5WVI4SUB/graph.json","events_json":"https://pith.science/api/pith-number/UZJQHWDRTZ3I7Z6DAR5WVI4SUB/events.json","paper":"https://pith.science/paper/UZJQHWDR"},"agent_actions":{"view_html":"https://pith.science/pith/UZJQHWDRTZ3I7Z6DAR5WVI4SUB","download_json":"https://pith.science/pith/UZJQHWDRTZ3I7Z6DAR5WVI4SUB.json","view_paper":"https://pith.science/paper/UZJQHWDR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.3724&json=true","fetch_graph":"https://pith.science/api/pith-number/UZJQHWDRTZ3I7Z6DAR5WVI4SUB/graph.json","fetch_events":"https://pith.science/api/pith-number/UZJQHWDRTZ3I7Z6DAR5WVI4SUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZJQHWDRTZ3I7Z6DAR5WVI4SUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZJQHWDRTZ3I7Z6DAR5WVI4SUB/action/storage_attestation","attest_author":"https://pith.science/pith/UZJQHWDRTZ3I7Z6DAR5WVI4SUB/action/author_attestation","sign_citation":"https://pith.science/pith/UZJQHWDRTZ3I7Z6DAR5WVI4SUB/action/citation_signature","submit_replication":"https://pith.science/pith/UZJQHWDRTZ3I7Z6DAR5WVI4SUB/action/replication_record"}},"created_at":"2026-05-18T00:58:41.922544+00:00","updated_at":"2026-05-18T00:58:41.922544+00:00"}