{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RTUVMHWXPTJVEQCUAAUON4ZYE4","short_pith_number":"pith:RTUVMHWX","canonical_record":{"source":{"id":"1805.12345","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-31T07:04:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b9c168803f59da618ed440b6b7c96f8ffbcaa7075e5f1fa041a715505d6c6dbf","abstract_canon_sha256":"0b7bc666672cc1af59809ea0e11c30d28228a39da24fe3812b4b27f7a5f40724"},"schema_version":"1.0"},"canonical_sha256":"8ce9561ed77cd35240540028e6f33827020ce7cb5309cf32197012f33d453e7f","source":{"kind":"arxiv","id":"1805.12345","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.12345","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1805.12345v2","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12345","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"RTUVMHWXPTJV","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RTUVMHWXPTJVEQCU","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RTUVMHWX","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RTUVMHWXPTJVEQCUAAUON4ZYE4","target":"record","payload":{"canonical_record":{"source":{"id":"1805.12345","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-31T07:04:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b9c168803f59da618ed440b6b7c96f8ffbcaa7075e5f1fa041a715505d6c6dbf","abstract_canon_sha256":"0b7bc666672cc1af59809ea0e11c30d28228a39da24fe3812b4b27f7a5f40724"},"schema_version":"1.0"},"canonical_sha256":"8ce9561ed77cd35240540028e6f33827020ce7cb5309cf32197012f33d453e7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:23.041824Z","signature_b64":"0QS1NZMiAqzo1tCV8sisXvqv1K7I3eMCnAvmIuy2QdAAL0wVx9VjvszBWzFLLoI9oZAzgu4a+XywiF7ePcoVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ce9561ed77cd35240540028e6f33827020ce7cb5309cf32197012f33d453e7f","last_reissued_at":"2026-05-18T00:04:23.041112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:23.041112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.12345","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:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0DpyfAsR6/wP7GEZlytfBFoWmZW0Z7988YLo1I8PXa3X65meWeSauoO2iNb8oEznnl7peQzMhi+Q4gZQ4/JyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:05:34.983684Z"},"content_sha256":"701bd401861facdba53dc0698e8492b5dec6a8f8abe3675ae906936898a09199","schema_version":"1.0","event_id":"sha256:701bd401861facdba53dc0698e8492b5dec6a8f8abe3675ae906936898a09199"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RTUVMHWXPTJVEQCUAAUON4ZYE4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal cyclic $(r,\\delta)$ locally repairable codes with unbounded length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Weijun Fang","submitted_at":"2018-05-31T07:04:12Z","abstract_excerpt":"Locally repairable codes with locality $r$ ($r$-LRCs for short) were introduced by Gopalan et al. \\cite{1} to recover a failed node of the code from at most other $r$ available nodes. And then $(r,\\delta)$ locally repairable codes ($(r,\\delta)$-LRCs for short) were produced by Prakash et al. \\cite{2} for tolerating multiple failed nodes. An $r$-LRC can be viewed as an $(r,2)$-LRC. An $(r,\\delta)$-LRC is called optimal if it achieves the Singleton-type bound. It has been a great challenge to construct $q$-ary optimal $(r,\\delta)$-LRCs with length much larger than $q$. Surprisingly, Luo et al. \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12345","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:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Jj8kh8B3JiBw2fgkqPvSv7to0vibStrNgKfvWP07Z/E43/8l5mJGSxQKb9XKca/NgQws/hW7hRx0mxwKs2tBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:05:34.984371Z"},"content_sha256":"cae2ef18050d32bc8972aeeaede3e4531d99ce6f5ac81c807529a8b8f273f489","schema_version":"1.0","event_id":"sha256:cae2ef18050d32bc8972aeeaede3e4531d99ce6f5ac81c807529a8b8f273f489"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTUVMHWXPTJVEQCUAAUON4ZYE4/bundle.json","state_url":"https://pith.science/pith/RTUVMHWXPTJVEQCUAAUON4ZYE4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTUVMHWXPTJVEQCUAAUON4ZYE4/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-27T13:05:34Z","links":{"resolver":"https://pith.science/pith/RTUVMHWXPTJVEQCUAAUON4ZYE4","bundle":"https://pith.science/pith/RTUVMHWXPTJVEQCUAAUON4ZYE4/bundle.json","state":"https://pith.science/pith/RTUVMHWXPTJVEQCUAAUON4ZYE4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTUVMHWXPTJVEQCUAAUON4ZYE4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RTUVMHWXPTJVEQCUAAUON4ZYE4","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":"0b7bc666672cc1af59809ea0e11c30d28228a39da24fe3812b4b27f7a5f40724","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-31T07:04:12Z","title_canon_sha256":"b9c168803f59da618ed440b6b7c96f8ffbcaa7075e5f1fa041a715505d6c6dbf"},"schema_version":"1.0","source":{"id":"1805.12345","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.12345","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1805.12345v2","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12345","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"RTUVMHWXPTJV","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RTUVMHWXPTJVEQCU","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RTUVMHWX","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:cae2ef18050d32bc8972aeeaede3e4531d99ce6f5ac81c807529a8b8f273f489","target":"graph","created_at":"2026-05-18T00:04:23Z","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":"Locally repairable codes with locality $r$ ($r$-LRCs for short) were introduced by Gopalan et al. \\cite{1} to recover a failed node of the code from at most other $r$ available nodes. And then $(r,\\delta)$ locally repairable codes ($(r,\\delta)$-LRCs for short) were produced by Prakash et al. \\cite{2} for tolerating multiple failed nodes. An $r$-LRC can be viewed as an $(r,2)$-LRC. An $(r,\\delta)$-LRC is called optimal if it achieves the Singleton-type bound. It has been a great challenge to construct $q$-ary optimal $(r,\\delta)$-LRCs with length much larger than $q$. Surprisingly, Luo et al. \\","authors_text":"Fang-Wei Fu, Weijun Fang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-31T07:04:12Z","title":"Optimal cyclic $(r,\\delta)$ locally repairable codes with unbounded length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12345","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:701bd401861facdba53dc0698e8492b5dec6a8f8abe3675ae906936898a09199","target":"record","created_at":"2026-05-18T00:04:23Z","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":"0b7bc666672cc1af59809ea0e11c30d28228a39da24fe3812b4b27f7a5f40724","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-31T07:04:12Z","title_canon_sha256":"b9c168803f59da618ed440b6b7c96f8ffbcaa7075e5f1fa041a715505d6c6dbf"},"schema_version":"1.0","source":{"id":"1805.12345","kind":"arxiv","version":2}},"canonical_sha256":"8ce9561ed77cd35240540028e6f33827020ce7cb5309cf32197012f33d453e7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ce9561ed77cd35240540028e6f33827020ce7cb5309cf32197012f33d453e7f","first_computed_at":"2026-05-18T00:04:23.041112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:23.041112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0QS1NZMiAqzo1tCV8sisXvqv1K7I3eMCnAvmIuy2QdAAL0wVx9VjvszBWzFLLoI9oZAzgu4a+XywiF7ePcoVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:23.041824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.12345","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:701bd401861facdba53dc0698e8492b5dec6a8f8abe3675ae906936898a09199","sha256:cae2ef18050d32bc8972aeeaede3e4531d99ce6f5ac81c807529a8b8f273f489"],"state_sha256":"c7597ca47cdccd1e400af5a9dc47f8e723671978721597e960bafee224ee5941"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wFOCwpmCnaxgwCWQUJrXsk5/8RaV9qaTIR6EESQL53iSImclzMSwx12ZzJW/sGFuHNZztaKnOzu/iWx+S1i5DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:05:34.988016Z","bundle_sha256":"ef5e5947c9aac9ae5004a6bbb7a3630f687e2534f1b5659b8762af4252b9d4e9"}}