{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MPTRSLBERSJ63UYZFTHT6OECJC","short_pith_number":"pith:MPTRSLBE","schema_version":"1.0","canonical_sha256":"63e7192c248c93edd3192ccf3f388248a07f3d708d4e0818ebaf485bf0357bef","source":{"kind":"arxiv","id":"1501.00153","version":3},"attestation_state":"computed","paper":{"title":"On the Combinatorics of Locally Repairable Codes via Matroid Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, Ragnar Freij, Thomas Westerb\\\"ack, Toni Ernvall","submitted_at":"2014-12-31T15:34:32Z","abstract_excerpt":"This paper provides a link between matroid theory and locally repairable codes (LRCs) that are either linear or more generally almost affine. Using this link, new results on both LRCs and matroid theory are derived. The parameters $(n,k,d,r,\\delta)$ of LRCs are generalized to matroids, and the matroid analogue of the generalized Singleton bound in [P. Gopalan et al., \"On the locality of codeword symbols,\" IEEE Trans. Inf. Theory] for linear LRCs is given for matroids. It is shown that the given bound is not tight for certain classes of parameters, implying a nonexistence result for the corresp"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1501.00153","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-31T15:34:32Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"ef2051dea059ad586abf381a7d82289877d09730daa0634269faa87c3d46c006","abstract_canon_sha256":"86d9a8c59348bf36a5df94aba0657a73c097ae89e2b193efb0b7af2858cda7f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:12.861329Z","signature_b64":"crGObI+pJb8H9BUFhmJqaC3EpIX7r0Gd3EnfUew5T3CjMYP7s3Yve80oHsuElA4/yiRftWXq5etdGYrTLGf/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63e7192c248c93edd3192ccf3f388248a07f3d708d4e0818ebaf485bf0357bef","last_reissued_at":"2026-05-18T01:22:12.860744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:12.860744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Combinatorics of Locally Repairable Codes via Matroid Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, Ragnar Freij, Thomas Westerb\\\"ack, Toni Ernvall","submitted_at":"2014-12-31T15:34:32Z","abstract_excerpt":"This paper provides a link between matroid theory and locally repairable codes (LRCs) that are either linear or more generally almost affine. Using this link, new results on both LRCs and matroid theory are derived. The parameters $(n,k,d,r,\\delta)$ of LRCs are generalized to matroids, and the matroid analogue of the generalized Singleton bound in [P. Gopalan et al., \"On the locality of codeword symbols,\" IEEE Trans. Inf. Theory] for linear LRCs is given for matroids. It is shown that the given bound is not tight for certain classes of parameters, implying a nonexistence result for the corresp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00153","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.00153","created_at":"2026-05-18T01:22:12.860823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00153v3","created_at":"2026-05-18T01:22:12.860823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00153","created_at":"2026-05-18T01:22:12.860823+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPTRSLBERSJ6","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPTRSLBERSJ63UYZ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPTRSLBE","created_at":"2026-05-18T12:28:38.356838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MPTRSLBERSJ63UYZFTHT6OECJC","json":"https://pith.science/pith/MPTRSLBERSJ63UYZFTHT6OECJC.json","graph_json":"https://pith.science/api/pith-number/MPTRSLBERSJ63UYZFTHT6OECJC/graph.json","events_json":"https://pith.science/api/pith-number/MPTRSLBERSJ63UYZFTHT6OECJC/events.json","paper":"https://pith.science/paper/MPTRSLBE"},"agent_actions":{"view_html":"https://pith.science/pith/MPTRSLBERSJ63UYZFTHT6OECJC","download_json":"https://pith.science/pith/MPTRSLBERSJ63UYZFTHT6OECJC.json","view_paper":"https://pith.science/paper/MPTRSLBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00153&json=true","fetch_graph":"https://pith.science/api/pith-number/MPTRSLBERSJ63UYZFTHT6OECJC/graph.json","fetch_events":"https://pith.science/api/pith-number/MPTRSLBERSJ63UYZFTHT6OECJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPTRSLBERSJ63UYZFTHT6OECJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPTRSLBERSJ63UYZFTHT6OECJC/action/storage_attestation","attest_author":"https://pith.science/pith/MPTRSLBERSJ63UYZFTHT6OECJC/action/author_attestation","sign_citation":"https://pith.science/pith/MPTRSLBERSJ63UYZFTHT6OECJC/action/citation_signature","submit_replication":"https://pith.science/pith/MPTRSLBERSJ63UYZFTHT6OECJC/action/replication_record"}},"created_at":"2026-05-18T01:22:12.860823+00:00","updated_at":"2026-05-18T01:22:12.860823+00:00"}