{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JOWHG3TMNVJRL3OGW5TZT5SEFR","short_pith_number":"pith:JOWHG3TM","schema_version":"1.0","canonical_sha256":"4bac736e6c6d5315edc6b76799f6442c62d6ac5e3daebccfc43baa152b218b4e","source":{"kind":"arxiv","id":"1702.02642","version":2},"attestation_state":"computed","paper":{"title":"On minimum distance of locally repairable codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Massoud Ardakani, Mehrtash Mehrabi","submitted_at":"2017-02-08T22:41:40Z","abstract_excerpt":"Distributed and cloud storage systems are used to reliably store large-scale data. Erasure codes have been recently proposed and used in real-world distributed and cloud storage systems such as Google File System, Microsoft Azure Storage, and Facebook HDFS-RAID, to enhance the reliability. In order to decrease the repair bandwidth and disk I/O, a class of erasure codes called locally repairable codes (LRCs) have been proposed which have small locality compare to other erasure codes. Although LRCs have small locality, they have lower minimum distance compare to the Singleton bound. Hence, seeki"},"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":"1702.02642","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-08T22:41:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"64dd198928e6cf0b84c1c5696c98d9656fc21ce6107848e4196478a862012f91","abstract_canon_sha256":"78dc8b7f5691ea91a176a505394215140598c4550c3dcce33a2ce746c355bcb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:51.519601Z","signature_b64":"maA7IxdDkx3CVC+JkTSL7ZnwiQazaBHSM3X31W2g2I+SFnikId/NK+fDo8+n+tFKrgK1dKDDnQvo/VvoFFXFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bac736e6c6d5315edc6b76799f6442c62d6ac5e3daebccfc43baa152b218b4e","last_reissued_at":"2026-05-18T00:35:51.519170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:51.519170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On minimum distance of locally repairable codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Massoud Ardakani, Mehrtash Mehrabi","submitted_at":"2017-02-08T22:41:40Z","abstract_excerpt":"Distributed and cloud storage systems are used to reliably store large-scale data. Erasure codes have been recently proposed and used in real-world distributed and cloud storage systems such as Google File System, Microsoft Azure Storage, and Facebook HDFS-RAID, to enhance the reliability. In order to decrease the repair bandwidth and disk I/O, a class of erasure codes called locally repairable codes (LRCs) have been proposed which have small locality compare to other erasure codes. Although LRCs have small locality, they have lower minimum distance compare to the Singleton bound. Hence, seeki"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02642","kind":"arxiv","version":2},"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":"1702.02642","created_at":"2026-05-18T00:35:51.519231+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02642v2","created_at":"2026-05-18T00:35:51.519231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02642","created_at":"2026-05-18T00:35:51.519231+00:00"},{"alias_kind":"pith_short_12","alias_value":"JOWHG3TMNVJR","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JOWHG3TMNVJRL3OG","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JOWHG3TM","created_at":"2026-05-18T12:31:24.725408+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/JOWHG3TMNVJRL3OGW5TZT5SEFR","json":"https://pith.science/pith/JOWHG3TMNVJRL3OGW5TZT5SEFR.json","graph_json":"https://pith.science/api/pith-number/JOWHG3TMNVJRL3OGW5TZT5SEFR/graph.json","events_json":"https://pith.science/api/pith-number/JOWHG3TMNVJRL3OGW5TZT5SEFR/events.json","paper":"https://pith.science/paper/JOWHG3TM"},"agent_actions":{"view_html":"https://pith.science/pith/JOWHG3TMNVJRL3OGW5TZT5SEFR","download_json":"https://pith.science/pith/JOWHG3TMNVJRL3OGW5TZT5SEFR.json","view_paper":"https://pith.science/paper/JOWHG3TM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02642&json=true","fetch_graph":"https://pith.science/api/pith-number/JOWHG3TMNVJRL3OGW5TZT5SEFR/graph.json","fetch_events":"https://pith.science/api/pith-number/JOWHG3TMNVJRL3OGW5TZT5SEFR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JOWHG3TMNVJRL3OGW5TZT5SEFR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JOWHG3TMNVJRL3OGW5TZT5SEFR/action/storage_attestation","attest_author":"https://pith.science/pith/JOWHG3TMNVJRL3OGW5TZT5SEFR/action/author_attestation","sign_citation":"https://pith.science/pith/JOWHG3TMNVJRL3OGW5TZT5SEFR/action/citation_signature","submit_replication":"https://pith.science/pith/JOWHG3TMNVJRL3OGW5TZT5SEFR/action/replication_record"}},"created_at":"2026-05-18T00:35:51.519231+00:00","updated_at":"2026-05-18T00:35:51.519231+00:00"}