{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BOOLQWAHP57XIZ2J3TG6IXZJCB","short_pith_number":"pith:BOOLQWAH","canonical_record":{"source":{"id":"1211.1932","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-08T18:28:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"47dbb6262d18b67381455d61d5af10e6cf4e8e2a6df977f2d0ab546ff33065cc","abstract_canon_sha256":"758d38e3a1e09d98aeeb177d4d8cab7b423eb81fc18cc692dc997fba754f1b0e"},"schema_version":"1.0"},"canonical_sha256":"0b9cb858077f7f746749dccde45f2910543c1c9b5d458927b69ba34e678ce126","source":{"kind":"arxiv","id":"1211.1932","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1932","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1932v3","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1932","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"BOOLQWAHP57X","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BOOLQWAHP57XIZ2J","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BOOLQWAH","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BOOLQWAHP57XIZ2J3TG6IXZJCB","target":"record","payload":{"canonical_record":{"source":{"id":"1211.1932","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-08T18:28:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"47dbb6262d18b67381455d61d5af10e6cf4e8e2a6df977f2d0ab546ff33065cc","abstract_canon_sha256":"758d38e3a1e09d98aeeb177d4d8cab7b423eb81fc18cc692dc997fba754f1b0e"},"schema_version":"1.0"},"canonical_sha256":"0b9cb858077f7f746749dccde45f2910543c1c9b5d458927b69ba34e678ce126","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:37.812086Z","signature_b64":"HD2PCNlCc0vjqGJ8ZiP+29101dJ0QE8LvTKFder6XyWw0IbDCY/Mj97IWFc3StWkHGLTi8hO7BiCkwPL04TNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b9cb858077f7f746749dccde45f2910543c1c9b5d458927b69ba34e678ce126","last_reissued_at":"2026-05-18T03:34:37.811534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:37.811534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.1932","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-18T03:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lA0QZrXIkBL1U9jjpcrJWpe5egiNW/3L8nS9nYmLcbt/q8MEjCYH185aUCclCsd6k3AyZw/ErHkEZnSwTLVkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:12:45.474951Z"},"content_sha256":"c562e53e9c8304da2acd78b4c0048d0cc6c1537dd776020c3bfe9ee29c921ac6","schema_version":"1.0","event_id":"sha256:c562e53e9c8304da2acd78b4c0048d0cc6c1537dd776020c3bfe9ee29c921ac6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BOOLQWAHP57XIZ2J3TG6IXZJCB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Codes with Local Regeneration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Govinda M. Kamath, N. Prakash, P. Vijay Kumar, V. Lalitha","submitted_at":"2012-11-08T18:28:10Z","abstract_excerpt":"Regenerating codes and codes with locality are two schemes that have recently been proposed to ensure data collection and reliability in a distributed storage network. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. In this paper, we provide several constructions for a class of vector codes with locality in which the local codes are regenerating codes, that enjoy both advantages. We derive an upper bound on the min"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1932","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-18T03:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WR6Emv4laCwTUzHHeL2kCxo65GtRJRVIXJcNyf97ZYAgVBPEJCjEtodHgAikcdwpmnukPULJPjhexA/6Y7HBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:12:45.475519Z"},"content_sha256":"eb0128b5eed07c1bb61af8cbe67b8692a32832f714ff873387df70dc8d2a6e3a","schema_version":"1.0","event_id":"sha256:eb0128b5eed07c1bb61af8cbe67b8692a32832f714ff873387df70dc8d2a6e3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BOOLQWAHP57XIZ2J3TG6IXZJCB/bundle.json","state_url":"https://pith.science/pith/BOOLQWAHP57XIZ2J3TG6IXZJCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BOOLQWAHP57XIZ2J3TG6IXZJCB/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-31T06:12:45Z","links":{"resolver":"https://pith.science/pith/BOOLQWAHP57XIZ2J3TG6IXZJCB","bundle":"https://pith.science/pith/BOOLQWAHP57XIZ2J3TG6IXZJCB/bundle.json","state":"https://pith.science/pith/BOOLQWAHP57XIZ2J3TG6IXZJCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BOOLQWAHP57XIZ2J3TG6IXZJCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BOOLQWAHP57XIZ2J3TG6IXZJCB","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":"758d38e3a1e09d98aeeb177d4d8cab7b423eb81fc18cc692dc997fba754f1b0e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-08T18:28:10Z","title_canon_sha256":"47dbb6262d18b67381455d61d5af10e6cf4e8e2a6df977f2d0ab546ff33065cc"},"schema_version":"1.0","source":{"id":"1211.1932","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1932","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1932v3","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1932","created_at":"2026-05-18T03:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"BOOLQWAHP57X","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BOOLQWAHP57XIZ2J","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BOOLQWAH","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:eb0128b5eed07c1bb61af8cbe67b8692a32832f714ff873387df70dc8d2a6e3a","target":"graph","created_at":"2026-05-18T03:34:37Z","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":"Regenerating codes and codes with locality are two schemes that have recently been proposed to ensure data collection and reliability in a distributed storage network. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. In this paper, we provide several constructions for a class of vector codes with locality in which the local codes are regenerating codes, that enjoy both advantages. We derive an upper bound on the min","authors_text":"Govinda M. Kamath, N. Prakash, P. Vijay Kumar, V. Lalitha","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-08T18:28:10Z","title":"Codes with Local Regeneration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1932","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:c562e53e9c8304da2acd78b4c0048d0cc6c1537dd776020c3bfe9ee29c921ac6","target":"record","created_at":"2026-05-18T03:34:37Z","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":"758d38e3a1e09d98aeeb177d4d8cab7b423eb81fc18cc692dc997fba754f1b0e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-08T18:28:10Z","title_canon_sha256":"47dbb6262d18b67381455d61d5af10e6cf4e8e2a6df977f2d0ab546ff33065cc"},"schema_version":"1.0","source":{"id":"1211.1932","kind":"arxiv","version":3}},"canonical_sha256":"0b9cb858077f7f746749dccde45f2910543c1c9b5d458927b69ba34e678ce126","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b9cb858077f7f746749dccde45f2910543c1c9b5d458927b69ba34e678ce126","first_computed_at":"2026-05-18T03:34:37.811534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:37.811534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HD2PCNlCc0vjqGJ8ZiP+29101dJ0QE8LvTKFder6XyWw0IbDCY/Mj97IWFc3StWkHGLTi8hO7BiCkwPL04TNBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:37.812086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1932","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c562e53e9c8304da2acd78b4c0048d0cc6c1537dd776020c3bfe9ee29c921ac6","sha256:eb0128b5eed07c1bb61af8cbe67b8692a32832f714ff873387df70dc8d2a6e3a"],"state_sha256":"2d391fdd4380cf0cb48b7c12023ba64139cc9a349539656871cb08c558f37627"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K73DOvVgAKT2bnY8x5Mu/EgFxQ5sfO1r00goT2qObOWg3Le79EH80KRz8T9F/7g71SkR/f0D+qiODz629fG3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:12:45.477695Z","bundle_sha256":"05d8e623b6124b0108aa1b96d1e194bcef41df3faa6e47092a4cef71f6cdb731"}}