{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FUEL7MPX7H7OKJ5FQF3SFQIACV","short_pith_number":"pith:FUEL7MPX","schema_version":"1.0","canonical_sha256":"2d08bfb1f7f9fee527a5817722c1001571c97a995ff536f24a62006e1461f45d","source":{"kind":"arxiv","id":"2505.24573","version":2},"attestation_state":"computed","paper":{"title":"Maximally recoverable codes with locality and availability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Umberto Mart\\'inez-Pe\\~nas, V. Lalitha","submitted_at":"2025-05-30T13:25:44Z","abstract_excerpt":"In this work, we introduce maximally recoverable codes with locality and availability. We consider locally repairable codes (LRCs) where certain subsets of $ t $ symbols belong each to $ N $ local repair sets, which are pairwise disjoint after removing the $ t $ symbols, and which are of size $ r+\\delta-1 $ and can correct $ \\delta-1 $ erasures locally. Classical LRCs with $ N $ disjoint repair sets and LRCs with $ N $-availability are recovered when setting $ t = 1 $ and $ t=\\delta-1=1 $, respectively. Allowing $ t > 1 $ enables our codes to reduce the storage overhead for the same locality a"},"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":"2505.24573","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-05-30T13:25:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"446f9df4bb00d6e829ee71249a733e1c23eb63e14e34da6407742bcc9cc30291","abstract_canon_sha256":"117c7ee9df2ae88834d8087160a1b2054c0e759981dbac798cf927848b272414"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:34.103596Z","signature_b64":"ZHpWRTo6nWOsBmRuWTNdhBtz5/uiV9TRSDRVVSlInphrT6yR4JtE7Opvt4X8MKx7khArR0k584f4hbWAlfK4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d08bfb1f7f9fee527a5817722c1001571c97a995ff536f24a62006e1461f45d","last_reissued_at":"2026-05-20T00:01:34.102672Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:34.102672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximally recoverable codes with locality and availability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Umberto Mart\\'inez-Pe\\~nas, V. Lalitha","submitted_at":"2025-05-30T13:25:44Z","abstract_excerpt":"In this work, we introduce maximally recoverable codes with locality and availability. We consider locally repairable codes (LRCs) where certain subsets of $ t $ symbols belong each to $ N $ local repair sets, which are pairwise disjoint after removing the $ t $ symbols, and which are of size $ r+\\delta-1 $ and can correct $ \\delta-1 $ erasures locally. Classical LRCs with $ N $ disjoint repair sets and LRCs with $ N $-availability are recovered when setting $ t = 1 $ and $ t=\\delta-1=1 $, respectively. Allowing $ t > 1 $ enables our codes to reduce the storage overhead for the same locality a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24573","kind":"arxiv","version":2},"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/2505.24573/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.24573","created_at":"2026-05-20T00:01:34.102834+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.24573v2","created_at":"2026-05-20T00:01:34.102834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24573","created_at":"2026-05-20T00:01:34.102834+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUEL7MPX7H7O","created_at":"2026-05-20T00:01:34.102834+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUEL7MPX7H7OKJ5F","created_at":"2026-05-20T00:01:34.102834+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUEL7MPX","created_at":"2026-05-20T00:01:34.102834+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/FUEL7MPX7H7OKJ5FQF3SFQIACV","json":"https://pith.science/pith/FUEL7MPX7H7OKJ5FQF3SFQIACV.json","graph_json":"https://pith.science/api/pith-number/FUEL7MPX7H7OKJ5FQF3SFQIACV/graph.json","events_json":"https://pith.science/api/pith-number/FUEL7MPX7H7OKJ5FQF3SFQIACV/events.json","paper":"https://pith.science/paper/FUEL7MPX"},"agent_actions":{"view_html":"https://pith.science/pith/FUEL7MPX7H7OKJ5FQF3SFQIACV","download_json":"https://pith.science/pith/FUEL7MPX7H7OKJ5FQF3SFQIACV.json","view_paper":"https://pith.science/paper/FUEL7MPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.24573&json=true","fetch_graph":"https://pith.science/api/pith-number/FUEL7MPX7H7OKJ5FQF3SFQIACV/graph.json","fetch_events":"https://pith.science/api/pith-number/FUEL7MPX7H7OKJ5FQF3SFQIACV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUEL7MPX7H7OKJ5FQF3SFQIACV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUEL7MPX7H7OKJ5FQF3SFQIACV/action/storage_attestation","attest_author":"https://pith.science/pith/FUEL7MPX7H7OKJ5FQF3SFQIACV/action/author_attestation","sign_citation":"https://pith.science/pith/FUEL7MPX7H7OKJ5FQF3SFQIACV/action/citation_signature","submit_replication":"https://pith.science/pith/FUEL7MPX7H7OKJ5FQF3SFQIACV/action/replication_record"}},"created_at":"2026-05-20T00:01:34.102834+00:00","updated_at":"2026-05-20T00:01:34.102834+00:00"}