{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:TKKTNPCPSQJ6D3YRQN3SE7J4AJ","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":"664ae2ac8ef0b14a52ed6fa8606ad03b0e1d5bb8df1957267e9cc674697ae5d8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-24T10:27:25Z","title_canon_sha256":"e4c88e97d67452bbbc0558c9bba6f97d21f6081634d15468463a6601c9bd4aaa"},"schema_version":"1.0","source":{"id":"2310.15703","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.15703","created_at":"2026-07-05T11:48:19Z"},{"alias_kind":"arxiv_version","alias_value":"2310.15703v2","created_at":"2026-07-05T11:48:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.15703","created_at":"2026-07-05T11:48:19Z"},{"alias_kind":"pith_short_12","alias_value":"TKKTNPCPSQJ6","created_at":"2026-07-05T11:48:19Z"},{"alias_kind":"pith_short_16","alias_value":"TKKTNPCPSQJ6D3YR","created_at":"2026-07-05T11:48:19Z"},{"alias_kind":"pith_short_8","alias_value":"TKKTNPCP","created_at":"2026-07-05T11:48:19Z"}],"graph_snapshots":[{"event_id":"sha256:bd089e5e3497284b1dc7e4d30cc21ea5ad924131ed396571218b2eb129ce3a39","target":"graph","created_at":"2026-07-05T11:48:19Z","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/2310.15703/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Locally recoverable codes (LRCs) are classical error-correcting codes widely used in large scale distributed and cloud storage systems. Quantum locally recoverable codes (quantum LRCs) are the quantum counterpart of classical LRCs. They allow us to correct erasures at several positions from a trace-preserving quantum operation acting on qudits of a larger set of positions. Parameters and localities of quantum LRCs satisfy a Singleton-like bound; codes attaching this bound are named to be optimal. Quantum LRCs, $\\mathcal{Q}(\\mathcal{C})$, can be constructed from classical Hermitian (or Euclidea","authors_text":"Carlos Galindo, Carlos Munuera, Diego Ruano, Fernando Hernando","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-24T10:27:25Z","title":"Optimal quantum locally recoverable codes from matrix-product construction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.15703","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:058e556c1aa274325add3135ac5e2e800ad50b2c99550bb252ce12a846d93a44","target":"record","created_at":"2026-07-05T11:48:19Z","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":"664ae2ac8ef0b14a52ed6fa8606ad03b0e1d5bb8df1957267e9cc674697ae5d8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-24T10:27:25Z","title_canon_sha256":"e4c88e97d67452bbbc0558c9bba6f97d21f6081634d15468463a6601c9bd4aaa"},"schema_version":"1.0","source":{"id":"2310.15703","kind":"arxiv","version":2}},"canonical_sha256":"9a9536bc4f9413e1ef118377227d3c025ca4fca357f8f7d810ac7bcf8537aaad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a9536bc4f9413e1ef118377227d3c025ca4fca357f8f7d810ac7bcf8537aaad","first_computed_at":"2026-07-05T11:48:19.549618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:48:19.549618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xyuxYe9OfEU1NfUh24SNLJ8leVwLlzENLt3DaEPi7J2stlW9IhUowscx98NyEkkPyWZ+95xcqUx+3uPxX3OeBg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:48:19.550104Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.15703","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:058e556c1aa274325add3135ac5e2e800ad50b2c99550bb252ce12a846d93a44","sha256:bd089e5e3497284b1dc7e4d30cc21ea5ad924131ed396571218b2eb129ce3a39"],"state_sha256":"d7263f300ed40fe9e78a5b4112a9318160a86ead206442da6bf06198603adf46"}