{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:L4XYSXZQCBBBPJHYVTNNGSXYT2","short_pith_number":"pith:L4XYSXZQ","canonical_record":{"source":{"id":"1308.3200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-14T18:25:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0de8ac75e6b64e860a7acc499c343a5cc5ce85794c0e3538d5c17836b7ca088a","abstract_canon_sha256":"ae292a50edd1cc5903e63f9f81a4c5f6f3918e77c77866feb1e6523196d39a89"},"schema_version":"1.0"},"canonical_sha256":"5f2f895f30104217a4f8acdad34af89e80b55a0cc68b40929f86617c90738c10","source":{"kind":"arxiv","id":"1308.3200","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3200","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3200v2","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3200","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"L4XYSXZQCBBB","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"L4XYSXZQCBBBPJHY","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"L4XYSXZQ","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:L4XYSXZQCBBBPJHYVTNNGSXYT2","target":"record","payload":{"canonical_record":{"source":{"id":"1308.3200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-14T18:25:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0de8ac75e6b64e860a7acc499c343a5cc5ce85794c0e3538d5c17836b7ca088a","abstract_canon_sha256":"ae292a50edd1cc5903e63f9f81a4c5f6f3918e77c77866feb1e6523196d39a89"},"schema_version":"1.0"},"canonical_sha256":"5f2f895f30104217a4f8acdad34af89e80b55a0cc68b40929f86617c90738c10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.085675Z","signature_b64":"5W/uppP1o/VQVTD95NUmbvD6L8NpHlnD9rdeSOuC9yHWw7C6KPPzjoUtnGVaPXf1QLMarYx1Lp3ujIFhj0mfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f2f895f30104217a4f8acdad34af89e80b55a0cc68b40929f86617c90738c10","last_reissued_at":"2026-05-18T00:58:42.084986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.084986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.3200","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-18T00:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4kZBJ4BFR6AuDkUDpUJfmWh36O0fsjKjzTw2gXBO5d9O/rRZxNeyH939uif3RJlnBn+PxnMFFGiuOOwWvlQLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:21:44.788986Z"},"content_sha256":"cee69614a2dc6a0f2eba92386f1631d1829e710390cc306cf0534774041cd4c0","schema_version":"1.0","event_id":"sha256:cee69614a2dc6a0f2eba92386f1631d1829e710390cc306cf0534774041cd4c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:L4XYSXZQCBBBPJHYVTNNGSXYT2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Upper Bound On the Size of Locally Recoverable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arya Mazumdar, Viveck Cadambe","submitted_at":"2013-08-14T18:25:32Z","abstract_excerpt":"In a {\\em locally recoverable} or {\\em repairable} code, any symbol of a codeword can be recovered by reading only a small (constant) number of other symbols. The notion of local recoverability is important in the area of distributed storage where a most frequent error-event is a single storage node failure (erasure). A common objective is to repair the node by downloading data from as few other storage node as possible. In this paper, we bound the minimum distance of a code in terms of its length, size and locality. Unlike previous bounds, our bound follows from a significantly simple analysi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3200","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-18T00:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKhLfjl9zQ6J9SNhsA+yqflHW1vj+uM5bBAjbgXQHbRJdCXvAzUN3pY50sX1tllNoOZp01mXENqYPNpcn5rtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:21:44.789662Z"},"content_sha256":"d3408c86712c48f2e6a03ccdb22d7e0d2ac0142eb78ba743b013aa2b16c27fc8","schema_version":"1.0","event_id":"sha256:d3408c86712c48f2e6a03ccdb22d7e0d2ac0142eb78ba743b013aa2b16c27fc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4XYSXZQCBBBPJHYVTNNGSXYT2/bundle.json","state_url":"https://pith.science/pith/L4XYSXZQCBBBPJHYVTNNGSXYT2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4XYSXZQCBBBPJHYVTNNGSXYT2/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-26T08:21:44Z","links":{"resolver":"https://pith.science/pith/L4XYSXZQCBBBPJHYVTNNGSXYT2","bundle":"https://pith.science/pith/L4XYSXZQCBBBPJHYVTNNGSXYT2/bundle.json","state":"https://pith.science/pith/L4XYSXZQCBBBPJHYVTNNGSXYT2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4XYSXZQCBBBPJHYVTNNGSXYT2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:L4XYSXZQCBBBPJHYVTNNGSXYT2","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":"ae292a50edd1cc5903e63f9f81a4c5f6f3918e77c77866feb1e6523196d39a89","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-14T18:25:32Z","title_canon_sha256":"0de8ac75e6b64e860a7acc499c343a5cc5ce85794c0e3538d5c17836b7ca088a"},"schema_version":"1.0","source":{"id":"1308.3200","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3200","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3200v2","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3200","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"L4XYSXZQCBBB","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"L4XYSXZQCBBBPJHY","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"L4XYSXZQ","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:d3408c86712c48f2e6a03ccdb22d7e0d2ac0142eb78ba743b013aa2b16c27fc8","target":"graph","created_at":"2026-05-18T00:58:42Z","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 a {\\em locally recoverable} or {\\em repairable} code, any symbol of a codeword can be recovered by reading only a small (constant) number of other symbols. The notion of local recoverability is important in the area of distributed storage where a most frequent error-event is a single storage node failure (erasure). A common objective is to repair the node by downloading data from as few other storage node as possible. In this paper, we bound the minimum distance of a code in terms of its length, size and locality. Unlike previous bounds, our bound follows from a significantly simple analysi","authors_text":"Arya Mazumdar, Viveck Cadambe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-14T18:25:32Z","title":"An Upper Bound On the Size of Locally Recoverable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3200","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:cee69614a2dc6a0f2eba92386f1631d1829e710390cc306cf0534774041cd4c0","target":"record","created_at":"2026-05-18T00:58:42Z","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":"ae292a50edd1cc5903e63f9f81a4c5f6f3918e77c77866feb1e6523196d39a89","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-14T18:25:32Z","title_canon_sha256":"0de8ac75e6b64e860a7acc499c343a5cc5ce85794c0e3538d5c17836b7ca088a"},"schema_version":"1.0","source":{"id":"1308.3200","kind":"arxiv","version":2}},"canonical_sha256":"5f2f895f30104217a4f8acdad34af89e80b55a0cc68b40929f86617c90738c10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f2f895f30104217a4f8acdad34af89e80b55a0cc68b40929f86617c90738c10","first_computed_at":"2026-05-18T00:58:42.084986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:42.084986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5W/uppP1o/VQVTD95NUmbvD6L8NpHlnD9rdeSOuC9yHWw7C6KPPzjoUtnGVaPXf1QLMarYx1Lp3ujIFhj0mfBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:42.085675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3200","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cee69614a2dc6a0f2eba92386f1631d1829e710390cc306cf0534774041cd4c0","sha256:d3408c86712c48f2e6a03ccdb22d7e0d2ac0142eb78ba743b013aa2b16c27fc8"],"state_sha256":"052c1cf791db1181e0801742c51bcdd5ab8d121145c94a12ae1e3e7ce9685081"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LSPRNML0GmMP4lG8xCdL1FVq9fF1C9+BLyBm7Ymi6AILUTX1x5k5kzhsWFuGa7ItdnTGTd9DVtAoS1jS5jiGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:21:44.793105Z","bundle_sha256":"bb9abe04cdc382617fa01d0670fd838ec9aa63e8ce42252cb8d41f4aa70c2f8c"}}