{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7GJI5OXF5CHLG36GJSU6DLXG7G","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":"dd651c0dc4f04fd604995efdbb7c721663a1bd46a90bc80b799b64815d1b2a8b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-20T03:33:05Z","title_canon_sha256":"1b0a9235627d94c78c20256e4e01d0589f14665d12c141a2dc61b0139c09fc7a"},"schema_version":"1.0","source":{"id":"1702.05848","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05848","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05848v1","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05848","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"pith_short_12","alias_value":"7GJI5OXF5CHL","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7GJI5OXF5CHLG36G","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7GJI5OXF","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:577a272edbc948a5f741edcef03923fc43e1bc19f696785def8fe0e51eb245f3","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":"An $(n,k,r)$ \\emph{locally repairable code} (LRC) is an $[n,k,d]$ linear code where every code symbol can be repaired from at most $r$ other code symbols. An LRC is said to be optimal if the minimum distance attains the Singleton-like bound $d \\le n-k-\\lceil k/r \\rceil +2$. The \\emph{generalized Hamming weights} (GHWs) of linear codes are fundamental parameters which have many useful applications. Generally it is difficult to determine the GHWs of linear codes. In this paper, we study the GHWs of LRCs. Firstly, we obtain a generalized Singleton-like bound on the $i$-th $(1\\le i \\le k)$ GHWs of","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":"2017-02-20T03:33:05Z","title":"On the Weight Hierarchy of Locally Repairable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05848","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:2f7bdbd3e12fd7711ffcda342d576609f8dd730c95cf10e9c5ea3b5796bbd7d2","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":"dd651c0dc4f04fd604995efdbb7c721663a1bd46a90bc80b799b64815d1b2a8b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-20T03:33:05Z","title_canon_sha256":"1b0a9235627d94c78c20256e4e01d0589f14665d12c141a2dc61b0139c09fc7a"},"schema_version":"1.0","source":{"id":"1702.05848","kind":"arxiv","version":1}},"canonical_sha256":"f9928ebae5e88eb36fc64ca9e1aee6f9a1d3208f60f60c2a0e67caf354033fc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9928ebae5e88eb36fc64ca9e1aee6f9a1d3208f60f60c2a0e67caf354033fc5","first_computed_at":"2026-05-18T00:50:25.141785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:25.141785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KNz/uYxdb663wyqI0MCmaaEyFPgz6yBJh+hsnGpSDb8dWRIRhhcftdMiobPmcceL8M36iKwznhxlB8+3ciX8DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:25.142512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05848","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f7bdbd3e12fd7711ffcda342d576609f8dd730c95cf10e9c5ea3b5796bbd7d2","sha256:577a272edbc948a5f741edcef03923fc43e1bc19f696785def8fe0e51eb245f3"],"state_sha256":"953aa8401a1d88ee659a947cdd8ba7004b6868047352c08fcd4810ce34681989"}