{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:W3FAKIWMSGMKK4KO2W4OJUNHMF","short_pith_number":"pith:W3FAKIWM","canonical_record":{"source":{"id":"2401.00418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-12-31T07:47:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"33343c6d4eaa1155b01e0b120ff45d35e24435b0c763b14933d1619a986f2086","abstract_canon_sha256":"8fe897b7f739dd2f1a2f421d6395951293e0bdf2c7b2738e3308764a26b9acfa"},"schema_version":"1.0"},"canonical_sha256":"b6ca0522cc9198a5714ed5b8e4d1a76148f825cb071e97b5bc03f07a0bc539d8","source":{"kind":"arxiv","id":"2401.00418","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.00418","created_at":"2026-07-05T07:29:18Z"},{"alias_kind":"arxiv_version","alias_value":"2401.00418v1","created_at":"2026-07-05T07:29:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.00418","created_at":"2026-07-05T07:29:18Z"},{"alias_kind":"pith_short_12","alias_value":"W3FAKIWMSGMK","created_at":"2026-07-05T07:29:18Z"},{"alias_kind":"pith_short_16","alias_value":"W3FAKIWMSGMKK4KO","created_at":"2026-07-05T07:29:18Z"},{"alias_kind":"pith_short_8","alias_value":"W3FAKIWM","created_at":"2026-07-05T07:29:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:W3FAKIWMSGMKK4KO2W4OJUNHMF","target":"record","payload":{"canonical_record":{"source":{"id":"2401.00418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-12-31T07:47:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"33343c6d4eaa1155b01e0b120ff45d35e24435b0c763b14933d1619a986f2086","abstract_canon_sha256":"8fe897b7f739dd2f1a2f421d6395951293e0bdf2c7b2738e3308764a26b9acfa"},"schema_version":"1.0"},"canonical_sha256":"b6ca0522cc9198a5714ed5b8e4d1a76148f825cb071e97b5bc03f07a0bc539d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:29:18.195043Z","signature_b64":"fI6zEDpbP4Tsd62kyr9NNp65m876LGnZboC8o2cz+FJ1MvoVWJu1SjLojDQ+SXtDUAa3agM46/j1q9nolt6zBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6ca0522cc9198a5714ed5b8e4d1a76148f825cb071e97b5bc03f07a0bc539d8","last_reissued_at":"2026-07-05T07:29:18.194469Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:29:18.194469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.00418","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-05T07:29:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"43/GWkf4EN1EaZ43N/j5gOOUPJBDCd5wkRg7h6M7VeROyRv2/Uld1vh0KtKeXVYhHoEwMxjVPIlFSzYFusiFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T09:47:31.399866Z"},"content_sha256":"63984e36d281e19ed19443286dbb0944cef01bb66a16b13ed94bf369d5fe37a6","schema_version":"1.0","event_id":"sha256:63984e36d281e19ed19443286dbb0944cef01bb66a16b13ed94bf369d5fe37a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:W3FAKIWMSGMKK4KO2W4OJUNHMF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on the minimum distance of locally recoverable codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Sascha Kurz","submitted_at":"2023-12-31T07:47:16Z","abstract_excerpt":"We consider locally recoverable codes (LRCs) and aim to determine the smallest possible length $n=n_q(k,d,r)$ of a linear $[n,k,d]_q$-code with locality $r$. For $k\\le 7$ we exactly determine all values of $n_2(k,d,2)$ and for $k\\le 6$ we exactly determine all values of $n_2(k,d,1)$. For the ternary field we also state a few numerical results. As a general result we prove that $n_q(k,d,r)$ equals the Griesmer bound if the minimum Hamming distance $d$ is sufficiently large and all other parameters are fixed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.00418","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/2401.00418/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-05T07:29:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9grkmoiGF58AGnFdgjlUkC9OuhQlNs2zVwnxTsrzodIAEAkRmM4oNzFrfjWy1C4QWIJ2OHbcLbpT/VNJ3QZmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T09:47:31.400756Z"},"content_sha256":"789d43a1a1908eed32a82db4bf4a5e7bb89a31843df73d5e4dba38d7872dc35e","schema_version":"1.0","event_id":"sha256:789d43a1a1908eed32a82db4bf4a5e7bb89a31843df73d5e4dba38d7872dc35e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3FAKIWMSGMKK4KO2W4OJUNHMF/bundle.json","state_url":"https://pith.science/pith/W3FAKIWMSGMKK4KO2W4OJUNHMF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3FAKIWMSGMKK4KO2W4OJUNHMF/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-11T09:47:31Z","links":{"resolver":"https://pith.science/pith/W3FAKIWMSGMKK4KO2W4OJUNHMF","bundle":"https://pith.science/pith/W3FAKIWMSGMKK4KO2W4OJUNHMF/bundle.json","state":"https://pith.science/pith/W3FAKIWMSGMKK4KO2W4OJUNHMF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3FAKIWMSGMKK4KO2W4OJUNHMF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:W3FAKIWMSGMKK4KO2W4OJUNHMF","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":"8fe897b7f739dd2f1a2f421d6395951293e0bdf2c7b2738e3308764a26b9acfa","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-12-31T07:47:16Z","title_canon_sha256":"33343c6d4eaa1155b01e0b120ff45d35e24435b0c763b14933d1619a986f2086"},"schema_version":"1.0","source":{"id":"2401.00418","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.00418","created_at":"2026-07-05T07:29:18Z"},{"alias_kind":"arxiv_version","alias_value":"2401.00418v1","created_at":"2026-07-05T07:29:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.00418","created_at":"2026-07-05T07:29:18Z"},{"alias_kind":"pith_short_12","alias_value":"W3FAKIWMSGMK","created_at":"2026-07-05T07:29:18Z"},{"alias_kind":"pith_short_16","alias_value":"W3FAKIWMSGMKK4KO","created_at":"2026-07-05T07:29:18Z"},{"alias_kind":"pith_short_8","alias_value":"W3FAKIWM","created_at":"2026-07-05T07:29:18Z"}],"graph_snapshots":[{"event_id":"sha256:789d43a1a1908eed32a82db4bf4a5e7bb89a31843df73d5e4dba38d7872dc35e","target":"graph","created_at":"2026-07-05T07:29:18Z","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/2401.00418/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider locally recoverable codes (LRCs) and aim to determine the smallest possible length $n=n_q(k,d,r)$ of a linear $[n,k,d]_q$-code with locality $r$. For $k\\le 7$ we exactly determine all values of $n_2(k,d,2)$ and for $k\\le 6$ we exactly determine all values of $n_2(k,d,1)$. For the ternary field we also state a few numerical results. As a general result we prove that $n_q(k,d,r)$ equals the Griesmer bound if the minimum Hamming distance $d$ is sufficiently large and all other parameters are fixed.","authors_text":"Sascha Kurz","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-12-31T07:47:16Z","title":"Bounds on the minimum distance of locally recoverable codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.00418","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:63984e36d281e19ed19443286dbb0944cef01bb66a16b13ed94bf369d5fe37a6","target":"record","created_at":"2026-07-05T07:29:18Z","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":"8fe897b7f739dd2f1a2f421d6395951293e0bdf2c7b2738e3308764a26b9acfa","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-12-31T07:47:16Z","title_canon_sha256":"33343c6d4eaa1155b01e0b120ff45d35e24435b0c763b14933d1619a986f2086"},"schema_version":"1.0","source":{"id":"2401.00418","kind":"arxiv","version":1}},"canonical_sha256":"b6ca0522cc9198a5714ed5b8e4d1a76148f825cb071e97b5bc03f07a0bc539d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6ca0522cc9198a5714ed5b8e4d1a76148f825cb071e97b5bc03f07a0bc539d8","first_computed_at":"2026-07-05T07:29:18.194469Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:29:18.194469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fI6zEDpbP4Tsd62kyr9NNp65m876LGnZboC8o2cz+FJ1MvoVWJu1SjLojDQ+SXtDUAa3agM46/j1q9nolt6zBg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:29:18.195043Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.00418","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63984e36d281e19ed19443286dbb0944cef01bb66a16b13ed94bf369d5fe37a6","sha256:789d43a1a1908eed32a82db4bf4a5e7bb89a31843df73d5e4dba38d7872dc35e"],"state_sha256":"34a9f7636c569197bd722fa93e0913a54db37c67087b662edcd9fd5909651d84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kx7FiV08MXo9Buv0G+r+jODleCVcPBaZXw8VKWvxAAn79wr/7vwOlnKPaqD9y183byss4c9/7oamiogqrYRRAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T09:47:31.405603Z","bundle_sha256":"6874adf06ba62abfb7001fff07b0d88e268fccc508ea052d10c10b655bcec26a"}}