{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VLETNVITYLVDYM4X5YX3W2I4U4","short_pith_number":"pith:VLETNVIT","canonical_record":{"source":{"id":"1702.05730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-19T10:02:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7ef5779dea16bb988c1c0618b4b8de8fcf0dccb63de3c468f25d30b132b57ce9","abstract_canon_sha256":"0d37c9ed392d8a8809b83e689ef9a3d4c00812943d5fddc6d279e99ef3cc3bb6"},"schema_version":"1.0"},"canonical_sha256":"aac936d513c2ea3c3397ee2fbb691ca72c6d1c1e08521b1ecf0bbbb67c66d709","source":{"kind":"arxiv","id":"1702.05730","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05730","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05730v1","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05730","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"pith_short_12","alias_value":"VLETNVITYLVD","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VLETNVITYLVDYM4X","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VLETNVIT","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VLETNVITYLVDYM4X5YX3W2I4U4","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-19T10:02:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7ef5779dea16bb988c1c0618b4b8de8fcf0dccb63de3c468f25d30b132b57ce9","abstract_canon_sha256":"0d37c9ed392d8a8809b83e689ef9a3d4c00812943d5fddc6d279e99ef3cc3bb6"},"schema_version":"1.0"},"canonical_sha256":"aac936d513c2ea3c3397ee2fbb691ca72c6d1c1e08521b1ecf0bbbb67c66d709","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:25.470651Z","signature_b64":"HH4c+4d2xdqZQnVwMuREb+VLMJgnfw15t5FKRhp2C5WAynU1/Hf77u0d4a9Q0Gl5RvVwBXnd31VDhNLHk7zNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aac936d513c2ea3c3397ee2fbb691ca72c6d1c1e08521b1ecf0bbbb67c66d709","last_reissued_at":"2026-05-18T00:50:25.469940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:25.469940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05730","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-18T00:50:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PRxKr7CkwTNB+8qQbApFAl9NpTu004+qlVCXV+5m22XxqSX6hy25fJppyR1ktESZn/0t9F15Z2Skqgwmn9bFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T18:13:01.962978Z"},"content_sha256":"ec93ce32a63e45bece51f1f034002760ccd1e1c604b6cc94a72e3e6237a628be","schema_version":"1.0","event_id":"sha256:ec93ce32a63e45bece51f1f034002760ccd1e1c604b6cc94a72e3e6237a628be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VLETNVITYLVDYM4X5YX3W2I4U4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Optimal Ternary 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, Jie Hao, Shu-Tao Xia","submitted_at":"2017-02-19T10:02:02Z","abstract_excerpt":"In an $[n,k,d]$ linear code, a code symbol is said to have locality $r$ if it can be repaired by accessing at most $r$ other code symbols. For an $(n,k,r)$ \\emph{locally repairable code} (LRC), the minimum distance satisfies the well-known Singleton-like bound $d\\le n-k-\\lceil k/r\\rceil +2$. In this paper, we study optimal ternary LRCs meeting this Singleton-like bound by employing a parity-check matrix approach. It is proved that there are only $8$ classes of possible parameters with which optimal ternary LRCs exist. Moreover, we obtain explicit constructions of optimal ternary LRCs for all t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05730","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-18T00:50:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rUMvs6xXC/sIUa1IupU6D8TTd2HqRO4zmlnf7fYqWfEhFxI+BzRXkc7Yf9cPco1jIneGP773a2b0pO+OyfvsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T18:13:01.963325Z"},"content_sha256":"f97aaf740e42b799ad0469a89e7f25b08363299b54bbcbab06f0315c4b9e8aae","schema_version":"1.0","event_id":"sha256:f97aaf740e42b799ad0469a89e7f25b08363299b54bbcbab06f0315c4b9e8aae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLETNVITYLVDYM4X5YX3W2I4U4/bundle.json","state_url":"https://pith.science/pith/VLETNVITYLVDYM4X5YX3W2I4U4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLETNVITYLVDYM4X5YX3W2I4U4/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-28T18:13:01Z","links":{"resolver":"https://pith.science/pith/VLETNVITYLVDYM4X5YX3W2I4U4","bundle":"https://pith.science/pith/VLETNVITYLVDYM4X5YX3W2I4U4/bundle.json","state":"https://pith.science/pith/VLETNVITYLVDYM4X5YX3W2I4U4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLETNVITYLVDYM4X5YX3W2I4U4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VLETNVITYLVDYM4X5YX3W2I4U4","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":"0d37c9ed392d8a8809b83e689ef9a3d4c00812943d5fddc6d279e99ef3cc3bb6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-19T10:02:02Z","title_canon_sha256":"7ef5779dea16bb988c1c0618b4b8de8fcf0dccb63de3c468f25d30b132b57ce9"},"schema_version":"1.0","source":{"id":"1702.05730","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05730","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05730v1","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05730","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"pith_short_12","alias_value":"VLETNVITYLVD","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VLETNVITYLVDYM4X","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VLETNVIT","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:f97aaf740e42b799ad0469a89e7f25b08363299b54bbcbab06f0315c4b9e8aae","target":"graph","created_at":"2026-05-18T00:50:25Z","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 an $[n,k,d]$ linear code, a code symbol is said to have locality $r$ if it can be repaired by accessing at most $r$ other code symbols. For an $(n,k,r)$ \\emph{locally repairable code} (LRC), the minimum distance satisfies the well-known Singleton-like bound $d\\le n-k-\\lceil k/r\\rceil +2$. In this paper, we study optimal ternary LRCs meeting this Singleton-like bound by employing a parity-check matrix approach. It is proved that there are only $8$ classes of possible parameters with which optimal ternary LRCs exist. Moreover, we obtain explicit constructions of optimal ternary LRCs for all t","authors_text":"Bin Chen, 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":"2017-02-19T10:02:02Z","title":"On Optimal Ternary Locally Repairable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05730","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:ec93ce32a63e45bece51f1f034002760ccd1e1c604b6cc94a72e3e6237a628be","target":"record","created_at":"2026-05-18T00:50:25Z","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":"0d37c9ed392d8a8809b83e689ef9a3d4c00812943d5fddc6d279e99ef3cc3bb6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-19T10:02:02Z","title_canon_sha256":"7ef5779dea16bb988c1c0618b4b8de8fcf0dccb63de3c468f25d30b132b57ce9"},"schema_version":"1.0","source":{"id":"1702.05730","kind":"arxiv","version":1}},"canonical_sha256":"aac936d513c2ea3c3397ee2fbb691ca72c6d1c1e08521b1ecf0bbbb67c66d709","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aac936d513c2ea3c3397ee2fbb691ca72c6d1c1e08521b1ecf0bbbb67c66d709","first_computed_at":"2026-05-18T00:50:25.469940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:25.469940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HH4c+4d2xdqZQnVwMuREb+VLMJgnfw15t5FKRhp2C5WAynU1/Hf77u0d4a9Q0Gl5RvVwBXnd31VDhNLHk7zNDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:25.470651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05730","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec93ce32a63e45bece51f1f034002760ccd1e1c604b6cc94a72e3e6237a628be","sha256:f97aaf740e42b799ad0469a89e7f25b08363299b54bbcbab06f0315c4b9e8aae"],"state_sha256":"e64e77b1c6a0e9754b5226ad07ff47d98005ccdb1838b842303fd387c6bf6c29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uAHsl2/05FERS6BNo+mGDPGRkP7T191j2BKIlgISmmkcKFBKh4n1UjuBw1vCij6n/JP+n1sMecFr9wZjjwUeCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T18:13:01.965157Z","bundle_sha256":"140ab524e9cedc2a0b5ff653192704d80b30d670f3286dbf28ed89487f7d5650"}}