{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:V44O5KUK7LOR4TZFTTVFMHYSTP","short_pith_number":"pith:V44O5KUK","schema_version":"1.0","canonical_sha256":"af38eeaa8afadd1e4f259cea561f129bca48b7b3b968584ae461e56d3a316ef4","source":{"kind":"arxiv","id":"1601.07122","version":3},"attestation_state":"computed","paper":{"title":"Binary Codes with Locality for Multiple Erasures Having Short Block Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"K. P. Prasanth, P. Vijay Kumar, S. B. Balaji","submitted_at":"2016-01-26T18:09:36Z","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"},"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":"1601.07122","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T18:09:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"941728d9c0ff99afc6f2c206f9119de085865c552b8351eed32a8232aec7cd3d","abstract_canon_sha256":"9b52d697bbce3af32451f9898aed1b783a240253a3ed1e8ae7601f2b8402f5b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:53.393805Z","signature_b64":"sCJwqvAeniJnymKeeQMjo8VbX18LxTkMQiQcv1PH6eKNSFHjQoHWHA3cgVmL0//fmmyCJS1RmJ99TSSTQ094BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af38eeaa8afadd1e4f259cea561f129bca48b7b3b968584ae461e56d3a316ef4","last_reissued_at":"2026-05-18T01:00:53.393239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:53.393239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Codes with Locality for Multiple Erasures Having Short Block Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"K. P. Prasanth, P. Vijay Kumar, S. B. Balaji","submitted_at":"2016-01-26T18:09:36Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07122","kind":"arxiv","version":3},"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":"1601.07122","created_at":"2026-05-18T01:00:53.393335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.07122v3","created_at":"2026-05-18T01:00:53.393335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07122","created_at":"2026-05-18T01:00:53.393335+00:00"},{"alias_kind":"pith_short_12","alias_value":"V44O5KUK7LOR","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"V44O5KUK7LOR4TZF","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"V44O5KUK","created_at":"2026-05-18T12:30:46.583412+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/V44O5KUK7LOR4TZFTTVFMHYSTP","json":"https://pith.science/pith/V44O5KUK7LOR4TZFTTVFMHYSTP.json","graph_json":"https://pith.science/api/pith-number/V44O5KUK7LOR4TZFTTVFMHYSTP/graph.json","events_json":"https://pith.science/api/pith-number/V44O5KUK7LOR4TZFTTVFMHYSTP/events.json","paper":"https://pith.science/paper/V44O5KUK"},"agent_actions":{"view_html":"https://pith.science/pith/V44O5KUK7LOR4TZFTTVFMHYSTP","download_json":"https://pith.science/pith/V44O5KUK7LOR4TZFTTVFMHYSTP.json","view_paper":"https://pith.science/paper/V44O5KUK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.07122&json=true","fetch_graph":"https://pith.science/api/pith-number/V44O5KUK7LOR4TZFTTVFMHYSTP/graph.json","fetch_events":"https://pith.science/api/pith-number/V44O5KUK7LOR4TZFTTVFMHYSTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V44O5KUK7LOR4TZFTTVFMHYSTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V44O5KUK7LOR4TZFTTVFMHYSTP/action/storage_attestation","attest_author":"https://pith.science/pith/V44O5KUK7LOR4TZFTTVFMHYSTP/action/author_attestation","sign_citation":"https://pith.science/pith/V44O5KUK7LOR4TZFTTVFMHYSTP/action/citation_signature","submit_replication":"https://pith.science/pith/V44O5KUK7LOR4TZFTTVFMHYSTP/action/replication_record"}},"created_at":"2026-05-18T01:00:53.393335+00:00","updated_at":"2026-05-18T01:00:53.393335+00:00"}