{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VVBC632A37G3JKBFEZT4PX5LYK","short_pith_number":"pith:VVBC632A","schema_version":"1.0","canonical_sha256":"ad422f6f40dfcdb4a8252667c7dfabc2b0b2e17e28e5a66e8255077171eb9e97","source":{"kind":"arxiv","id":"1501.06683","version":1},"attestation_state":"computed","paper":{"title":"Codes With Hierarchical Locality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar","submitted_at":"2015-01-27T08:13:05Z","abstract_excerpt":"In this paper, we study the notion of {\\em codes with hierarchical locality} that is identified as another approach to local recovery from multiple erasures. The well-known class of {\\em codes with locality} is said to possess hierarchical locality with a single level. In a {\\em code with two-level hierarchical locality}, every symbol is protected by an inner-most local code, and another middle-level code of larger dimension containing the local code. We first consider codes with two levels of hierarchical locality, derive an upper bound on the minimum distance, and provide optimal code constr"},"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":"1501.06683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-27T08:13:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"627b98f7cef6a477c951d8fc0594c33c376a0827a3355c6ad86beca25c07d307","abstract_canon_sha256":"1fef17bf13a6033b381debd8ad4971e28d0492affb5868689ade26f5bfb7b173"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:39.368152Z","signature_b64":"/MSEWRNvZoC9rdOYwL/rdcvG/DEwvzIpPxKvRT2HzPzVCv8JIsAuNSGBh0APMBw7JFFqBLtZ5bWSG5ppgRW+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad422f6f40dfcdb4a8252667c7dfabc2b0b2e17e28e5a66e8255077171eb9e97","last_reissued_at":"2026-05-18T02:28:39.367647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:39.367647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Codes With Hierarchical Locality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar","submitted_at":"2015-01-27T08:13:05Z","abstract_excerpt":"In this paper, we study the notion of {\\em codes with hierarchical locality} that is identified as another approach to local recovery from multiple erasures. The well-known class of {\\em codes with locality} is said to possess hierarchical locality with a single level. In a {\\em code with two-level hierarchical locality}, every symbol is protected by an inner-most local code, and another middle-level code of larger dimension containing the local code. We first consider codes with two levels of hierarchical locality, derive an upper bound on the minimum distance, and provide optimal code constr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06683","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":"1501.06683","created_at":"2026-05-18T02:28:39.367722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06683v1","created_at":"2026-05-18T02:28:39.367722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06683","created_at":"2026-05-18T02:28:39.367722+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVBC632A37G3","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVBC632A37G3JKBF","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVBC632A","created_at":"2026-05-18T12:29:47.479230+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/VVBC632A37G3JKBFEZT4PX5LYK","json":"https://pith.science/pith/VVBC632A37G3JKBFEZT4PX5LYK.json","graph_json":"https://pith.science/api/pith-number/VVBC632A37G3JKBFEZT4PX5LYK/graph.json","events_json":"https://pith.science/api/pith-number/VVBC632A37G3JKBFEZT4PX5LYK/events.json","paper":"https://pith.science/paper/VVBC632A"},"agent_actions":{"view_html":"https://pith.science/pith/VVBC632A37G3JKBFEZT4PX5LYK","download_json":"https://pith.science/pith/VVBC632A37G3JKBFEZT4PX5LYK.json","view_paper":"https://pith.science/paper/VVBC632A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06683&json=true","fetch_graph":"https://pith.science/api/pith-number/VVBC632A37G3JKBFEZT4PX5LYK/graph.json","fetch_events":"https://pith.science/api/pith-number/VVBC632A37G3JKBFEZT4PX5LYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVBC632A37G3JKBFEZT4PX5LYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVBC632A37G3JKBFEZT4PX5LYK/action/storage_attestation","attest_author":"https://pith.science/pith/VVBC632A37G3JKBFEZT4PX5LYK/action/author_attestation","sign_citation":"https://pith.science/pith/VVBC632A37G3JKBFEZT4PX5LYK/action/citation_signature","submit_replication":"https://pith.science/pith/VVBC632A37G3JKBFEZT4PX5LYK/action/replication_record"}},"created_at":"2026-05-18T02:28:39.367722+00:00","updated_at":"2026-05-18T02:28:39.367722+00:00"}