{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PCXTDETUCN5LSQKSZIR6RSBGVY","short_pith_number":"pith:PCXTDETU","canonical_record":{"source":{"id":"1302.0744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-04T16:15:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a6c029b00b271e69f203870fd87cfa3fb3cd525a6a8008db83fd94872970bdc1","abstract_canon_sha256":"08fd30633abb9d3f84e3b16195722b06baf32b91d1f6f278286103d45d8c6173"},"schema_version":"1.0"},"canonical_sha256":"78af319274137ab94152ca23e8c826ae12307dc3c1baa5129bf94c269ced0aa1","source":{"kind":"arxiv","id":"1302.0744","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0744","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0744v2","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0744","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"pith_short_12","alias_value":"PCXTDETUCN5L","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PCXTDETUCN5LSQKS","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PCXTDETU","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PCXTDETUCN5LSQKSZIR6RSBGVY","target":"record","payload":{"canonical_record":{"source":{"id":"1302.0744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-04T16:15:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a6c029b00b271e69f203870fd87cfa3fb3cd525a6a8008db83fd94872970bdc1","abstract_canon_sha256":"08fd30633abb9d3f84e3b16195722b06baf32b91d1f6f278286103d45d8c6173"},"schema_version":"1.0"},"canonical_sha256":"78af319274137ab94152ca23e8c826ae12307dc3c1baa5129bf94c269ced0aa1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:52.430786Z","signature_b64":"icZO4Qpoo5Q2A4Edm9ldBaaFQ7HVWosTOqdJWO7PMGQztCaIX77fJ1jXN/cBIGkdCt0fefn1MFEOAqxsLqYPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78af319274137ab94152ca23e8c826ae12307dc3c1baa5129bf94c269ced0aa1","last_reissued_at":"2026-05-18T03:24:52.430193Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:52.430193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.0744","source_version":2,"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:24:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Up8tL5Y/DeMmscChuMV3++U4cPtVYC1nfeOyq+JRc2VcZHsBBvI/TaxIn+GOlu2aW/SI88Q9QmAtqRhfgUWkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:43:57.807600Z"},"content_sha256":"82339534665742513f94008cb64b746718126b65515d52c2f1461fbfde0f527d","schema_version":"1.0","event_id":"sha256:82339534665742513f94008cb64b746718126b65515d52c2f1461fbfde0f527d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PCXTDETUCN5LSQKSZIR6RSBGVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explicit MBR All-Symbol Locality Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ankit S. Rawat, Govinda M. Kamath, Natalia Silberstein, N. Prakash, O. Ozan Koyluoglu, P. Vijay Kumar, Sriram Vishwanath, V. Lalitha","submitted_at":"2013-02-04T16:15:15Z","abstract_excerpt":"Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e., codes that minimize the total repair bandwidth; and codes with locality, which minimize the number of nodes participating in the repair process. This paper focuses on regenerating codes with locality, using pre-coding based on Gabidulin codes, and presents constructions that utilize minimum bandwidth regenerating (MBR) local codes. The constructions achieve maximum resilience (i.e., optimal minimum distance) and ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0744","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"},"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:24:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MXwPVVU5MIAz3B3XIhEzLjmjz2U0/7YG4bPn9Y9Hut8xvjGPVJRkCma8iv0J8/yq1jHYG18awi4m8sQoVK6HDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:43:57.807995Z"},"content_sha256":"ad1034ba2110f59d9a2bc61ce6d028a671fceaa7ee95a4630c8280a8aae0b027","schema_version":"1.0","event_id":"sha256:ad1034ba2110f59d9a2bc61ce6d028a671fceaa7ee95a4630c8280a8aae0b027"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCXTDETUCN5LSQKSZIR6RSBGVY/bundle.json","state_url":"https://pith.science/pith/PCXTDETUCN5LSQKSZIR6RSBGVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCXTDETUCN5LSQKSZIR6RSBGVY/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-31T05:43:57Z","links":{"resolver":"https://pith.science/pith/PCXTDETUCN5LSQKSZIR6RSBGVY","bundle":"https://pith.science/pith/PCXTDETUCN5LSQKSZIR6RSBGVY/bundle.json","state":"https://pith.science/pith/PCXTDETUCN5LSQKSZIR6RSBGVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCXTDETUCN5LSQKSZIR6RSBGVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PCXTDETUCN5LSQKSZIR6RSBGVY","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":"08fd30633abb9d3f84e3b16195722b06baf32b91d1f6f278286103d45d8c6173","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-04T16:15:15Z","title_canon_sha256":"a6c029b00b271e69f203870fd87cfa3fb3cd525a6a8008db83fd94872970bdc1"},"schema_version":"1.0","source":{"id":"1302.0744","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0744","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0744v2","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0744","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"pith_short_12","alias_value":"PCXTDETUCN5L","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PCXTDETUCN5LSQKS","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PCXTDETU","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:ad1034ba2110f59d9a2bc61ce6d028a671fceaa7ee95a4630c8280a8aae0b027","target":"graph","created_at":"2026-05-18T03:24:52Z","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":"Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e., codes that minimize the total repair bandwidth; and codes with locality, which minimize the number of nodes participating in the repair process. This paper focuses on regenerating codes with locality, using pre-coding based on Gabidulin codes, and presents constructions that utilize minimum bandwidth regenerating (MBR) local codes. The constructions achieve maximum resilience (i.e., optimal minimum distance) and ha","authors_text":"Ankit S. Rawat, Govinda M. Kamath, Natalia Silberstein, N. Prakash, O. Ozan Koyluoglu, P. Vijay Kumar, Sriram Vishwanath, V. Lalitha","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-04T16:15:15Z","title":"Explicit MBR All-Symbol Locality Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0744","kind":"arxiv","version":2},"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:82339534665742513f94008cb64b746718126b65515d52c2f1461fbfde0f527d","target":"record","created_at":"2026-05-18T03:24:52Z","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":"08fd30633abb9d3f84e3b16195722b06baf32b91d1f6f278286103d45d8c6173","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-04T16:15:15Z","title_canon_sha256":"a6c029b00b271e69f203870fd87cfa3fb3cd525a6a8008db83fd94872970bdc1"},"schema_version":"1.0","source":{"id":"1302.0744","kind":"arxiv","version":2}},"canonical_sha256":"78af319274137ab94152ca23e8c826ae12307dc3c1baa5129bf94c269ced0aa1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78af319274137ab94152ca23e8c826ae12307dc3c1baa5129bf94c269ced0aa1","first_computed_at":"2026-05-18T03:24:52.430193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:24:52.430193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"icZO4Qpoo5Q2A4Edm9ldBaaFQ7HVWosTOqdJWO7PMGQztCaIX77fJ1jXN/cBIGkdCt0fefn1MFEOAqxsLqYPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:24:52.430786Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.0744","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82339534665742513f94008cb64b746718126b65515d52c2f1461fbfde0f527d","sha256:ad1034ba2110f59d9a2bc61ce6d028a671fceaa7ee95a4630c8280a8aae0b027"],"state_sha256":"8922b33c1352d40cbae201283780ba72cd133546caa8f2dc5f6b54005baf9724"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZgmWACPI4cw3WcJ0d07vbtOoPDU2aYfLzm50Q1fgO208I9PNRcsHKACuGm/9fKegvka2Q6xXi+9xLrMPu/rsAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:43:57.810400Z","bundle_sha256":"a77fd48f470004b98c8a6341339d623efdff95d90e39f58e8c20cb33b2caec25"}}