{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:OB5UPCYU6IMXAVECPBQL5BJIPH","short_pith_number":"pith:OB5UPCYU","schema_version":"1.0","canonical_sha256":"707b478b14f2197054827860be852879ea1845796a68cd12ec9bee25fac13751","source":{"kind":"arxiv","id":"0709.4466","version":1},"attestation_state":"computed","paper":{"title":"Serially Concatenated IRA Codes","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Benjamin J. Belzer, Krishnamoorthy Sivakumar, Taikun Cheng","submitted_at":"2007-09-27T18:38:09Z","abstract_excerpt":"We address the error floor problem of low-density parity check (LDPC) codes on the binary-input additive white Gaussian noise (AWGN) channel, by constructing a serially concatenated code consisting of two systematic irregular repeat accumulate (IRA) component codes connected by an interleaver. The interleaver is designed to prevent stopping-set error events in one of the IRA codes from propagating into stopping set events of the other code. Simulations with two 128-bit rate 0.707 IRA component codes show that the proposed architecture achieves a much lower error floor at higher SNRs, compared "},"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":"0709.4466","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-09-27T18:38:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e338f960d79c1e4cd569eee17556d84aea17842a00797a0d3c6e4779f078b7b8","abstract_canon_sha256":"27f051a47b406cd767d61c63c6957de4872feebf982fb66244416fc4f9ea59e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:04:32.580773Z","signature_b64":"qA2+EMM/S+wwlMl8rMVH0ZPlKrAbcqzMX0WM8A4+ZXv+glToeBN7fojCtBekMd3jlN2MmwfW9EV9n6WEu94jBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"707b478b14f2197054827860be852879ea1845796a68cd12ec9bee25fac13751","last_reissued_at":"2026-07-04T15:04:32.580400Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:04:32.580400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Serially Concatenated IRA Codes","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Benjamin J. Belzer, Krishnamoorthy Sivakumar, Taikun Cheng","submitted_at":"2007-09-27T18:38:09Z","abstract_excerpt":"We address the error floor problem of low-density parity check (LDPC) codes on the binary-input additive white Gaussian noise (AWGN) channel, by constructing a serially concatenated code consisting of two systematic irregular repeat accumulate (IRA) component codes connected by an interleaver. The interleaver is designed to prevent stopping-set error events in one of the IRA codes from propagating into stopping set events of the other code. Simulations with two 128-bit rate 0.707 IRA component codes show that the proposed architecture achieves a much lower error floor at higher SNRs, compared "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.4466","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0709.4466/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"0709.4466","created_at":"2026-07-04T15:04:32.580464+00:00"},{"alias_kind":"arxiv_version","alias_value":"0709.4466v1","created_at":"2026-07-04T15:04:32.580464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.4466","created_at":"2026-07-04T15:04:32.580464+00:00"},{"alias_kind":"pith_short_12","alias_value":"OB5UPCYU6IMX","created_at":"2026-07-04T15:04:32.580464+00:00"},{"alias_kind":"pith_short_16","alias_value":"OB5UPCYU6IMXAVEC","created_at":"2026-07-04T15:04:32.580464+00:00"},{"alias_kind":"pith_short_8","alias_value":"OB5UPCYU","created_at":"2026-07-04T15:04:32.580464+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/OB5UPCYU6IMXAVECPBQL5BJIPH","json":"https://pith.science/pith/OB5UPCYU6IMXAVECPBQL5BJIPH.json","graph_json":"https://pith.science/api/pith-number/OB5UPCYU6IMXAVECPBQL5BJIPH/graph.json","events_json":"https://pith.science/api/pith-number/OB5UPCYU6IMXAVECPBQL5BJIPH/events.json","paper":"https://pith.science/paper/OB5UPCYU"},"agent_actions":{"view_html":"https://pith.science/pith/OB5UPCYU6IMXAVECPBQL5BJIPH","download_json":"https://pith.science/pith/OB5UPCYU6IMXAVECPBQL5BJIPH.json","view_paper":"https://pith.science/paper/OB5UPCYU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0709.4466&json=true","fetch_graph":"https://pith.science/api/pith-number/OB5UPCYU6IMXAVECPBQL5BJIPH/graph.json","fetch_events":"https://pith.science/api/pith-number/OB5UPCYU6IMXAVECPBQL5BJIPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OB5UPCYU6IMXAVECPBQL5BJIPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OB5UPCYU6IMXAVECPBQL5BJIPH/action/storage_attestation","attest_author":"https://pith.science/pith/OB5UPCYU6IMXAVECPBQL5BJIPH/action/author_attestation","sign_citation":"https://pith.science/pith/OB5UPCYU6IMXAVECPBQL5BJIPH/action/citation_signature","submit_replication":"https://pith.science/pith/OB5UPCYU6IMXAVECPBQL5BJIPH/action/replication_record"}},"created_at":"2026-07-04T15:04:32.580464+00:00","updated_at":"2026-07-04T15:04:32.580464+00:00"}