{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FMAVSNG3ZWR5MJKXEGZB5E55WJ","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":"b1670132328fb92396defba210eacbd1aa8f3015b1d9671f91a88fc2e15ae335","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T14:46:12Z","title_canon_sha256":"b64c29459b3ac6805a8f928c291731bf852aa7485d98ee30a0c13d09fad1b1b9"},"schema_version":"1.0","source":{"id":"1701.07340","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07340","created_at":"2026-05-18T00:11:19Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07340v3","created_at":"2026-05-18T00:11:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07340","created_at":"2026-05-18T00:11:19Z"},{"alias_kind":"pith_short_12","alias_value":"FMAVSNG3ZWR5","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FMAVSNG3ZWR5MJKX","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FMAVSNG3","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:565b951ef0a0f9a5774ee9fb33cbab23b916f29a8f5b89ec1b388bb982849b87","target":"graph","created_at":"2026-05-18T00:11:19Z","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":"When a node in a distributed storage system fails, it needs to be promptly repaired to maintain system integrity. While typical erasure codes can provide a significant storage advantage over replication, they suffer from poor repair efficiency. Locally repairable codes (LRCs) tackle this issue by reducing the number of nodes participating in the repair process (locality), at the cost of reduced minimum distance. In this paper, we study the tradeoff between locality and minimum distance of LRCs with local codes that have arbitrary distance requirements. Unlike existing methods where both the lo","authors_text":"GeonU Kim, Jungwoo Lee","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T14:46:12Z","title":"Locally Repairable Codes with Unequal Local Erasure Correction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07340","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:c75091f79afb28835549f184ea340a961b72f389aa0230157c45ab27c0a44457","target":"record","created_at":"2026-05-18T00:11:19Z","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":"b1670132328fb92396defba210eacbd1aa8f3015b1d9671f91a88fc2e15ae335","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T14:46:12Z","title_canon_sha256":"b64c29459b3ac6805a8f928c291731bf852aa7485d98ee30a0c13d09fad1b1b9"},"schema_version":"1.0","source":{"id":"1701.07340","kind":"arxiv","version":3}},"canonical_sha256":"2b015934dbcda3d6255721b21e93bdb27df2afd51c5f87fb92e0c5b3be84df13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b015934dbcda3d6255721b21e93bdb27df2afd51c5f87fb92e0c5b3be84df13","first_computed_at":"2026-05-18T00:11:19.042844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:19.042844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mgVuk6sL4+XJya1qV32d33aXvSQ9peHU/IqndtjEZ05MY5czatov1O2JtE/ROT4aPN6wITLQbXVBja5l+txMBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:19.043542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07340","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c75091f79afb28835549f184ea340a961b72f389aa0230157c45ab27c0a44457","sha256:565b951ef0a0f9a5774ee9fb33cbab23b916f29a8f5b89ec1b388bb982849b87"],"state_sha256":"41380c1eceb404dc69b86940d47ea7b0a233f9748514d316633f81dd146c3cd3"}