{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EU6EXVSJ2LRE3PIDLKXIXIZGMQ","short_pith_number":"pith:EU6EXVSJ","schema_version":"1.0","canonical_sha256":"253c4bd649d2e24dbd035aae8ba3266402f6f1b1963d48d5f2f9812f05c9a911","source":{"kind":"arxiv","id":"1701.07184","version":1},"attestation_state":"computed","paper":{"title":"Multi-Block Interleaved Codes for Local and Global Read Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Evyatar Hemo, Martin Bossert, Sven Puchinger, Yuval Cassuto","submitted_at":"2017-01-25T07:00:23Z","abstract_excerpt":"We define multi-block interleaved codes as codes that allow reading information from either a small sub-block or from a larger full block. The former offers faster access, while the latter provides better reliability. We specify the correction capability of the sub-block code through its gap $t$ from optimal minimum distance, and look to have full-block minimum distance that grows with the parameter $t$. We construct two families of such codes when the number of sub-blocks is $3$. The codes match the distance properties of known integrated-interleaving codes, but with the added feature of mapp"},"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":"1701.07184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T07:00:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2288588fe623a23ae1fe18da376e0c6eeca4215a755fa018f2dbe19b449769c6","abstract_canon_sha256":"fac69c705aefd3e3ec9df669001df9a010b17f52803f76b1ca5153db59a9daa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:07.240798Z","signature_b64":"CS/+DTfbu+IICFh6GCIO1tVgtREEyTQLPGQhCA5+AfrTlMunTCRIq9RDzn5YOhBteN/iPJmjSDmOuC+xOxCQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"253c4bd649d2e24dbd035aae8ba3266402f6f1b1963d48d5f2f9812f05c9a911","last_reissued_at":"2026-05-18T00:52:07.240188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:07.240188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Block Interleaved Codes for Local and Global Read Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Evyatar Hemo, Martin Bossert, Sven Puchinger, Yuval Cassuto","submitted_at":"2017-01-25T07:00:23Z","abstract_excerpt":"We define multi-block interleaved codes as codes that allow reading information from either a small sub-block or from a larger full block. The former offers faster access, while the latter provides better reliability. We specify the correction capability of the sub-block code through its gap $t$ from optimal minimum distance, and look to have full-block minimum distance that grows with the parameter $t$. We construct two families of such codes when the number of sub-blocks is $3$. The codes match the distance properties of known integrated-interleaving codes, but with the added feature of mapp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07184","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":"1701.07184","created_at":"2026-05-18T00:52:07.240279+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07184v1","created_at":"2026-05-18T00:52:07.240279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07184","created_at":"2026-05-18T00:52:07.240279+00:00"},{"alias_kind":"pith_short_12","alias_value":"EU6EXVSJ2LRE","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EU6EXVSJ2LRE3PID","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EU6EXVSJ","created_at":"2026-05-18T12:31:12.930513+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/EU6EXVSJ2LRE3PIDLKXIXIZGMQ","json":"https://pith.science/pith/EU6EXVSJ2LRE3PIDLKXIXIZGMQ.json","graph_json":"https://pith.science/api/pith-number/EU6EXVSJ2LRE3PIDLKXIXIZGMQ/graph.json","events_json":"https://pith.science/api/pith-number/EU6EXVSJ2LRE3PIDLKXIXIZGMQ/events.json","paper":"https://pith.science/paper/EU6EXVSJ"},"agent_actions":{"view_html":"https://pith.science/pith/EU6EXVSJ2LRE3PIDLKXIXIZGMQ","download_json":"https://pith.science/pith/EU6EXVSJ2LRE3PIDLKXIXIZGMQ.json","view_paper":"https://pith.science/paper/EU6EXVSJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07184&json=true","fetch_graph":"https://pith.science/api/pith-number/EU6EXVSJ2LRE3PIDLKXIXIZGMQ/graph.json","fetch_events":"https://pith.science/api/pith-number/EU6EXVSJ2LRE3PIDLKXIXIZGMQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EU6EXVSJ2LRE3PIDLKXIXIZGMQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EU6EXVSJ2LRE3PIDLKXIXIZGMQ/action/storage_attestation","attest_author":"https://pith.science/pith/EU6EXVSJ2LRE3PIDLKXIXIZGMQ/action/author_attestation","sign_citation":"https://pith.science/pith/EU6EXVSJ2LRE3PIDLKXIXIZGMQ/action/citation_signature","submit_replication":"https://pith.science/pith/EU6EXVSJ2LRE3PIDLKXIXIZGMQ/action/replication_record"}},"created_at":"2026-05-18T00:52:07.240279+00:00","updated_at":"2026-05-18T00:52:07.240279+00:00"}