{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OLUYPFGGOCZZR75GAQHYRMZXYT","short_pith_number":"pith:OLUYPFGG","schema_version":"1.0","canonical_sha256":"72e98794c670b398ffa6040f88b337c4d66a096f8baf9cfd3fae490b6c6feec6","source":{"kind":"arxiv","id":"1112.0945","version":1},"attestation_state":"computed","paper":{"title":"Interleaved Product LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Franco Chiaraluce, Giovanni Cancellieri, Marco Baldi","submitted_at":"2011-12-05T14:44:02Z","abstract_excerpt":"Product LDPC codes take advantage of LDPC decoding algorithms and the high minimum distance of product codes. We propose to add suitable interleavers to improve the waterfall performance of LDPC decoding. Interleaving also reduces the number of low weight codewords, that gives a further advantage in the error floor region."},"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":"1112.0945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-05T14:44:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f6cd3e47608012ef62c0e134949b4e14dff91c2cb3d79900f7db8489ef351f3b","abstract_canon_sha256":"4236eb6bfb328ad222e38f9788c80d8edf26edeb237d96054e62ba3026e947aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:05.096271Z","signature_b64":"mPMamjFTjZ+fJBM+o441MyygWi6sml5WBpWg1PSCZ7y7jiEJ8Kv+nhRMoMPSu+rwC5pCCNlVRN0n5ZnTksmgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72e98794c670b398ffa6040f88b337c4d66a096f8baf9cfd3fae490b6c6feec6","last_reissued_at":"2026-05-18T03:38:05.095725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:05.095725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interleaved Product LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Franco Chiaraluce, Giovanni Cancellieri, Marco Baldi","submitted_at":"2011-12-05T14:44:02Z","abstract_excerpt":"Product LDPC codes take advantage of LDPC decoding algorithms and the high minimum distance of product codes. We propose to add suitable interleavers to improve the waterfall performance of LDPC decoding. Interleaving also reduces the number of low weight codewords, that gives a further advantage in the error floor region."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0945","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":"1112.0945","created_at":"2026-05-18T03:38:05.095812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.0945v1","created_at":"2026-05-18T03:38:05.095812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0945","created_at":"2026-05-18T03:38:05.095812+00:00"},{"alias_kind":"pith_short_12","alias_value":"OLUYPFGGOCZZ","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OLUYPFGGOCZZR75G","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OLUYPFGG","created_at":"2026-05-18T12:26:37.096874+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/OLUYPFGGOCZZR75GAQHYRMZXYT","json":"https://pith.science/pith/OLUYPFGGOCZZR75GAQHYRMZXYT.json","graph_json":"https://pith.science/api/pith-number/OLUYPFGGOCZZR75GAQHYRMZXYT/graph.json","events_json":"https://pith.science/api/pith-number/OLUYPFGGOCZZR75GAQHYRMZXYT/events.json","paper":"https://pith.science/paper/OLUYPFGG"},"agent_actions":{"view_html":"https://pith.science/pith/OLUYPFGGOCZZR75GAQHYRMZXYT","download_json":"https://pith.science/pith/OLUYPFGGOCZZR75GAQHYRMZXYT.json","view_paper":"https://pith.science/paper/OLUYPFGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.0945&json=true","fetch_graph":"https://pith.science/api/pith-number/OLUYPFGGOCZZR75GAQHYRMZXYT/graph.json","fetch_events":"https://pith.science/api/pith-number/OLUYPFGGOCZZR75GAQHYRMZXYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OLUYPFGGOCZZR75GAQHYRMZXYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OLUYPFGGOCZZR75GAQHYRMZXYT/action/storage_attestation","attest_author":"https://pith.science/pith/OLUYPFGGOCZZR75GAQHYRMZXYT/action/author_attestation","sign_citation":"https://pith.science/pith/OLUYPFGGOCZZR75GAQHYRMZXYT/action/citation_signature","submit_replication":"https://pith.science/pith/OLUYPFGGOCZZR75GAQHYRMZXYT/action/replication_record"}},"created_at":"2026-05-18T03:38:05.095812+00:00","updated_at":"2026-05-18T03:38:05.095812+00:00"}