{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:V44O5KUK7LOR4TZFTTVFMHYSTP","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":"9b52d697bbce3af32451f9898aed1b783a240253a3ed1e8ae7601f2b8402f5b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T18:09:36Z","title_canon_sha256":"941728d9c0ff99afc6f2c206f9119de085865c552b8351eed32a8232aec7cd3d"},"schema_version":"1.0","source":{"id":"1601.07122","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07122","created_at":"2026-05-18T01:00:53Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07122v3","created_at":"2026-05-18T01:00:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07122","created_at":"2026-05-18T01:00:53Z"},{"alias_kind":"pith_short_12","alias_value":"V44O5KUK7LOR","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"V44O5KUK7LOR4TZF","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"V44O5KUK","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:5bda69fdf9e1b6a2a8ab11387d43d20fdd447e6e9b55c099b2026d568bd6ae56","target":"graph","created_at":"2026-05-18T01:00:53Z","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":"The focus of this paper is on linear, binary codes with locality having locality parameter $r$, that are capable of recovering from $t\\geq 2$ erasures and that moreover, have short block length. Both sequential and parallel (through orthogonal parity checks) recovery is considered here. In the case of parallel repair, minimum-block-length constructions for general $t$ are discussed. In the case of sequential repair, the results include (a) extending and characterizing minimum-block-length constructions for $t=2$, (b) providing improved bounds on block length for $t=3$ as well as a general cons","authors_text":"K. P. Prasanth, P. Vijay Kumar, S. B. Balaji","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T18:09:36Z","title":"Binary Codes with Locality for Multiple Erasures Having Short Block Length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07122","kind":"arxiv","version":3},"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:dd608bdfd3850a8fe795b226e5b9ccd1974a29d96160816395542b28f5e4c897","target":"record","created_at":"2026-05-18T01:00:53Z","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":"9b52d697bbce3af32451f9898aed1b783a240253a3ed1e8ae7601f2b8402f5b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T18:09:36Z","title_canon_sha256":"941728d9c0ff99afc6f2c206f9119de085865c552b8351eed32a8232aec7cd3d"},"schema_version":"1.0","source":{"id":"1601.07122","kind":"arxiv","version":3}},"canonical_sha256":"af38eeaa8afadd1e4f259cea561f129bca48b7b3b968584ae461e56d3a316ef4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af38eeaa8afadd1e4f259cea561f129bca48b7b3b968584ae461e56d3a316ef4","first_computed_at":"2026-05-18T01:00:53.393239Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:53.393239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sCJwqvAeniJnymKeeQMjo8VbX18LxTkMQiQcv1PH6eKNSFHjQoHWHA3cgVmL0//fmmyCJS1RmJ99TSSTQ094BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:53.393805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.07122","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd608bdfd3850a8fe795b226e5b9ccd1974a29d96160816395542b28f5e4c897","sha256:5bda69fdf9e1b6a2a8ab11387d43d20fdd447e6e9b55c099b2026d568bd6ae56"],"state_sha256":"35fd4c8df00bc66a3940690f6a7200189c665cc2c74d6edd65187c8c0607599f"}