{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O5TFEECIDAKND453YJMO5CCEKN","short_pith_number":"pith:O5TFEECI","canonical_record":{"source":{"id":"1811.09142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-22T12:46:49Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"9aa6287e19efeda3d448b1350a235e9844aa185f6a55b11a774b9f7e36875635","abstract_canon_sha256":"3d39d3fd291c5be5c2ddc5c51dc57efa94fe75b9f2d8cb8b025be4cb7e76b37e"},"schema_version":"1.0"},"canonical_sha256":"77665210481814d1f3bbc258ee88445367ecd4ceb4a01f8003fd00228001d7ad","source":{"kind":"arxiv","id":"1811.09142","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09142","created_at":"2026-05-17T23:59:57Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09142v2","created_at":"2026-05-17T23:59:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09142","created_at":"2026-05-17T23:59:57Z"},{"alias_kind":"pith_short_12","alias_value":"O5TFEECIDAKN","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O5TFEECIDAKND453","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O5TFEECI","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O5TFEECIDAKND453YJMO5CCEKN","target":"record","payload":{"canonical_record":{"source":{"id":"1811.09142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-22T12:46:49Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"9aa6287e19efeda3d448b1350a235e9844aa185f6a55b11a774b9f7e36875635","abstract_canon_sha256":"3d39d3fd291c5be5c2ddc5c51dc57efa94fe75b9f2d8cb8b025be4cb7e76b37e"},"schema_version":"1.0"},"canonical_sha256":"77665210481814d1f3bbc258ee88445367ecd4ceb4a01f8003fd00228001d7ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:57.370331Z","signature_b64":"899z1++jRhTUmZToI0YzEKlFlsaQwElYp5QzhUj+ZLOflnAR9D3qRPgNi5GmOW3ZrAV+Pq+bTUe94gweVtSZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77665210481814d1f3bbc258ee88445367ecd4ceb4a01f8003fd00228001d7ad","last_reissued_at":"2026-05-17T23:59:57.369640Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:57.369640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.09142","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-17T23:59:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OPnjcSyOPNo65SrKENntEwJ/Q2u0DMYAr6R6Wzpb7WARmx1VKhqOpgVTCkqq0IvrZmr84/BbDdQ7Hebmr77dAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T13:36:10.568739Z"},"content_sha256":"0ff2e7e20394dc534d02c9687e6c5b6fba3984a54ccf9ef9d1f578de3662cc57","schema_version":"1.0","event_id":"sha256:0ff2e7e20394dc534d02c9687e6c5b6fba3984a54ccf9ef9d1f578de3662cc57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O5TFEECIDAKND453YJMO5CCEKN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction of optimal locally recoverable codes and connection with hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Chen Yuan","submitted_at":"2018-11-22T12:46:49Z","abstract_excerpt":"Recently, it was discovered by several authors that a $q$-ary optimal locally recoverable code, i.e., a locally recoverable code archiving the Singleton-type bound, can have length much bigger than $q+1$. This is quite different from the classical $q$-ary MDS codes where it is conjectured that the code length is upper bounded by $q+1$ (or $q+2$ for some special case). This discovery inspired some recent studies on length of an optimal locally recoverable code. It was shown in \\cite{LXY} that a $q$-ary optimal locally recoverable code is unbounded for $d=3,4$. Soon after, it was proved that a $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09142","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-17T23:59:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yd2hZtzMCfBGU08zVM7X73OxQzYLYCbMBr3g4Bz8aDZv/TXfOZMK1/34df3jXtlSqkSE2d/9gvIcNil6odISCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T13:36:10.569453Z"},"content_sha256":"2119049b7a86679a3e80cb8068893e6f2f3cf45bb0c18e5f55f4fd818ccdbea0","schema_version":"1.0","event_id":"sha256:2119049b7a86679a3e80cb8068893e6f2f3cf45bb0c18e5f55f4fd818ccdbea0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5TFEECIDAKND453YJMO5CCEKN/bundle.json","state_url":"https://pith.science/pith/O5TFEECIDAKND453YJMO5CCEKN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5TFEECIDAKND453YJMO5CCEKN/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-07T13:36:10Z","links":{"resolver":"https://pith.science/pith/O5TFEECIDAKND453YJMO5CCEKN","bundle":"https://pith.science/pith/O5TFEECIDAKND453YJMO5CCEKN/bundle.json","state":"https://pith.science/pith/O5TFEECIDAKND453YJMO5CCEKN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5TFEECIDAKND453YJMO5CCEKN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O5TFEECIDAKND453YJMO5CCEKN","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":"3d39d3fd291c5be5c2ddc5c51dc57efa94fe75b9f2d8cb8b025be4cb7e76b37e","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-22T12:46:49Z","title_canon_sha256":"9aa6287e19efeda3d448b1350a235e9844aa185f6a55b11a774b9f7e36875635"},"schema_version":"1.0","source":{"id":"1811.09142","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09142","created_at":"2026-05-17T23:59:57Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09142v2","created_at":"2026-05-17T23:59:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09142","created_at":"2026-05-17T23:59:57Z"},{"alias_kind":"pith_short_12","alias_value":"O5TFEECIDAKN","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O5TFEECIDAKND453","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O5TFEECI","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:2119049b7a86679a3e80cb8068893e6f2f3cf45bb0c18e5f55f4fd818ccdbea0","target":"graph","created_at":"2026-05-17T23:59:57Z","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":"Recently, it was discovered by several authors that a $q$-ary optimal locally recoverable code, i.e., a locally recoverable code archiving the Singleton-type bound, can have length much bigger than $q+1$. This is quite different from the classical $q$-ary MDS codes where it is conjectured that the code length is upper bounded by $q+1$ (or $q+2$ for some special case). This discovery inspired some recent studies on length of an optimal locally recoverable code. It was shown in \\cite{LXY} that a $q$-ary optimal locally recoverable code is unbounded for $d=3,4$. Soon after, it was proved that a $","authors_text":"Chaoping Xing, Chen Yuan","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-22T12:46:49Z","title":"Construction of optimal locally recoverable codes and connection with hypergraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09142","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:0ff2e7e20394dc534d02c9687e6c5b6fba3984a54ccf9ef9d1f578de3662cc57","target":"record","created_at":"2026-05-17T23:59:57Z","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":"3d39d3fd291c5be5c2ddc5c51dc57efa94fe75b9f2d8cb8b025be4cb7e76b37e","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-22T12:46:49Z","title_canon_sha256":"9aa6287e19efeda3d448b1350a235e9844aa185f6a55b11a774b9f7e36875635"},"schema_version":"1.0","source":{"id":"1811.09142","kind":"arxiv","version":2}},"canonical_sha256":"77665210481814d1f3bbc258ee88445367ecd4ceb4a01f8003fd00228001d7ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77665210481814d1f3bbc258ee88445367ecd4ceb4a01f8003fd00228001d7ad","first_computed_at":"2026-05-17T23:59:57.369640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:57.369640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"899z1++jRhTUmZToI0YzEKlFlsaQwElYp5QzhUj+ZLOflnAR9D3qRPgNi5GmOW3ZrAV+Pq+bTUe94gweVtSZCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:57.370331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.09142","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ff2e7e20394dc534d02c9687e6c5b6fba3984a54ccf9ef9d1f578de3662cc57","sha256:2119049b7a86679a3e80cb8068893e6f2f3cf45bb0c18e5f55f4fd818ccdbea0"],"state_sha256":"35764f3b744545eb60c3e27ca2e2ab7be05a73019e9ed81a85734b6c712ac3c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"32kTR2grA76zsGyOHS4r3r8D0N2PPJuaxBm5gLZDJRTnwAGBVaSZNYU444PnURMuJ4HsLbEElKBL49omxQUwAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T13:36:10.573214Z","bundle_sha256":"b2de62ff44d7d2d57a29b8d0b96d35a52e0abff39e005ff55a937619de78efd2"}}