{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:K564YOGBGLQUY4IS5JSOTHTGAD","short_pith_number":"pith:K564YOGB","canonical_record":{"source":{"id":"2207.05417","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-07-12T09:29:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8248a054ad1e672f143682b68548310289e2be755e4eda28d24a4c140d080cb6","abstract_canon_sha256":"c13b14b1c5cfc9381694fb1f03a8c691a5bb9b2c54d0e1e1e037652115e59c00"},"schema_version":"1.0"},"canonical_sha256":"577dcc38c132e14c7112ea64e99e6600eb14c0a5705f914faacf2300cc864f63","source":{"kind":"arxiv","id":"2207.05417","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.05417","created_at":"2026-07-05T04:39:42Z"},{"alias_kind":"arxiv_version","alias_value":"2207.05417v1","created_at":"2026-07-05T04:39:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.05417","created_at":"2026-07-05T04:39:42Z"},{"alias_kind":"pith_short_12","alias_value":"K564YOGBGLQU","created_at":"2026-07-05T04:39:42Z"},{"alias_kind":"pith_short_16","alias_value":"K564YOGBGLQUY4IS","created_at":"2026-07-05T04:39:42Z"},{"alias_kind":"pith_short_8","alias_value":"K564YOGB","created_at":"2026-07-05T04:39:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:K564YOGBGLQUY4IS5JSOTHTGAD","target":"record","payload":{"canonical_record":{"source":{"id":"2207.05417","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-07-12T09:29:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8248a054ad1e672f143682b68548310289e2be755e4eda28d24a4c140d080cb6","abstract_canon_sha256":"c13b14b1c5cfc9381694fb1f03a8c691a5bb9b2c54d0e1e1e037652115e59c00"},"schema_version":"1.0"},"canonical_sha256":"577dcc38c132e14c7112ea64e99e6600eb14c0a5705f914faacf2300cc864f63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:39:42.347742Z","signature_b64":"b9m5etEWCyLAh6o4e1nHeVlpCJzSBCRCpor8leuZ1N5K5Kwgj2bDOmNHicF52rS/o0RdQNwn8kfFE+NcmmMrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"577dcc38c132e14c7112ea64e99e6600eb14c0a5705f914faacf2300cc864f63","last_reissued_at":"2026-07-05T04:39:42.347345Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:39:42.347345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.05417","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-07-05T04:39:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AgZygtwDR5pL0D5+SzjV3Qp7gzbzgyeGyryrRk6fcDwbmzptzr4q/8t+GSYhLni0gYKMu0qosvgSuXgnsBqMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:21:04.445171Z"},"content_sha256":"f457e58f1f5befde1495f6e0d5cf3ae5007381cf58098f088ab8263d868524e4","schema_version":"1.0","event_id":"sha256:f457e58f1f5befde1495f6e0d5cf3ae5007381cf58098f088ab8263d868524e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:K564YOGBGLQUY4IS5JSOTHTGAD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper bounds on maximum lengths of Singleton-optimal locally repairable codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Chen Yuan, Shu Liu, Tingyi Wu","submitted_at":"2022-07-12T09:29:18Z","abstract_excerpt":"A locally repairable code is called Singleton-optimal if it achieves the Singleton-type bound. Such codes are of great theoretic interest in the study of locally repairable codes. In the recent years there has been a great amount of work on this topic. One of the main problems in this topic is to determine the largest length of a q-ary Singleton-optimal locally repairable code for given locality and minimum distance. Unlike classical MDS codes, the maximum length of Singleton? Optimal locally repairable codes are very sensitive to minimum distance and locality. Thus, it is more challenging and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.05417","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.05417/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:39:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eksDh3N3Qc2DfvEmqs53zQJyx1zDmQqExPT16rxh1+8G806FPxVizpVHLcPnkS9f2Kwy0FM01Y1UWPV9OQLwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:21:04.445817Z"},"content_sha256":"10869921ab83a81e505cc49b9c9041e9d63a2fc7c548339c9a145d4172ea5cc0","schema_version":"1.0","event_id":"sha256:10869921ab83a81e505cc49b9c9041e9d63a2fc7c548339c9a145d4172ea5cc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K564YOGBGLQUY4IS5JSOTHTGAD/bundle.json","state_url":"https://pith.science/pith/K564YOGBGLQUY4IS5JSOTHTGAD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K564YOGBGLQUY4IS5JSOTHTGAD/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-08-03T18:21:04Z","links":{"resolver":"https://pith.science/pith/K564YOGBGLQUY4IS5JSOTHTGAD","bundle":"https://pith.science/pith/K564YOGBGLQUY4IS5JSOTHTGAD/bundle.json","state":"https://pith.science/pith/K564YOGBGLQUY4IS5JSOTHTGAD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K564YOGBGLQUY4IS5JSOTHTGAD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:K564YOGBGLQUY4IS5JSOTHTGAD","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":"c13b14b1c5cfc9381694fb1f03a8c691a5bb9b2c54d0e1e1e037652115e59c00","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-07-12T09:29:18Z","title_canon_sha256":"8248a054ad1e672f143682b68548310289e2be755e4eda28d24a4c140d080cb6"},"schema_version":"1.0","source":{"id":"2207.05417","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.05417","created_at":"2026-07-05T04:39:42Z"},{"alias_kind":"arxiv_version","alias_value":"2207.05417v1","created_at":"2026-07-05T04:39:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.05417","created_at":"2026-07-05T04:39:42Z"},{"alias_kind":"pith_short_12","alias_value":"K564YOGBGLQU","created_at":"2026-07-05T04:39:42Z"},{"alias_kind":"pith_short_16","alias_value":"K564YOGBGLQUY4IS","created_at":"2026-07-05T04:39:42Z"},{"alias_kind":"pith_short_8","alias_value":"K564YOGB","created_at":"2026-07-05T04:39:42Z"}],"graph_snapshots":[{"event_id":"sha256:10869921ab83a81e505cc49b9c9041e9d63a2fc7c548339c9a145d4172ea5cc0","target":"graph","created_at":"2026-07-05T04:39:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2207.05417/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A locally repairable code is called Singleton-optimal if it achieves the Singleton-type bound. Such codes are of great theoretic interest in the study of locally repairable codes. In the recent years there has been a great amount of work on this topic. One of the main problems in this topic is to determine the largest length of a q-ary Singleton-optimal locally repairable code for given locality and minimum distance. Unlike classical MDS codes, the maximum length of Singleton? Optimal locally repairable codes are very sensitive to minimum distance and locality. Thus, it is more challenging and","authors_text":"Chaoping Xing, Chen Yuan, Shu Liu, Tingyi Wu","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-07-12T09:29:18Z","title":"Upper bounds on maximum lengths of Singleton-optimal locally repairable codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.05417","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:f457e58f1f5befde1495f6e0d5cf3ae5007381cf58098f088ab8263d868524e4","target":"record","created_at":"2026-07-05T04:39:42Z","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":"c13b14b1c5cfc9381694fb1f03a8c691a5bb9b2c54d0e1e1e037652115e59c00","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-07-12T09:29:18Z","title_canon_sha256":"8248a054ad1e672f143682b68548310289e2be755e4eda28d24a4c140d080cb6"},"schema_version":"1.0","source":{"id":"2207.05417","kind":"arxiv","version":1}},"canonical_sha256":"577dcc38c132e14c7112ea64e99e6600eb14c0a5705f914faacf2300cc864f63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"577dcc38c132e14c7112ea64e99e6600eb14c0a5705f914faacf2300cc864f63","first_computed_at":"2026-07-05T04:39:42.347345Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:39:42.347345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b9m5etEWCyLAh6o4e1nHeVlpCJzSBCRCpor8leuZ1N5K5Kwgj2bDOmNHicF52rS/o0RdQNwn8kfFE+NcmmMrBg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:39:42.347742Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.05417","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f457e58f1f5befde1495f6e0d5cf3ae5007381cf58098f088ab8263d868524e4","sha256:10869921ab83a81e505cc49b9c9041e9d63a2fc7c548339c9a145d4172ea5cc0"],"state_sha256":"50dc608f5743a189cb0ecaa94145df7da79f75a0ea2863e94a6072fb7d703895"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y5WLJdVPdclDvmTAj+w6v0DnwyMKBH7UzWXKjJD9CTabjmE0PONvJ525fK1HHLIGEzM2RL+7fpCHqHPQlFDSAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:21:04.449596Z","bundle_sha256":"43efaf831f080a87de3c4d7a4c91dd02a586ce509655b006603d408967cafefb"}}