{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MQE5ZMKHVS5UUJ5G5PBM2ZFGU2","short_pith_number":"pith:MQE5ZMKH","canonical_record":{"source":{"id":"2608.10912","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-08-11T13:34:02Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"08cd7d73cc9069d1c1022058d5272018f37e604693068e5f76bc8247c9324de0","abstract_canon_sha256":"10162587322b9d3bcc2752eaefb1ca6a052d41ac014175cbc4fbfcc89dfb6473"},"schema_version":"1.0"},"canonical_sha256":"6409dcb147acbb4a27a6ebc2cd64a6a68f13ab6861c4f14ff4be5cb36151e3c6","source":{"kind":"arxiv","id":"2608.10912","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.10912","created_at":"2026-08-12T01:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"2608.10912v1","created_at":"2026-08-12T01:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.10912","created_at":"2026-08-12T01:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"MQE5ZMKHVS5U","created_at":"2026-08-12T01:23:47Z"},{"alias_kind":"pith_short_16","alias_value":"MQE5ZMKHVS5UUJ5G","created_at":"2026-08-12T01:23:47Z"},{"alias_kind":"pith_short_8","alias_value":"MQE5ZMKH","created_at":"2026-08-12T01:23:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MQE5ZMKHVS5UUJ5G5PBM2ZFGU2","target":"record","payload":{"canonical_record":{"source":{"id":"2608.10912","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-08-11T13:34:02Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"08cd7d73cc9069d1c1022058d5272018f37e604693068e5f76bc8247c9324de0","abstract_canon_sha256":"10162587322b9d3bcc2752eaefb1ca6a052d41ac014175cbc4fbfcc89dfb6473"},"schema_version":"1.0"},"canonical_sha256":"6409dcb147acbb4a27a6ebc2cd64a6a68f13ab6861c4f14ff4be5cb36151e3c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-12T01:23:47.638196Z","signature_b64":"e5aXOfB7PLFHoqz8IllhbkKSSN1+dyLUgGZp/uo5n+4Rt6rI/3ytgyn9faiKfYGoGpOKiQyzpMav//Qy8DDsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6409dcb147acbb4a27a6ebc2cd64a6a68f13ab6861c4f14ff4be5cb36151e3c6","last_reissued_at":"2026-08-12T01:23:47.636442Z","signature_status":"signed_v1","first_computed_at":"2026-08-12T01:23:47.636442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.10912","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-12T01:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qZC3tBGhDb9XhXZAzERaUOhS9pncUfINfqTpZIhbsIPoDeRqi/aHcnASY7pcD1cLYxx7snYcvCX4xqwczo8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T22:51:59.421701Z"},"content_sha256":"7e0ddf15767e19d8461a8374466d75063b1f7e2356abe486a6d7e0c6d92c6615","schema_version":"1.0","event_id":"sha256:7e0ddf15767e19d8461a8374466d75063b1f7e2356abe486a6d7e0c6d92c6615"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MQE5ZMKHVS5UUJ5G5PBM2ZFGU2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CSS Quantum LRCs with Intersecting Recovery Sets: Constructions and Bounds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Evagoras Stylianou, Holger Boche, Rawad Bitar, Vinayak Ramkumar","submitted_at":"2026-08-11T13:34:02Z","abstract_excerpt":"In this work, we study $(r,t,x)$ quantum locally recoverable codes (qLRCs) with locality $r$, $t$ recovery sets per qudit, and intersection parameter $x$. We first show that, assuming the underlying classical codes have dual minimum distance at least two, a CSS code is an $(r,t,x)$-qLRC if and only if the underlying classical codes are $(r,t,x)$ classical LRCs (cLRCs) with common recovery sets. We then use subset-inclusion matrices to construct families of binary dual-containing $(r,t,x)$-cLRCs, which yield binary $(r,t,x)$-qLRCs via the CSS construction. For CSS $(r,t,x)$-qLRCs, we derive upp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.10912","kind":"arxiv","version":1},"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/2608.10912/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-12T01:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KTluou9AL9lnPOSStIVnepYE0MvMxp7L2Gu8SxhnLYbrvPcAKiespQvzTvwCUkBj2F0oL6hJ5F8v+0ZYQkWKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T22:51:59.422380Z"},"content_sha256":"612ea19ef51df74a20aef374d3d7bac4917ef3af1efc372cc5dccfc0467652b7","schema_version":"1.0","event_id":"sha256:612ea19ef51df74a20aef374d3d7bac4917ef3af1efc372cc5dccfc0467652b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQE5ZMKHVS5UUJ5G5PBM2ZFGU2/bundle.json","state_url":"https://pith.science/pith/MQE5ZMKHVS5UUJ5G5PBM2ZFGU2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQE5ZMKHVS5UUJ5G5PBM2ZFGU2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-17T22:51:59Z","links":{"resolver":"https://pith.science/pith/MQE5ZMKHVS5UUJ5G5PBM2ZFGU2","bundle":"https://pith.science/pith/MQE5ZMKHVS5UUJ5G5PBM2ZFGU2/bundle.json","state":"https://pith.science/pith/MQE5ZMKHVS5UUJ5G5PBM2ZFGU2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQE5ZMKHVS5UUJ5G5PBM2ZFGU2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MQE5ZMKHVS5UUJ5G5PBM2ZFGU2","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":"10162587322b9d3bcc2752eaefb1ca6a052d41ac014175cbc4fbfcc89dfb6473","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-08-11T13:34:02Z","title_canon_sha256":"08cd7d73cc9069d1c1022058d5272018f37e604693068e5f76bc8247c9324de0"},"schema_version":"1.0","source":{"id":"2608.10912","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.10912","created_at":"2026-08-12T01:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"2608.10912v1","created_at":"2026-08-12T01:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.10912","created_at":"2026-08-12T01:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"MQE5ZMKHVS5U","created_at":"2026-08-12T01:23:47Z"},{"alias_kind":"pith_short_16","alias_value":"MQE5ZMKHVS5UUJ5G","created_at":"2026-08-12T01:23:47Z"},{"alias_kind":"pith_short_8","alias_value":"MQE5ZMKH","created_at":"2026-08-12T01:23:47Z"}],"graph_snapshots":[{"event_id":"sha256:612ea19ef51df74a20aef374d3d7bac4917ef3af1efc372cc5dccfc0467652b7","target":"graph","created_at":"2026-08-12T01:23:47Z","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/2608.10912/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we study $(r,t,x)$ quantum locally recoverable codes (qLRCs) with locality $r$, $t$ recovery sets per qudit, and intersection parameter $x$. We first show that, assuming the underlying classical codes have dual minimum distance at least two, a CSS code is an $(r,t,x)$-qLRC if and only if the underlying classical codes are $(r,t,x)$ classical LRCs (cLRCs) with common recovery sets. We then use subset-inclusion matrices to construct families of binary dual-containing $(r,t,x)$-cLRCs, which yield binary $(r,t,x)$-qLRCs via the CSS construction. For CSS $(r,t,x)$-qLRCs, we derive upp","authors_text":"Evagoras Stylianou, Holger Boche, Rawad Bitar, Vinayak Ramkumar","cross_cats":["math.IT","quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-08-11T13:34:02Z","title":"CSS Quantum LRCs with Intersecting Recovery Sets: Constructions and Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.10912","kind":"arxiv","version":1},"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:7e0ddf15767e19d8461a8374466d75063b1f7e2356abe486a6d7e0c6d92c6615","target":"record","created_at":"2026-08-12T01:23:47Z","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":"10162587322b9d3bcc2752eaefb1ca6a052d41ac014175cbc4fbfcc89dfb6473","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-08-11T13:34:02Z","title_canon_sha256":"08cd7d73cc9069d1c1022058d5272018f37e604693068e5f76bc8247c9324de0"},"schema_version":"1.0","source":{"id":"2608.10912","kind":"arxiv","version":1}},"canonical_sha256":"6409dcb147acbb4a27a6ebc2cd64a6a68f13ab6861c4f14ff4be5cb36151e3c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6409dcb147acbb4a27a6ebc2cd64a6a68f13ab6861c4f14ff4be5cb36151e3c6","first_computed_at":"2026-08-12T01:23:47.636442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-12T01:23:47.636442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e5aXOfB7PLFHoqz8IllhbkKSSN1+dyLUgGZp/uo5n+4Rt6rI/3ytgyn9faiKfYGoGpOKiQyzpMav//Qy8DDsCw==","signature_status":"signed_v1","signed_at":"2026-08-12T01:23:47.638196Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.10912","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e0ddf15767e19d8461a8374466d75063b1f7e2356abe486a6d7e0c6d92c6615","sha256:612ea19ef51df74a20aef374d3d7bac4917ef3af1efc372cc5dccfc0467652b7"],"state_sha256":"fcef1edb90a77c3d0254f8ddd175e3b8ca3a317a916f37006ec08f040361ad43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9R7Zmzzsfod0sx4666wojk4e5APhR2VK//T4DEaqkahIbKHXuxzQ8GStGxN0d6gU0GZ9360cg8EHbYCPsre2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T22:51:59.426429Z","bundle_sha256":"d25e007b5a02ed428bff6c1f11887b21a84bcab766bb459301611fc48eec5450"}}