{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZTVITGMAGBW527LSBCSY2YQ64A","short_pith_number":"pith:ZTVITGMA","canonical_record":{"source":{"id":"1307.1961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-08T07:03:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"728abc889b02818ae46cc3c366975cfd2679824ec421c85b58fcbb45237ba80b","abstract_canon_sha256":"f4752da2fbffaed2346b9ce42e4a644f500453f2611143be70add7cb4fbb60b6"},"schema_version":"1.0"},"canonical_sha256":"ccea899980306ddd7d7208a58d621ee03dbe3264e62db960ee114c44fdb9f39a","source":{"kind":"arxiv","id":"1307.1961","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1961","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1961v1","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1961","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZTVITGMAGBW5","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZTVITGMAGBW527LS","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZTVITGMA","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZTVITGMAGBW527LSBCSY2YQ64A","target":"record","payload":{"canonical_record":{"source":{"id":"1307.1961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-08T07:03:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"728abc889b02818ae46cc3c366975cfd2679824ec421c85b58fcbb45237ba80b","abstract_canon_sha256":"f4752da2fbffaed2346b9ce42e4a644f500453f2611143be70add7cb4fbb60b6"},"schema_version":"1.0"},"canonical_sha256":"ccea899980306ddd7d7208a58d621ee03dbe3264e62db960ee114c44fdb9f39a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:02.970424Z","signature_b64":"kvqpZvnM831Sqd0JcMQaGB6YP9XpIgUn1kXVPF8w8najZHVDflKKX8xpHMZCCFc22+wsJlWPUbZXpKnXUtHKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccea899980306ddd7d7208a58d621ee03dbe3264e62db960ee114c44fdb9f39a","last_reissued_at":"2026-05-18T03:19:02.969957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:02.969957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.1961","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:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6rVlfxHqXdkD5yc8V/Nr2gOvQECDlWrU7wX7Ko4IVgXmXYD/KnORneOBkHzbCZBsgdkBq3VNAGYp0qXPBb1+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:52:47.340070Z"},"content_sha256":"4e03d8772813bdf9d9b1944a82cd39eb276a5bb809a67d305997c8f790ab95a6","schema_version":"1.0","event_id":"sha256:4e03d8772813bdf9d9b1944a82cd39eb276a5bb809a67d305997c8f790ab95a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZTVITGMAGBW527LSBCSY2YQ64A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Locally Repairable Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Son Hoang Dau, Tiffany Jing Li, Wentu Song","submitted_at":"2013-07-08T07:03:09Z","abstract_excerpt":"Linear erasure codes with local repairability are desirable for distributed data storage systems. An [n, k, d] code having all-symbol (r, \\delta})-locality, denoted as (r, {\\delta})a, is considered optimal if it also meets the minimum Hamming distance bound. The existing results on the existence and the construction of optimal (r, {\\delta})a codes are limited to only the special case of {\\delta} = 2, and to only two small regions within this special case, namely, m = 0 or m >= (v+{\\delta}-1) > ({\\delta}-1), where m = n mod (r+{\\delta}-1) and v = k mod r. This paper investigates the existence c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1961","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:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tFJVpzfCqrbQBpPJ1gjj3J5cbRWMwKUEgbHTsDm13xF6IHpF36RMbcm6IzBIIu6NSEzlTi4HzIHfbU99+/ibBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:52:47.340431Z"},"content_sha256":"b5de41f3ab8bb0ba587c5dce9da07ba2b037912f448b7f93cf261f64f173746e","schema_version":"1.0","event_id":"sha256:b5de41f3ab8bb0ba587c5dce9da07ba2b037912f448b7f93cf261f64f173746e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTVITGMAGBW527LSBCSY2YQ64A/bundle.json","state_url":"https://pith.science/pith/ZTVITGMAGBW527LSBCSY2YQ64A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTVITGMAGBW527LSBCSY2YQ64A/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-06-03T17:52:47Z","links":{"resolver":"https://pith.science/pith/ZTVITGMAGBW527LSBCSY2YQ64A","bundle":"https://pith.science/pith/ZTVITGMAGBW527LSBCSY2YQ64A/bundle.json","state":"https://pith.science/pith/ZTVITGMAGBW527LSBCSY2YQ64A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTVITGMAGBW527LSBCSY2YQ64A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZTVITGMAGBW527LSBCSY2YQ64A","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":"f4752da2fbffaed2346b9ce42e4a644f500453f2611143be70add7cb4fbb60b6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-08T07:03:09Z","title_canon_sha256":"728abc889b02818ae46cc3c366975cfd2679824ec421c85b58fcbb45237ba80b"},"schema_version":"1.0","source":{"id":"1307.1961","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1961","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1961v1","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1961","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZTVITGMAGBW5","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZTVITGMAGBW527LS","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZTVITGMA","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:b5de41f3ab8bb0ba587c5dce9da07ba2b037912f448b7f93cf261f64f173746e","target":"graph","created_at":"2026-05-18T03:19:02Z","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":"Linear erasure codes with local repairability are desirable for distributed data storage systems. An [n, k, d] code having all-symbol (r, \\delta})-locality, denoted as (r, {\\delta})a, is considered optimal if it also meets the minimum Hamming distance bound. The existing results on the existence and the construction of optimal (r, {\\delta})a codes are limited to only the special case of {\\delta} = 2, and to only two small regions within this special case, namely, m = 0 or m >= (v+{\\delta}-1) > ({\\delta}-1), where m = n mod (r+{\\delta}-1) and v = k mod r. This paper investigates the existence c","authors_text":"Chau Yuen, Son Hoang Dau, Tiffany Jing Li, Wentu Song","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-08T07:03:09Z","title":"Optimal Locally Repairable Linear Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1961","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:4e03d8772813bdf9d9b1944a82cd39eb276a5bb809a67d305997c8f790ab95a6","target":"record","created_at":"2026-05-18T03:19:02Z","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":"f4752da2fbffaed2346b9ce42e4a644f500453f2611143be70add7cb4fbb60b6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-08T07:03:09Z","title_canon_sha256":"728abc889b02818ae46cc3c366975cfd2679824ec421c85b58fcbb45237ba80b"},"schema_version":"1.0","source":{"id":"1307.1961","kind":"arxiv","version":1}},"canonical_sha256":"ccea899980306ddd7d7208a58d621ee03dbe3264e62db960ee114c44fdb9f39a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccea899980306ddd7d7208a58d621ee03dbe3264e62db960ee114c44fdb9f39a","first_computed_at":"2026-05-18T03:19:02.969957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:02.969957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kvqpZvnM831Sqd0JcMQaGB6YP9XpIgUn1kXVPF8w8najZHVDflKKX8xpHMZCCFc22+wsJlWPUbZXpKnXUtHKDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:02.970424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.1961","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e03d8772813bdf9d9b1944a82cd39eb276a5bb809a67d305997c8f790ab95a6","sha256:b5de41f3ab8bb0ba587c5dce9da07ba2b037912f448b7f93cf261f64f173746e"],"state_sha256":"0fe78ff8c3be7e14fa1c8b5b74f6fce51b864c95c4defce7d8952b173f15b290"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gTvGLRjW99OGf8C8sE7YgssI1gu9LCWjm+XACXHY/09hZv4azblNcJFFWvXD9vypfNSBz44J4z62sWVZtSbfBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:52:47.342411Z","bundle_sha256":"a6076801efa7ce1be3de9adb9dcb6311d5df74de2c27177c52711eaf95ad5440"}}