{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MVI3AGBDJDSIVATSQDZX37NKCL","short_pith_number":"pith:MVI3AGBD","canonical_record":{"source":{"id":"1406.4277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-17T08:41:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f5085f96a1b02b7501cada347229b9c2829065824cab68ecefb1dc0750929027","abstract_canon_sha256":"3f5120233a36c521ebb469e6770102d685aef3a7f6a00b804987213917e9be33"},"schema_version":"1.0"},"canonical_sha256":"6551b0182348e48a827280f37dfdaa12e1d54593dd46a1d370a4dc58bbf01c3a","source":{"kind":"arxiv","id":"1406.4277","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4277","created_at":"2026-05-18T02:33:25Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4277v1","created_at":"2026-05-18T02:33:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4277","created_at":"2026-05-18T02:33:25Z"},{"alias_kind":"pith_short_12","alias_value":"MVI3AGBDJDSI","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MVI3AGBDJDSIVATS","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MVI3AGBD","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MVI3AGBDJDSIVATSQDZX37NKCL","target":"record","payload":{"canonical_record":{"source":{"id":"1406.4277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-17T08:41:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f5085f96a1b02b7501cada347229b9c2829065824cab68ecefb1dc0750929027","abstract_canon_sha256":"3f5120233a36c521ebb469e6770102d685aef3a7f6a00b804987213917e9be33"},"schema_version":"1.0"},"canonical_sha256":"6551b0182348e48a827280f37dfdaa12e1d54593dd46a1d370a4dc58bbf01c3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:25.193170Z","signature_b64":"NDtF+og9V8iY6J71NIpvpDX0cmnLefu1Ewq8jk1q5PHyE7aKhaD7EY1aQxPv6KvRlR9w1aaDGzXpAmXD1qadAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6551b0182348e48a827280f37dfdaa12e1d54593dd46a1d370a4dc58bbf01c3a","last_reissued_at":"2026-05-18T02:33:25.192678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:25.192678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.4277","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-18T02:33:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"go8xJpCQaLYVT8s3FTcUWCyI6F5DieKGSE3YY5/QstfLX5/n/WjZ+uzXgpMLkpNiHqyByXd7D0GWXKtWJUc9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:20:04.818246Z"},"content_sha256":"0054bebd1ed01b9cb5f228c82e83964bf25d7c22e6eeccdd0ab3cc08537db0ae","schema_version":"1.0","event_id":"sha256:0054bebd1ed01b9cb5f228c82e83964bf25d7c22e6eeccdd0ab3cc08537db0ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MVI3AGBDJDSIVATSQDZX37NKCL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructions of Optimal and Almost Optimal Locally Repairable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, Thomas Westerb\\\"ack, Toni Ernvall","submitted_at":"2014-06-17T08:41:16Z","abstract_excerpt":"Constructions of optimal locally repairable codes (LRCs) in the case of $(r+1) \\nmid n$ and over small finite fields were stated as open problems for LRCs in [I. Tamo \\emph{et al.}, \"Optimal locally repairable codes and connections to matroid theory\", \\emph{2013 IEEE ISIT}]. In this paper, these problems are studied by constructing almost optimal linear LRCs, which are proven to be optimal for certain parameters, including cases for which $(r+1) \\nmid n$. More precisely, linear codes for given length, dimension, and all-symbol locality are constructed with almost optimal minimum distance. `Alm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4277","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-18T02:33:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fYfEdlaHFxXuB8rWvVFO9Et1ba4vogRZVLIBSL+o7aETyoS4OiWOjE+gVdJurcZJmbFtZytyhT6ya2DhIfYIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:20:04.818799Z"},"content_sha256":"a10222dec7d3e8ce6577d8d07bcd9ff5f58b1241ab5bcf7b1a47eb11389f24e4","schema_version":"1.0","event_id":"sha256:a10222dec7d3e8ce6577d8d07bcd9ff5f58b1241ab5bcf7b1a47eb11389f24e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVI3AGBDJDSIVATSQDZX37NKCL/bundle.json","state_url":"https://pith.science/pith/MVI3AGBDJDSIVATSQDZX37NKCL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVI3AGBDJDSIVATSQDZX37NKCL/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-02T15:20:04Z","links":{"resolver":"https://pith.science/pith/MVI3AGBDJDSIVATSQDZX37NKCL","bundle":"https://pith.science/pith/MVI3AGBDJDSIVATSQDZX37NKCL/bundle.json","state":"https://pith.science/pith/MVI3AGBDJDSIVATSQDZX37NKCL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVI3AGBDJDSIVATSQDZX37NKCL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MVI3AGBDJDSIVATSQDZX37NKCL","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":"3f5120233a36c521ebb469e6770102d685aef3a7f6a00b804987213917e9be33","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-17T08:41:16Z","title_canon_sha256":"f5085f96a1b02b7501cada347229b9c2829065824cab68ecefb1dc0750929027"},"schema_version":"1.0","source":{"id":"1406.4277","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4277","created_at":"2026-05-18T02:33:25Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4277v1","created_at":"2026-05-18T02:33:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4277","created_at":"2026-05-18T02:33:25Z"},{"alias_kind":"pith_short_12","alias_value":"MVI3AGBDJDSI","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MVI3AGBDJDSIVATS","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MVI3AGBD","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:a10222dec7d3e8ce6577d8d07bcd9ff5f58b1241ab5bcf7b1a47eb11389f24e4","target":"graph","created_at":"2026-05-18T02:33: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":"Constructions of optimal locally repairable codes (LRCs) in the case of $(r+1) \\nmid n$ and over small finite fields were stated as open problems for LRCs in [I. Tamo \\emph{et al.}, \"Optimal locally repairable codes and connections to matroid theory\", \\emph{2013 IEEE ISIT}]. In this paper, these problems are studied by constructing almost optimal linear LRCs, which are proven to be optimal for certain parameters, including cases for which $(r+1) \\nmid n$. More precisely, linear codes for given length, dimension, and all-symbol locality are constructed with almost optimal minimum distance. `Alm","authors_text":"Camilla Hollanti, Thomas Westerb\\\"ack, Toni Ernvall","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-17T08:41:16Z","title":"Constructions of Optimal and Almost Optimal Locally Repairable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4277","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:0054bebd1ed01b9cb5f228c82e83964bf25d7c22e6eeccdd0ab3cc08537db0ae","target":"record","created_at":"2026-05-18T02:33: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":"3f5120233a36c521ebb469e6770102d685aef3a7f6a00b804987213917e9be33","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-17T08:41:16Z","title_canon_sha256":"f5085f96a1b02b7501cada347229b9c2829065824cab68ecefb1dc0750929027"},"schema_version":"1.0","source":{"id":"1406.4277","kind":"arxiv","version":1}},"canonical_sha256":"6551b0182348e48a827280f37dfdaa12e1d54593dd46a1d370a4dc58bbf01c3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6551b0182348e48a827280f37dfdaa12e1d54593dd46a1d370a4dc58bbf01c3a","first_computed_at":"2026-05-18T02:33:25.192678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:33:25.192678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NDtF+og9V8iY6J71NIpvpDX0cmnLefu1Ewq8jk1q5PHyE7aKhaD7EY1aQxPv6KvRlR9w1aaDGzXpAmXD1qadAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:33:25.193170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.4277","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0054bebd1ed01b9cb5f228c82e83964bf25d7c22e6eeccdd0ab3cc08537db0ae","sha256:a10222dec7d3e8ce6577d8d07bcd9ff5f58b1241ab5bcf7b1a47eb11389f24e4"],"state_sha256":"500ce809bf851b339a61fde00ec99c1a024d5c3b0432e0d896716a4fbe9f6082"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ZdMvRpQe2nDVQiCiokyhxmUmht/Qlb0UazANQjVnUGxyvARyZF+qqobaPb4v5pJVtrGQMmya5VETxn0IxvBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:20:04.821452Z","bundle_sha256":"0ac6a62001729235abe1394789d7c97d98d97bb2d3bc4fb2b9d61a2dae569dc9"}}