{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GKQY4UQ6SUCA3G4EYEMFWLOAQA","short_pith_number":"pith:GKQY4UQ6","canonical_record":{"source":{"id":"1609.01136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-05T13:03:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2e032fdfb3330dd9180c3ddbda48f8728c7e1836099ab42102c0796729cc2f64","abstract_canon_sha256":"f7d863ac20acec0ecac94750199c47c2d4df0f553ef4e332f4bcd5cf171cabd8"},"schema_version":"1.0"},"canonical_sha256":"32a18e521e95040d9b84c1185b2dc08036f16bae6d0a0783b1368d6e45180590","source":{"kind":"arxiv","id":"1609.01136","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01136","created_at":"2026-05-18T01:06:18Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01136v1","created_at":"2026-05-18T01:06:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01136","created_at":"2026-05-18T01:06:18Z"},{"alias_kind":"pith_short_12","alias_value":"GKQY4UQ6SUCA","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GKQY4UQ6SUCA3G4E","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GKQY4UQ6","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GKQY4UQ6SUCA3G4EYEMFWLOAQA","target":"record","payload":{"canonical_record":{"source":{"id":"1609.01136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-05T13:03:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2e032fdfb3330dd9180c3ddbda48f8728c7e1836099ab42102c0796729cc2f64","abstract_canon_sha256":"f7d863ac20acec0ecac94750199c47c2d4df0f553ef4e332f4bcd5cf171cabd8"},"schema_version":"1.0"},"canonical_sha256":"32a18e521e95040d9b84c1185b2dc08036f16bae6d0a0783b1368d6e45180590","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:18.954552Z","signature_b64":"evqfk2pU0bF6n7dq8GqBEoRytKPelV6ASs4tkCrKYt/bZ+J7Yuih8TLGGBI0AG1C4kNNcoj8bjIpPVuQ+g6CBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32a18e521e95040d9b84c1185b2dc08036f16bae6d0a0783b1368d6e45180590","last_reissued_at":"2026-05-18T01:06:18.954005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:18.954005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.01136","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-18T01:06:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/1Q/0FxUqbpb5RInRF07US2iELqQ4wBTm9LbAWAfKeWRLtdfhU4RN8ZoMF6nGkm72p9ZUBJXIO0PRCCWRlaHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:50:52.507607Z"},"content_sha256":"6b839276c6388634ba1bd2063e7cdffc5e9c13e3c1ac305a6e7ae78e0da39608","schema_version":"1.0","event_id":"sha256:6b839276c6388634ba1bd2063e7cdffc5e9c13e3c1ac305a6e7ae78e0da39608"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GKQY4UQ6SUCA3G4EYEMFWLOAQA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructions of Optimal Cyclic $(r,\\delta)$ Locally Repairable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bin Chen, Fang-Wei Fu, Jie Hao, Shu-Tao Xia","submitted_at":"2016-09-05T13:03:07Z","abstract_excerpt":"A code is said to be a $r$-local locally repairable code (LRC) if each of its coordinates can be repaired by accessing at most $r$ other coordinates. When some of the $r$ coordinates are also erased, the $r$-local LRC can not accomplish the local repair, which leads to the concept of $(r,\\delta)$-locality. A $q$-ary $[n, k]$ linear code $\\cC$ is said to have $(r, \\delta)$-locality ($\\delta\\ge 2$) if for each coordinate $i$, there exists a punctured subcode of $\\cC$ with support containing $i$, whose length is at most $r + \\delta - 1$, and whose minimum distance is at least $\\delta$. The $(r, \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01136","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-18T01:06:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/wymhXZRym3ocz3cXOmqWcVYF4RB4jpYanMy5W+Mv1sh6q5quduLGnN/BvF5v1dZn1dwvvKzYm0tJSCb7VZkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:50:52.507946Z"},"content_sha256":"3ac979079eba5b32da79a8630102eb8b5b20449ade7d2cee6065856660a4c31b","schema_version":"1.0","event_id":"sha256:3ac979079eba5b32da79a8630102eb8b5b20449ade7d2cee6065856660a4c31b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GKQY4UQ6SUCA3G4EYEMFWLOAQA/bundle.json","state_url":"https://pith.science/pith/GKQY4UQ6SUCA3G4EYEMFWLOAQA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GKQY4UQ6SUCA3G4EYEMFWLOAQA/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-28T11:50:52Z","links":{"resolver":"https://pith.science/pith/GKQY4UQ6SUCA3G4EYEMFWLOAQA","bundle":"https://pith.science/pith/GKQY4UQ6SUCA3G4EYEMFWLOAQA/bundle.json","state":"https://pith.science/pith/GKQY4UQ6SUCA3G4EYEMFWLOAQA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GKQY4UQ6SUCA3G4EYEMFWLOAQA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GKQY4UQ6SUCA3G4EYEMFWLOAQA","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":"f7d863ac20acec0ecac94750199c47c2d4df0f553ef4e332f4bcd5cf171cabd8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-05T13:03:07Z","title_canon_sha256":"2e032fdfb3330dd9180c3ddbda48f8728c7e1836099ab42102c0796729cc2f64"},"schema_version":"1.0","source":{"id":"1609.01136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01136","created_at":"2026-05-18T01:06:18Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01136v1","created_at":"2026-05-18T01:06:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01136","created_at":"2026-05-18T01:06:18Z"},{"alias_kind":"pith_short_12","alias_value":"GKQY4UQ6SUCA","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GKQY4UQ6SUCA3G4E","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GKQY4UQ6","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:3ac979079eba5b32da79a8630102eb8b5b20449ade7d2cee6065856660a4c31b","target":"graph","created_at":"2026-05-18T01:06:18Z","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":"A code is said to be a $r$-local locally repairable code (LRC) if each of its coordinates can be repaired by accessing at most $r$ other coordinates. When some of the $r$ coordinates are also erased, the $r$-local LRC can not accomplish the local repair, which leads to the concept of $(r,\\delta)$-locality. A $q$-ary $[n, k]$ linear code $\\cC$ is said to have $(r, \\delta)$-locality ($\\delta\\ge 2$) if for each coordinate $i$, there exists a punctured subcode of $\\cC$ with support containing $i$, whose length is at most $r + \\delta - 1$, and whose minimum distance is at least $\\delta$. The $(r, \\","authors_text":"Bin Chen, Fang-Wei Fu, Jie Hao, Shu-Tao Xia","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-05T13:03:07Z","title":"Constructions of Optimal Cyclic $(r,\\delta)$ Locally Repairable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01136","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:6b839276c6388634ba1bd2063e7cdffc5e9c13e3c1ac305a6e7ae78e0da39608","target":"record","created_at":"2026-05-18T01:06:18Z","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":"f7d863ac20acec0ecac94750199c47c2d4df0f553ef4e332f4bcd5cf171cabd8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-05T13:03:07Z","title_canon_sha256":"2e032fdfb3330dd9180c3ddbda48f8728c7e1836099ab42102c0796729cc2f64"},"schema_version":"1.0","source":{"id":"1609.01136","kind":"arxiv","version":1}},"canonical_sha256":"32a18e521e95040d9b84c1185b2dc08036f16bae6d0a0783b1368d6e45180590","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32a18e521e95040d9b84c1185b2dc08036f16bae6d0a0783b1368d6e45180590","first_computed_at":"2026-05-18T01:06:18.954005Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:18.954005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"evqfk2pU0bF6n7dq8GqBEoRytKPelV6ASs4tkCrKYt/bZ+J7Yuih8TLGGBI0AG1C4kNNcoj8bjIpPVuQ+g6CBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:18.954552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.01136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b839276c6388634ba1bd2063e7cdffc5e9c13e3c1ac305a6e7ae78e0da39608","sha256:3ac979079eba5b32da79a8630102eb8b5b20449ade7d2cee6065856660a4c31b"],"state_sha256":"15353c71b924d4a1f53f24ffd3819d0ff4209a08482f71dac033ab18b0bf9e1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lE0r0jvgaAsacE1mFun82/Ne28oHEkHtdsXIFzpTBRaxPAOWdhrj/sN0aVJ1bMfh8KksBll09H1I0zRNr8rTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T11:50:52.509878Z","bundle_sha256":"470606bbac156554c6bd77983084f3b2f5a8b69ac6bb1414c5b3ce93fdb36438"}}