{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EU6EXVSJ2LRE3PIDLKXIXIZGMQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fac69c705aefd3e3ec9df669001df9a010b17f52803f76b1ca5153db59a9daa0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T07:00:23Z","title_canon_sha256":"2288588fe623a23ae1fe18da376e0c6eeca4215a755fa018f2dbe19b449769c6"},"schema_version":"1.0","source":{"id":"1701.07184","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07184","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07184v1","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07184","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"pith_short_12","alias_value":"EU6EXVSJ2LRE","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EU6EXVSJ2LRE3PID","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EU6EXVSJ","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:3d91b7960edc489a6a388f10a4a55cfe5daf8261a7b696d174f31b06a4d74c07","target":"graph","created_at":"2026-05-18T00:52:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Evyatar Hemo, Martin Bossert, Sven Puchinger, Yuval Cassuto","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T07:00:23Z","title":"Multi-Block Interleaved Codes for Local and Global Read Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07184","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2104040a18cae3dde516b3169e6f2a5ade0f301c3084414e7b5fd62642867701","target":"record","created_at":"2026-05-18T00:52:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fac69c705aefd3e3ec9df669001df9a010b17f52803f76b1ca5153db59a9daa0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T07:00:23Z","title_canon_sha256":"2288588fe623a23ae1fe18da376e0c6eeca4215a755fa018f2dbe19b449769c6"},"schema_version":"1.0","source":{"id":"1701.07184","kind":"arxiv","version":1}},"canonical_sha256":"253c4bd649d2e24dbd035aae8ba3266402f6f1b1963d48d5f2f9812f05c9a911","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"253c4bd649d2e24dbd035aae8ba3266402f6f1b1963d48d5f2f9812f05c9a911","first_computed_at":"2026-05-18T00:52:07.240188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:07.240188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CS/+DTfbu+IICFh6GCIO1tVgtREEyTQLPGQhCA5+AfrTlMunTCRIq9RDzn5YOhBteN/iPJmjSDmOuC+xOxCQBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:07.240798Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07184","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2104040a18cae3dde516b3169e6f2a5ade0f301c3084414e7b5fd62642867701","sha256:3d91b7960edc489a6a388f10a4a55cfe5daf8261a7b696d174f31b06a4d74c07"],"state_sha256":"81aa7f48d50e80ca4883e1bd95f504fd2b119ba73a3de01fd8f92a9521434ca0"}