{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NDWOVIF2UCRY64XOJXNUKITSY3","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":"2287e06d99651b20d5f2cb909ac3677b45fda590b556fd2f4e9ab843b74f9d7d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2025-12-08T23:18:08Z","title_canon_sha256":"6cad349439e519bb1a669cba6ff5b9736d9ed620a42fd2b173467fac1601338f"},"schema_version":"1.0","source":{"id":"2512.08100","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.08100","created_at":"2026-07-21T01:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"2512.08100v2","created_at":"2026-07-21T01:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.08100","created_at":"2026-07-21T01:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"NDWOVIF2UCRY","created_at":"2026-07-21T01:20:40Z"},{"alias_kind":"pith_short_16","alias_value":"NDWOVIF2UCRY64XO","created_at":"2026-07-21T01:20:40Z"},{"alias_kind":"pith_short_8","alias_value":"NDWOVIF2","created_at":"2026-07-21T01:20:40Z"}],"graph_snapshots":[{"event_id":"sha256:243a88ecd74161adcc67bad7b6cdf0548e07626d489ca5a870858c7aac2f209d","target":"graph","created_at":"2026-07-21T01:20:40Z","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/2512.08100/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We construct Locally Recoverable Codes (LRCs) with availability $2$ from a family of fibered surfaces. To obtain the locality and availability properties, and to estimate the minimum distance of the codes, we combine techniques coming from the theory of one-variable function fields and from the theory of fibrations on surfaces. When the locality parameter is $r=3$, we obtain a sharp bound on the minimum distance of the codes. In that case, we give a geometric interpretation of our codes in terms of doubly elliptic surfaces. In particular, this provides the first instance of an error correcting","authors_text":"Cec\\'ilia Salgado, Lara Vicino","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2025-12-08T23:18:08Z","title":"Locally Recoverable Codes with availability from a family of fibered surfaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.08100","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:ce21866bcfc7f6baae7910925e883055634de0b618e4735d9862ca5e2cc7a66a","target":"record","created_at":"2026-07-21T01:20:40Z","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":"2287e06d99651b20d5f2cb909ac3677b45fda590b556fd2f4e9ab843b74f9d7d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2025-12-08T23:18:08Z","title_canon_sha256":"6cad349439e519bb1a669cba6ff5b9736d9ed620a42fd2b173467fac1601338f"},"schema_version":"1.0","source":{"id":"2512.08100","kind":"arxiv","version":2}},"canonical_sha256":"68eceaa0baa0a38f72ee4ddb452272c6f81f9c1b037636efc4b31eb0bd13e7e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68eceaa0baa0a38f72ee4ddb452272c6f81f9c1b037636efc4b31eb0bd13e7e0","first_computed_at":"2026-07-21T01:20:40.718482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-21T01:20:40.718482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SjQ+AFFgRAvr/2S26MEYJTomirZEIgNA0wsbvmGypeTZjvIa3F7m7xdY+Vpdq7HDNwtbyRxdRo1mQ/O33NKdAQ==","signature_status":"signed_v1","signed_at":"2026-07-21T01:20:40.719524Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.08100","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce21866bcfc7f6baae7910925e883055634de0b618e4735d9862ca5e2cc7a66a","sha256:243a88ecd74161adcc67bad7b6cdf0548e07626d489ca5a870858c7aac2f209d"],"state_sha256":"b3aa24b20a8983ca6c5114da17bd5607bcf2c5e2fd01060539ec2e91fcd43e69"}