{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DKTKC4ZUCPOEQ7LNKAKWO35ESH","short_pith_number":"pith:DKTKC4ZU","canonical_record":{"source":{"id":"1308.5211","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-23T19:10:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b59ac2474c604b2e680c832f385774891eade85b9838ac7a5857f60694912f69","abstract_canon_sha256":"8a93968b15cc02d6a2e0b794658708ff374a3fddd3836c3aedbf85faeb5cd869"},"schema_version":"1.0"},"canonical_sha256":"1aa6a1733413dc487d6d5015676fa491feb199a529277ba780597805ad86883f","source":{"kind":"arxiv","id":"1308.5211","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5211","created_at":"2026-05-18T02:45:14Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5211v3","created_at":"2026-05-18T02:45:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5211","created_at":"2026-05-18T02:45:14Z"},{"alias_kind":"pith_short_12","alias_value":"DKTKC4ZUCPOE","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DKTKC4ZUCPOEQ7LN","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DKTKC4ZU","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DKTKC4ZUCPOEQ7LNKAKWO35ESH","target":"record","payload":{"canonical_record":{"source":{"id":"1308.5211","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-23T19:10:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b59ac2474c604b2e680c832f385774891eade85b9838ac7a5857f60694912f69","abstract_canon_sha256":"8a93968b15cc02d6a2e0b794658708ff374a3fddd3836c3aedbf85faeb5cd869"},"schema_version":"1.0"},"canonical_sha256":"1aa6a1733413dc487d6d5015676fa491feb199a529277ba780597805ad86883f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:14.571596Z","signature_b64":"cmm5S1BTVnsH5d+5cTuLLCHBUwEXzn0Zy6W2JwHJWJ26qTWLRUpU2hQFlczv1XvTt73/WYWg1Bbn2tfNyriPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1aa6a1733413dc487d6d5015676fa491feb199a529277ba780597805ad86883f","last_reissued_at":"2026-05-18T02:45:14.571033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:14.571033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.5211","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:45:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eC4VsxGQh72/NcBjHXPtMzXPiimCgPcWWjRz/LrVuHLhqchXt4dAXltQ1kdEV4dhrgJ/rYO5jkfWkuWkl4f5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:12:55.846383Z"},"content_sha256":"99961b2b33010b4051075c6911106d7483d83d4e0d51618f8e34d9884bcada68","schema_version":"1.0","event_id":"sha256:99961b2b33010b4051075c6911106d7483d83d4e0d51618f8e34d9884bcada68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DKTKC4ZUCPOEQ7LNKAKWO35ESH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-layer Locally Repairable Codes for Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongmei Xie, Zhiyuan Yan","submitted_at":"2013-08-23T19:10:27Z","abstract_excerpt":"In this paper, we propose locally repairable codes (LRCs) with optimal minimum distance for distributed storage systems (DSS). A two-layer encoding structure is employed to ensure data reconstruction and the designated repair locality. The data is first encoded in the first layer by any existing maximum distance separable (MDS) codes, and then the encoded symbols are divided into non-overlapping groups and encoded by an MDS array code in the second layer. The encoding in the second layer provides enough redundancy for local repair, while the overall code performs recovery of the data based on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5211","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:45:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNIsW0/IRI9VNgr+3OVI0BhlRiwtZfiecNrqewLL0yrSocdXy3w6x0aSaW3uPCXwgsH5vicsUAHaMiDlJgJYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:12:55.846775Z"},"content_sha256":"cb66274ac6e6f2aab73af452a98e7293a6eafb94dcc3f2e49549d6547f06d51f","schema_version":"1.0","event_id":"sha256:cb66274ac6e6f2aab73af452a98e7293a6eafb94dcc3f2e49549d6547f06d51f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DKTKC4ZUCPOEQ7LNKAKWO35ESH/bundle.json","state_url":"https://pith.science/pith/DKTKC4ZUCPOEQ7LNKAKWO35ESH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DKTKC4ZUCPOEQ7LNKAKWO35ESH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T11:12:55Z","links":{"resolver":"https://pith.science/pith/DKTKC4ZUCPOEQ7LNKAKWO35ESH","bundle":"https://pith.science/pith/DKTKC4ZUCPOEQ7LNKAKWO35ESH/bundle.json","state":"https://pith.science/pith/DKTKC4ZUCPOEQ7LNKAKWO35ESH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DKTKC4ZUCPOEQ7LNKAKWO35ESH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DKTKC4ZUCPOEQ7LNKAKWO35ESH","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":"8a93968b15cc02d6a2e0b794658708ff374a3fddd3836c3aedbf85faeb5cd869","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-23T19:10:27Z","title_canon_sha256":"b59ac2474c604b2e680c832f385774891eade85b9838ac7a5857f60694912f69"},"schema_version":"1.0","source":{"id":"1308.5211","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5211","created_at":"2026-05-18T02:45:14Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5211v3","created_at":"2026-05-18T02:45:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5211","created_at":"2026-05-18T02:45:14Z"},{"alias_kind":"pith_short_12","alias_value":"DKTKC4ZUCPOE","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DKTKC4ZUCPOEQ7LN","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DKTKC4ZU","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:cb66274ac6e6f2aab73af452a98e7293a6eafb94dcc3f2e49549d6547f06d51f","target":"graph","created_at":"2026-05-18T02:45:14Z","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":"In this paper, we propose locally repairable codes (LRCs) with optimal minimum distance for distributed storage systems (DSS). A two-layer encoding structure is employed to ensure data reconstruction and the designated repair locality. The data is first encoded in the first layer by any existing maximum distance separable (MDS) codes, and then the encoded symbols are divided into non-overlapping groups and encoded by an MDS array code in the second layer. The encoding in the second layer provides enough redundancy for local repair, while the overall code performs recovery of the data based on ","authors_text":"Hongmei Xie, Zhiyuan Yan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-23T19:10:27Z","title":"Two-layer Locally Repairable Codes for Distributed Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5211","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:99961b2b33010b4051075c6911106d7483d83d4e0d51618f8e34d9884bcada68","target":"record","created_at":"2026-05-18T02:45:14Z","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":"8a93968b15cc02d6a2e0b794658708ff374a3fddd3836c3aedbf85faeb5cd869","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-23T19:10:27Z","title_canon_sha256":"b59ac2474c604b2e680c832f385774891eade85b9838ac7a5857f60694912f69"},"schema_version":"1.0","source":{"id":"1308.5211","kind":"arxiv","version":3}},"canonical_sha256":"1aa6a1733413dc487d6d5015676fa491feb199a529277ba780597805ad86883f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1aa6a1733413dc487d6d5015676fa491feb199a529277ba780597805ad86883f","first_computed_at":"2026-05-18T02:45:14.571033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:14.571033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cmm5S1BTVnsH5d+5cTuLLCHBUwEXzn0Zy6W2JwHJWJ26qTWLRUpU2hQFlczv1XvTt73/WYWg1Bbn2tfNyriPAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:14.571596Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.5211","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99961b2b33010b4051075c6911106d7483d83d4e0d51618f8e34d9884bcada68","sha256:cb66274ac6e6f2aab73af452a98e7293a6eafb94dcc3f2e49549d6547f06d51f"],"state_sha256":"194e6177317f49a19acc989b6104c7671affc1949b8903495b18ef186f5f06cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pzPvY3p+O5RgTNiqiFu5OClRQk6hv407+wKJhU6i0KGlABPmkI/r8sZMdGgOvm+eIfYXCSF/zRYINi5rDDJ5DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:12:55.849532Z","bundle_sha256":"b120ed0ac957d604df38af69d2d6d2bbd467d71ad55bfe7ab851ee29c50683e9"}}