{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NYXO3QVPKLYVSOQVB236O3NHEM","short_pith_number":"pith:NYXO3QVP","canonical_record":{"source":{"id":"1312.3194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-11T14:50:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ffbcb8defe4304377a34dbaa973315a667f282897a4e138ad155166bc1564f9f","abstract_canon_sha256":"7160bababafe14cb602531c16f0c0d091224e347269b1ac3ecf327b82bcd1e89"},"schema_version":"1.0"},"canonical_sha256":"6e2eedc2af52f1593a150eb7e76da7232788eb473da37ebad8eb8b6733e09ac9","source":{"kind":"arxiv","id":"1312.3194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3194","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3194v1","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3194","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"NYXO3QVPKLYV","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NYXO3QVPKLYVSOQV","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NYXO3QVP","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NYXO3QVPKLYVSOQVB236O3NHEM","target":"record","payload":{"canonical_record":{"source":{"id":"1312.3194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-11T14:50:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ffbcb8defe4304377a34dbaa973315a667f282897a4e138ad155166bc1564f9f","abstract_canon_sha256":"7160bababafe14cb602531c16f0c0d091224e347269b1ac3ecf327b82bcd1e89"},"schema_version":"1.0"},"canonical_sha256":"6e2eedc2af52f1593a150eb7e76da7232788eb473da37ebad8eb8b6733e09ac9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:00.229519Z","signature_b64":"U+91GmyKH0tcS8Fhbwz8mDyjL7gjp2CaY8gvbEd0nwd/y315CX4x4iAiZj5hcDu1X7c/hIEJU9B0368hKG8tCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e2eedc2af52f1593a150eb7e76da7232788eb473da37ebad8eb8b6733e09ac9","last_reissued_at":"2026-05-18T03:05:00.228972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:00.228972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.3194","source_version":1,"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-18T03:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Axx4RMb1MTy+Fn6BPISzX41JJfK6h+z1DQzuQu5GITgyLAkwJj3QE8ePreqz1QjYOrdTa1ZlEJpO9KCVHzNwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:23:19.368044Z"},"content_sha256":"17c22cf14e908e087444987afeeec10366f184d7fd3dd2dc066f74ff5d217f6a","schema_version":"1.0","event_id":"sha256:17c22cf14e908e087444987afeeec10366f184d7fd3dd2dc066f74ff5d217f6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NYXO3QVPKLYVSOQVB236O3NHEM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ankit Singh Rawat, Natalia Silberstein, Sriram Vishwanath","submitted_at":"2013-12-11T14:50:08Z","abstract_excerpt":"This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable codes. The concatenated coding scheme brings together a maximum rank distance (MRD) code as an outer code and either a globally regenerating or a locally repairable code as an inner code. Also, error resilience for combination of locally repairable codes with regenerating codes is considered. This concatenated coding system is designed to handle two differe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3194","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"},"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-18T03:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z+ei5fQApYtczIIss1Jqto1gQIkFi7XG4QwEZlRxcDErpZuFGQRmlj+/UzBmrNxKbQfYStOwOzpVtzVterqmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:23:19.368460Z"},"content_sha256":"dce7731b05452d3a7ba409069ad307e46e60254676527d6af48b5176f36012a2","schema_version":"1.0","event_id":"sha256:dce7731b05452d3a7ba409069ad307e46e60254676527d6af48b5176f36012a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYXO3QVPKLYVSOQVB236O3NHEM/bundle.json","state_url":"https://pith.science/pith/NYXO3QVPKLYVSOQVB236O3NHEM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYXO3QVPKLYVSOQVB236O3NHEM/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-30T13:23:19Z","links":{"resolver":"https://pith.science/pith/NYXO3QVPKLYVSOQVB236O3NHEM","bundle":"https://pith.science/pith/NYXO3QVPKLYVSOQVB236O3NHEM/bundle.json","state":"https://pith.science/pith/NYXO3QVPKLYVSOQVB236O3NHEM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYXO3QVPKLYVSOQVB236O3NHEM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NYXO3QVPKLYVSOQVB236O3NHEM","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":"7160bababafe14cb602531c16f0c0d091224e347269b1ac3ecf327b82bcd1e89","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-11T14:50:08Z","title_canon_sha256":"ffbcb8defe4304377a34dbaa973315a667f282897a4e138ad155166bc1564f9f"},"schema_version":"1.0","source":{"id":"1312.3194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3194","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3194v1","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3194","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"NYXO3QVPKLYV","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NYXO3QVPKLYVSOQV","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NYXO3QVP","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:dce7731b05452d3a7ba409069ad307e46e60254676527d6af48b5176f36012a2","target":"graph","created_at":"2026-05-18T03:05:00Z","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":"This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable codes. The concatenated coding scheme brings together a maximum rank distance (MRD) code as an outer code and either a globally regenerating or a locally repairable code as an inner code. Also, error resilience for combination of locally repairable codes with regenerating codes is considered. This concatenated coding system is designed to handle two differe","authors_text":"Ankit Singh Rawat, Natalia Silberstein, Sriram Vishwanath","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-11T14:50:08Z","title":"Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3194","kind":"arxiv","version":1},"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:17c22cf14e908e087444987afeeec10366f184d7fd3dd2dc066f74ff5d217f6a","target":"record","created_at":"2026-05-18T03:05:00Z","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":"7160bababafe14cb602531c16f0c0d091224e347269b1ac3ecf327b82bcd1e89","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-11T14:50:08Z","title_canon_sha256":"ffbcb8defe4304377a34dbaa973315a667f282897a4e138ad155166bc1564f9f"},"schema_version":"1.0","source":{"id":"1312.3194","kind":"arxiv","version":1}},"canonical_sha256":"6e2eedc2af52f1593a150eb7e76da7232788eb473da37ebad8eb8b6733e09ac9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e2eedc2af52f1593a150eb7e76da7232788eb473da37ebad8eb8b6733e09ac9","first_computed_at":"2026-05-18T03:05:00.228972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:00.228972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U+91GmyKH0tcS8Fhbwz8mDyjL7gjp2CaY8gvbEd0nwd/y315CX4x4iAiZj5hcDu1X7c/hIEJU9B0368hKG8tCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:00.229519Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17c22cf14e908e087444987afeeec10366f184d7fd3dd2dc066f74ff5d217f6a","sha256:dce7731b05452d3a7ba409069ad307e46e60254676527d6af48b5176f36012a2"],"state_sha256":"1d84327a1880778fb8b55665e5a262a311993edf58bfe8efc2e77d9608aed30e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JhqbVDTVoUq5XbuUXEzQQwLsoSuYROCKcT5BxebANwoUFafTen3+DrZ2aYnpyNzTm4I2CR56UxM8jiB7ssyaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:23:19.370468Z","bundle_sha256":"996aab388cf41f1632d06e2210003efe2a7ecbc13b5df888173314c8e339e6ca"}}