{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4TVGBSNMXDONEZZCVAMHGZQJDT","short_pith_number":"pith:4TVGBSNM","schema_version":"1.0","canonical_sha256":"e4ea60c9acb8dcd26722a8187366091cd8d78af9b13bcdeb7ebf586c5037f02d","source":{"kind":"arxiv","id":"1907.05316","version":1},"attestation_state":"computed","paper":{"title":"Computing sharp recovery structures for Locally Recoverable codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Carlos Munuera, Edgar Martinez-Moro, Irene Marquez-Corbella","submitted_at":"2019-07-11T15:44:13Z","abstract_excerpt":"A locally recoverable code is an error-correcting code such that any erasure in a single coordinate of a codeword can be recovered from a small subset of other coordinates. In this article we develop an algorithm that computes a recovery structure as concise posible for an arbitrary linear code $\\mathcal{C}$ and a recovery method that realizes it. This algorithm also provides the locality and the dual distance of $\\mathcal{C}$. Complexity issues are studied as well. Several examples are included."},"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":"1907.05316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-11T15:44:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"86b5dd94e1d6eabdb1b7452e283c18600750cb913873726f6138550b177c8423","abstract_canon_sha256":"b9a2dfd754d8eab153e257ab50a96fcb30b829ed5afe9dae1e3e1dfe48464507"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:50.763579Z","signature_b64":"OVY4SKNCySQZhMSkJqXTRLNFERd2TvLRrdo/7FLXy/5ToYkHNSASX3tmfOOujTHpmUErWTUbzSOIh/i7VvTjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4ea60c9acb8dcd26722a8187366091cd8d78af9b13bcdeb7ebf586c5037f02d","last_reissued_at":"2026-05-17T23:40:50.762951Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:50.762951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing sharp recovery structures for Locally Recoverable codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Carlos Munuera, Edgar Martinez-Moro, Irene Marquez-Corbella","submitted_at":"2019-07-11T15:44:13Z","abstract_excerpt":"A locally recoverable code is an error-correcting code such that any erasure in a single coordinate of a codeword can be recovered from a small subset of other coordinates. In this article we develop an algorithm that computes a recovery structure as concise posible for an arbitrary linear code $\\mathcal{C}$ and a recovery method that realizes it. This algorithm also provides the locality and the dual distance of $\\mathcal{C}$. Complexity issues are studied as well. Several examples are included."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05316","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.05316","created_at":"2026-05-17T23:40:50.763033+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.05316v1","created_at":"2026-05-17T23:40:50.763033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05316","created_at":"2026-05-17T23:40:50.763033+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TVGBSNMXDON","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TVGBSNMXDONEZZC","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TVGBSNM","created_at":"2026-05-18T12:33:10.108867+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/4TVGBSNMXDONEZZCVAMHGZQJDT","json":"https://pith.science/pith/4TVGBSNMXDONEZZCVAMHGZQJDT.json","graph_json":"https://pith.science/api/pith-number/4TVGBSNMXDONEZZCVAMHGZQJDT/graph.json","events_json":"https://pith.science/api/pith-number/4TVGBSNMXDONEZZCVAMHGZQJDT/events.json","paper":"https://pith.science/paper/4TVGBSNM"},"agent_actions":{"view_html":"https://pith.science/pith/4TVGBSNMXDONEZZCVAMHGZQJDT","download_json":"https://pith.science/pith/4TVGBSNMXDONEZZCVAMHGZQJDT.json","view_paper":"https://pith.science/paper/4TVGBSNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.05316&json=true","fetch_graph":"https://pith.science/api/pith-number/4TVGBSNMXDONEZZCVAMHGZQJDT/graph.json","fetch_events":"https://pith.science/api/pith-number/4TVGBSNMXDONEZZCVAMHGZQJDT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TVGBSNMXDONEZZCVAMHGZQJDT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TVGBSNMXDONEZZCVAMHGZQJDT/action/storage_attestation","attest_author":"https://pith.science/pith/4TVGBSNMXDONEZZCVAMHGZQJDT/action/author_attestation","sign_citation":"https://pith.science/pith/4TVGBSNMXDONEZZCVAMHGZQJDT/action/citation_signature","submit_replication":"https://pith.science/pith/4TVGBSNMXDONEZZCVAMHGZQJDT/action/replication_record"}},"created_at":"2026-05-17T23:40:50.763033+00:00","updated_at":"2026-05-17T23:40:50.763033+00:00"}