{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FUEL7MPX7H7OKJ5FQF3SFQIACV","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":"117c7ee9df2ae88834d8087160a1b2054c0e759981dbac798cf927848b272414","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-05-30T13:25:44Z","title_canon_sha256":"446f9df4bb00d6e829ee71249a733e1c23eb63e14e34da6407742bcc9cc30291"},"schema_version":"1.0","source":{"id":"2505.24573","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.24573","created_at":"2026-05-20T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"2505.24573v2","created_at":"2026-05-20T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24573","created_at":"2026-05-20T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"FUEL7MPX7H7O","created_at":"2026-05-20T00:01:34Z"},{"alias_kind":"pith_short_16","alias_value":"FUEL7MPX7H7OKJ5F","created_at":"2026-05-20T00:01:34Z"},{"alias_kind":"pith_short_8","alias_value":"FUEL7MPX","created_at":"2026-05-20T00:01:34Z"}],"graph_snapshots":[{"event_id":"sha256:07125e7c86358537acdb5b247e73cb56d72908ea0cb4408ff6222cc60439db8d","target":"graph","created_at":"2026-05-20T00:01:34Z","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/2505.24573/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Umberto Mart\\'inez-Pe\\~nas, V. Lalitha","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-05-30T13:25:44Z","title":"Maximally recoverable codes with locality and availability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24573","kind":"arxiv","version":2},"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:c3dc103882243e988ab113aaab8965c34317b7a0d629aac27d2c29fb8e47d767","target":"record","created_at":"2026-05-20T00:01:34Z","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":"117c7ee9df2ae88834d8087160a1b2054c0e759981dbac798cf927848b272414","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-05-30T13:25:44Z","title_canon_sha256":"446f9df4bb00d6e829ee71249a733e1c23eb63e14e34da6407742bcc9cc30291"},"schema_version":"1.0","source":{"id":"2505.24573","kind":"arxiv","version":2}},"canonical_sha256":"2d08bfb1f7f9fee527a5817722c1001571c97a995ff536f24a62006e1461f45d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d08bfb1f7f9fee527a5817722c1001571c97a995ff536f24a62006e1461f45d","first_computed_at":"2026-05-20T00:01:34.102672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:34.102672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZHpWRTo6nWOsBmRuWTNdhBtz5/uiV9TRSDRVVSlInphrT6yR4JtE7Opvt4X8MKx7khArR0k584f4hbWAlfK4Ag==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:34.103596Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.24573","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3dc103882243e988ab113aaab8965c34317b7a0d629aac27d2c29fb8e47d767","sha256:07125e7c86358537acdb5b247e73cb56d72908ea0cb4408ff6222cc60439db8d"],"state_sha256":"ebffcd4c1ed3c0f94c6990fcd8d3d5c762b6512b8e5823fa9a1c4763cd82df4d"}