{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IRMG4A5VGMGC6GJPH32DPBFL2Z","short_pith_number":"pith:IRMG4A5V","schema_version":"1.0","canonical_sha256":"44586e03b5330c2f192f3ef43784abd659362e72f6a78d943a5851be8669712f","source":{"kind":"arxiv","id":"2601.22567","version":2},"attestation_state":"computed","paper":{"title":"Quantum $(r,\\delta)$-Locally Recoverable BCH and Homothetic-BCH Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto","submitted_at":"2026-01-30T05:08:59Z","abstract_excerpt":"Quantum $(r,\\delta)$-locally recoverable codes ($(r,\\delta)$-LRCs) are the quantum version of classical $(r,\\delta)$-LRCs designed to recover multiple failures in large-scale distributed and cloud storage systems. A quantum $(r,\\delta)$-LRC, $Q(C)$, can be constructed from an $(r,\\delta)$-LRC, $C$, which is Euclidean or Hermitian dual-containing.\n  This article is devoted to studying how to get quantum $(r,\\delta)$-LRCs from BCH and homothetic-BCH codes. As a consequence, we give pure quantum $(r,\\delta)$-LRCs which are optimal for the Singleton-like bound."},"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":"2601.22567","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-01-30T05:08:59Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"60713a7d22b38c3bc2a06469a2c4a3c1bc1b7f91a1b8377223c171c2f27dad6d","abstract_canon_sha256":"a092d61dc35bf381bb985e718ad77050d6ea626d44b482a0b3909e06d8cc1132"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T01:22:28.699166Z","signature_b64":"mWkTwokzmRUfNX2Wcj8VpdeZr0vXX9+3yJ3CpY4ka06noOBumMP+3N4WDKLRQDL3rwH/ASxCuH8bNoYp3jeVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44586e03b5330c2f192f3ef43784abd659362e72f6a78d943a5851be8669712f","last_reissued_at":"2026-07-28T01:22:28.698229Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T01:22:28.698229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum $(r,\\delta)$-Locally Recoverable BCH and Homothetic-BCH Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto","submitted_at":"2026-01-30T05:08:59Z","abstract_excerpt":"Quantum $(r,\\delta)$-locally recoverable codes ($(r,\\delta)$-LRCs) are the quantum version of classical $(r,\\delta)$-LRCs designed to recover multiple failures in large-scale distributed and cloud storage systems. A quantum $(r,\\delta)$-LRC, $Q(C)$, can be constructed from an $(r,\\delta)$-LRC, $C$, which is Euclidean or Hermitian dual-containing.\n  This article is devoted to studying how to get quantum $(r,\\delta)$-LRCs from BCH and homothetic-BCH codes. As a consequence, we give pure quantum $(r,\\delta)$-LRCs which are optimal for the Singleton-like bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.22567","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/2601.22567/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":"2601.22567","created_at":"2026-07-28T01:22:28.698677+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.22567v2","created_at":"2026-07-28T01:22:28.698677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.22567","created_at":"2026-07-28T01:22:28.698677+00:00"},{"alias_kind":"pith_short_12","alias_value":"IRMG4A5VGMGC","created_at":"2026-07-28T01:22:28.698677+00:00"},{"alias_kind":"pith_short_16","alias_value":"IRMG4A5VGMGC6GJP","created_at":"2026-07-28T01:22:28.698677+00:00"},{"alias_kind":"pith_short_8","alias_value":"IRMG4A5V","created_at":"2026-07-28T01:22:28.698677+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.09522","citing_title":"Constructions of Quantum $(r,\\delta)$-LRCs from cyclic codes","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2606.06736","citing_title":"Quantum Hierarchical Locally Recoverable Codes","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IRMG4A5VGMGC6GJPH32DPBFL2Z","json":"https://pith.science/pith/IRMG4A5VGMGC6GJPH32DPBFL2Z.json","graph_json":"https://pith.science/api/pith-number/IRMG4A5VGMGC6GJPH32DPBFL2Z/graph.json","events_json":"https://pith.science/api/pith-number/IRMG4A5VGMGC6GJPH32DPBFL2Z/events.json","paper":"https://pith.science/paper/IRMG4A5V"},"agent_actions":{"view_html":"https://pith.science/pith/IRMG4A5VGMGC6GJPH32DPBFL2Z","download_json":"https://pith.science/pith/IRMG4A5VGMGC6GJPH32DPBFL2Z.json","view_paper":"https://pith.science/paper/IRMG4A5V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.22567&json=true","fetch_graph":"https://pith.science/api/pith-number/IRMG4A5VGMGC6GJPH32DPBFL2Z/graph.json","fetch_events":"https://pith.science/api/pith-number/IRMG4A5VGMGC6GJPH32DPBFL2Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IRMG4A5VGMGC6GJPH32DPBFL2Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IRMG4A5VGMGC6GJPH32DPBFL2Z/action/storage_attestation","attest_author":"https://pith.science/pith/IRMG4A5VGMGC6GJPH32DPBFL2Z/action/author_attestation","sign_citation":"https://pith.science/pith/IRMG4A5VGMGC6GJPH32DPBFL2Z/action/citation_signature","submit_replication":"https://pith.science/pith/IRMG4A5VGMGC6GJPH32DPBFL2Z/action/replication_record"}},"created_at":"2026-07-28T01:22:28.698677+00:00","updated_at":"2026-07-28T01:22:28.698677+00:00"}