{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CQKSQHVQJSOVXWMQNMKOXTZPBN","short_pith_number":"pith:CQKSQHVQ","schema_version":"1.0","canonical_sha256":"1415281eb04c9d5bd9906b14ebcf2f0b44a4c4b0d0111a03cedfe56ca18ccd7a","source":{"kind":"arxiv","id":"1712.08566","version":2},"attestation_state":"computed","paper":{"title":"Extended Product and Integrated Interleaved Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mario Blaum, Steven Hetzler","submitted_at":"2017-12-21T16:32:49Z","abstract_excerpt":"A new class of codes, Extended Product (EPC) Codes, consisting of a product code with a number of extra parities added, is presented and applications for erasure decoding are discussed. An upper bound on the minimum distance of EPC codes is given, as well as constructions meeting the bound for some relevant cases. A special case of EPC codes, Extended Integrated Interleaved (EII) codes, which naturally unify Integrated Interleaved (II) codes and product codes, is defined and studied in detail. It is shown that EII codes often improve the minimum distance of II codes with the same rate, and the"},"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":"1712.08566","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-21T16:32:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d298b6b3f78536d9c466763eaa5a0c294c7a8aad050f26b04ebcf98fdc95eba4","abstract_canon_sha256":"d3f95b8f32140d16d554c105edb7d852768a02034af08e93c924cb614c5168af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:04.227250Z","signature_b64":"jYibB1AhxGgi3rQNj5eTiclWmjpb1TxOYmaVe2WeAlJdfYlom6t9MVKONyZDLAtxe2awJ81ESHB2Ho/nlZ0sDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1415281eb04c9d5bd9906b14ebcf2f0b44a4c4b0d0111a03cedfe56ca18ccd7a","last_reissued_at":"2026-05-18T00:27:04.226799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:04.226799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extended Product and Integrated Interleaved Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mario Blaum, Steven Hetzler","submitted_at":"2017-12-21T16:32:49Z","abstract_excerpt":"A new class of codes, Extended Product (EPC) Codes, consisting of a product code with a number of extra parities added, is presented and applications for erasure decoding are discussed. An upper bound on the minimum distance of EPC codes is given, as well as constructions meeting the bound for some relevant cases. A special case of EPC codes, Extended Integrated Interleaved (EII) codes, which naturally unify Integrated Interleaved (II) codes and product codes, is defined and studied in detail. It is shown that EII codes often improve the minimum distance of II codes with the same rate, and the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08566","kind":"arxiv","version":2},"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":"1712.08566","created_at":"2026-05-18T00:27:04.226863+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.08566v2","created_at":"2026-05-18T00:27:04.226863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08566","created_at":"2026-05-18T00:27:04.226863+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQKSQHVQJSOV","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQKSQHVQJSOVXWMQ","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQKSQHVQ","created_at":"2026-05-18T12:31:10.602751+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/CQKSQHVQJSOVXWMQNMKOXTZPBN","json":"https://pith.science/pith/CQKSQHVQJSOVXWMQNMKOXTZPBN.json","graph_json":"https://pith.science/api/pith-number/CQKSQHVQJSOVXWMQNMKOXTZPBN/graph.json","events_json":"https://pith.science/api/pith-number/CQKSQHVQJSOVXWMQNMKOXTZPBN/events.json","paper":"https://pith.science/paper/CQKSQHVQ"},"agent_actions":{"view_html":"https://pith.science/pith/CQKSQHVQJSOVXWMQNMKOXTZPBN","download_json":"https://pith.science/pith/CQKSQHVQJSOVXWMQNMKOXTZPBN.json","view_paper":"https://pith.science/paper/CQKSQHVQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.08566&json=true","fetch_graph":"https://pith.science/api/pith-number/CQKSQHVQJSOVXWMQNMKOXTZPBN/graph.json","fetch_events":"https://pith.science/api/pith-number/CQKSQHVQJSOVXWMQNMKOXTZPBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQKSQHVQJSOVXWMQNMKOXTZPBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQKSQHVQJSOVXWMQNMKOXTZPBN/action/storage_attestation","attest_author":"https://pith.science/pith/CQKSQHVQJSOVXWMQNMKOXTZPBN/action/author_attestation","sign_citation":"https://pith.science/pith/CQKSQHVQJSOVXWMQNMKOXTZPBN/action/citation_signature","submit_replication":"https://pith.science/pith/CQKSQHVQJSOVXWMQNMKOXTZPBN/action/replication_record"}},"created_at":"2026-05-18T00:27:04.226863+00:00","updated_at":"2026-05-18T00:27:04.226863+00:00"}