{"as_of":"2026-08-14T00:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c0d11ae18de25cb24108e4096b30561925170a742fb9a8fdf3a0b0c3aea116d2","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T19:44:13.407355Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.06854/citation-record","integrity":"/paper/2608.06854/integrity","json":"/paper/2608.06854/citation-record.json","paper":"/paper/2608.06854"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:14.124459Z","title":"On the locality of codeword symbols,","venue":null,"work_id":"8b0f8534-204a-46e0-aa58-3845a80928a5","year":2012},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.209721Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:09db5975acb527c75c7e9a99e0e82c07c83b4f57501c91cad2f63ffc31ba2d58","observation_id":"eed249c3-3341-4e78-b785-e35a32848e0a","resolution":{"observed_at":"2026-08-10T19:44:14.130065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:14.106676Z","title":"Bounds on the size of locally recoverable codes,","venue":null,"work_id":"a6efca39-7906-4be1-a77f-0461d8132c27","year":2015},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.215628Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:f2476e4299e40d746b2f987944018457158d6781fea4c7c2f73649ada7eda283","observation_id":"a0848437-c9ab-4504-ba44-86819394fc4f","resolution":{"observed_at":"2026-08-10T19:44:14.111810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:14.085978Z","title":"Bounds and constructions of locally repairable codes: Parity-check matrix approach,","venue":null,"work_id":"30cf7b42-007b-48ad-89c3-e281c67a296a","year":2020},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.220865Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:ceae51faaa3b7d26bc860342d3176911a3ee400a34e804a5a3e443dc740da53c","observation_id":"8c9c397b-0835-48b5-87aa-cd54099026c7","resolution":{"observed_at":"2026-08-10T19:44:14.092372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:14.068554Z","title":"Optimal linear codes with a local-error-correction property,","venue":null,"work_id":"3f307884-32ba-499b-9772-103ec45ba177","year":2012},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.226516Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:43bc027953e10ee8e4d815ff46753985c1b07dfedfa8037c603598588c0339ec","observation_id":"9a015967-56a4-4623-b6ca-443bf93ac6c5","resolution":{"observed_at":"2026-08-10T19:44:14.074174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:14.051782Z","title":"Bounds on the parameters of locally recoverable codes,","venue":null,"work_id":"cb89ffe2-ff6d-417f-a743-ce4ce300e8c5","year":2016},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.233603Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:acafc56a0df60d669fb2e633369efcf7b1faeb5c1a340126c22e981b27c372a6","observation_id":"39f84622-8f2f-4689-a47a-0d9082e6a521","resolution":{"observed_at":"2026-08-10T19:44:14.056843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.239488Z","title":"A family of optimal locally recoverable codes,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.239488Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:dc500ee1ef28c54a3f9a6cac185686fb8483594a24abeeb8723108f92de0bc4c","observation_id":"30a2c28b-0717-4f9f-94de-9482a6106387","resolution":{"observed_at":"2026-08-10T19:44:13.239488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:14.022304Z","title":"Cyclic lrc codes and their subfield subcodes,","venue":null,"work_id":"44bf47b1-8738-4169-a7f4-cedfbd134afb","year":2015},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.245633Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:168c434dbd4f37cc3d9dc0a80c2df6ca08aa23f5594a0e7846fd5d277d9b3d2a","observation_id":"91413b4d-e040-4d5b-aa3b-d38887bc0719","resolution":{"observed_at":"2026-08-10T19:44:14.028223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.251005Z","title":"Locally repairable codes,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.251005Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:364d7576988668316a3491b0472ea5993858ef5c0a933f470f3793d3591aca37","observation_id":"530c71b7-4367-4017-b29c-bf09ace422f0","resolution":{"observed_at":"2026-08-10T19:44:13.251005Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.992559Z","title":"Constructions of optimal cyclic(r, δ)locally repairable codes,","venue":null,"work_id":"1a3d13d3-08e7-4935-9a14-35a41971cc4a","year":2017},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.256257Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:f6cea4c91b1e327b06086a6d600d2cf264bc2a00ed07d2f9c697316ae295cfa7","observation_id":"bb782123-c4ca-4517-bdb2-ce0a0f1e72e3","resolution":{"observed_at":"2026-08-10T19:44:13.998453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.974672Z","title":"Quantum locally recoverable codes,","venue":null,"work_id":"78db33f7-9046-451e-88b0-75ac2735d680","year":2025},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.262386Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:5dd518924d39197e59cc8dfa70e07af424820db1bee06cfd0d4a06d1240f4de3","observation_id":"7b2adcf6-aff0-4144-b427-837e39334d29","resolution":{"observed_at":"2026-08-10T19:44:13.980327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.957091Z","title":"Bounds and constructions of quantum locally recoverable codes from quantum css codes,","venue":null,"work_id":"e1e477c7-306b-463c-bd7b-26947dfcba2a","year":2025},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.267843Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:83c53360d6c80c807d47e5af35c4fafb83b6a7b080d02c9e520f56466af55454","observation_id":"740452e0-c93e-407f-9052-cbea983634f8","resolution":{"observed_at":"2026-08-10T19:44:13.962343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.939278Z","title":"Quantum (r,δ)-locally recoverable codes,","venue":null,"work_id":"79cd4cc8-b1a0-4c03-98b3-b575c51b378b","year":2026},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.273451Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:2e7de656954822013916ac7be91e7c819cb93ad9da743999693efcdd3b5351a3","observation_id":"b4c3e025-31ce-4dcd-a13a-4f3989958eae","resolution":{"observed_at":"2026-08-10T19:44:13.944556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.920848Z","title":"Quantum locally recoverable codes via good polynomials,","venue":null,"work_id":"f51ce8f5-49a1-4e58-87f7-126d352fb8fe","year":2025},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.279169Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:17e1ee63a3c872a729c9716e6f1abc62c47c819f104c96eab01a1fbde97781b8","observation_id":"628d51d4-71b9-43ef-8110-01a2ebc658f8","resolution":{"observed_at":"2026-08-10T19:44:13.926858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.10354","last_updated":"2025-01-17T18:55:47Z","snapshot_observed_at":"2026-08-10T19:08:08.940410Z","submitted_at":"2025-01-17T18:55:47Z","title":"Quantum locally recoverable code with intersecting recovery sets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.10354","snapshot_observed_at":"2026-08-10T19:44:13.284456Z","title":"Quantum locally recoverable code with intersecting recovery sets,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.284456Z"},"links":{"cited_paper":"/paper/2501.10354","citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:be10bcdf636c453f3a080beb76a727571481e5a9bf3a1e066d337af85a89476e","observation_id":"ce761eb0-6608-4742-8aa0-c4bfe5165407","resolution":{"observed_at":"2026-08-10T19:44:13.284456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.289942Z","title":"Improved bounds and optimal constructions of pure quantum locally recoverable codes,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.289942Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:0d3b4f4edfb3183492cd24a56cecdcc64fbc7230dd2f85d046d139ed719ec33b","observation_id":"0febd6ed-3167-4499-909e-ff1b8ad37390","resolution":{"observed_at":"2026-08-10T19:44:13.289942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.13553","last_updated":"2025-08-19T06:21:51Z","snapshot_observed_at":"2026-08-10T17:32:31.478948Z","submitted_at":"2025-08-19T06:21:51Z","title":"On optimal quantum LRCs from the Hermitian construction and $t$-designs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.13553","snapshot_observed_at":"2026-08-10T19:44:13.295059Z","title":"On optimal quantum lrcs from the hermitian construction andt-designs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.295059Z"},"links":{"cited_paper":"/paper/2508.13553","citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:edca84f866b3a0bf6f6fb112ca52bd5d75346c52d0622c6e3738aa21d84a8e52","observation_id":"48872293-621d-472d-8d61-837f6edf45d4","resolution":{"observed_at":"2026-08-10T19:44:13.295059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.901705Z","title":"Two families of optimal quantum locally recoverable codes,","venue":null,"work_id":"5538c510-f90a-4236-86b3-e08b651e370d","year":2025},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.300401Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:9b7636d4b06b86cbd3a65e956c55e6e44aef72092f32829a65bd805659c03d68","observation_id":"2eca4590-71be-45c0-95d0-c732f166f38c","resolution":{"observed_at":"2026-08-10T19:44:13.907209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.883629Z","title":"General entanglement-assisted quantum error-correcting codes,","venue":null,"work_id":"fc060fdf-843d-4c4c-a45b-5b6a13f9cb29","year":2007},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.306200Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:efb27b2626ae4b9b5ecd3fba8e86592e4974f68fb78c051f312cf8b1f1cad8e1","observation_id":"eac1318a-9506-443c-ac11-cc09b643dc2b","resolution":{"observed_at":"2026-08-10T19:44:13.889933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2607.27091","last_updated":"2026-07-29T16:19:14Z","snapshot_observed_at":"2026-08-07T23:32:08.196095Z","submitted_at":"2026-07-29T16:19:14Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Characterizations, Bounds, and Constructions","version":1},"cited_work":{"arxiv_id":"2607.27091","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.27091","snapshot_observed_at":"2026-08-10T19:44:13.471374Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Characterizations, Bounds, and Constructions","venue":"cs.IT","work_id":"c37584b8-0e5a-4185-92ac-6325df8909a0","year":2026},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.311285Z"},"links":{"cited_paper":"/paper/2607.27091","citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:67bd54d6611c928abffd545edb7f51c648fdc7ca701724c7f0f39a1e9843f813","observation_id":"6a39ec8a-fcc9-471d-b408-90b30771fb29","resolution":{"observed_at":"2026-08-10T19:44:13.479378Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.865267Z","title":"Optimal locally repairable codes of distance 3 and 4 via cyclic codes,","venue":null,"work_id":"6d3a8490-de3a-47ad-a103-43ec8f4289ee","year":2018},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.317950Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:f846037ee2f4f2b5798d24429cd9c6b53d8c86925c189913b5688905ea75bc15","observation_id":"4764839c-dc28-4f0c-8a9f-93f1d62466b7","resolution":{"observed_at":"2026-08-10T19:44:13.870598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.847051Z","title":"The minimum locality of linear codes,","venue":null,"work_id":"4e78de11-1fe8-4c8e-af71-d5afd9da7204","year":2023},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.323634Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:08766e1e35acb858a3b5baaae98c5490b3bcc396dc7374a4edb6db7ea1eb5b1f","observation_id":"dabd386d-f655-4625-a464-74ca265a13dc","resolution":{"observed_at":"2026-08-10T19:44:13.852458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.830623Z","title":"Theory of quantum error correction for general noise,","venue":null,"work_id":"c84550cd-970a-4e8a-b4bd-f4908ef523d4","year":2000},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.329160Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:a4328b5f2a4d016971cd0aecc1dd3fb9bef2cf8189a09eaa0f03d85327672cd9","observation_id":"24da5523-e4f5-4fa9-8fc2-4af006068bab","resolution":{"observed_at":"2026-08-10T19:44:13.836190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.334788Z","title":"Can quantum-mechanical description of physical reality be considered complete?","venue":null,"work_id":null,"year":1935},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.334788Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:b940416cd519d714fea3263a051a729141bc2116f56cde8545cb62673bf507e4","observation_id":"3ffd632e-ee52-4cf4-bf0d-84bb8fa45cc6","resolution":{"observed_at":"2026-08-10T19:44:13.334788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.801603Z","title":"Linear programming bounds for entanglement-assisted quantum error-correcting codes by split weight enumerators,","venue":null,"work_id":"e94a19db-697e-4e13-94b4-3e35bce88821","year":2017},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.339656Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:37b9cee33c0ccd3afff19ec2e40e42a37e9ae9381c098ab2776c7ac131c075c6","observation_id":"0db12fef-7862-45c9-aba6-452b4f204ef5","resolution":{"observed_at":"2026-08-10T19:44:13.807023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.782931Z","title":"Catalytic quantum error correction,","venue":null,"work_id":"53441760-61d7-46dd-be5d-010e4ea09bda","year":2014},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.344899Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:9531c7eaaf98d5ee554dbe9e34d3f03b07f35afaaeeb09395952051a331c861c","observation_id":"5b379620-2ad4-4a4a-8b2b-a3f9c54909fc","resolution":{"observed_at":"2026-08-10T19:44:13.788955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.762660Z","title":"Entanglement-assisted quantum error-correcting codes over arbitrary finite fields: C. galindo et al","venue":null,"work_id":"0109bb26-0d37-44c5-a772-ab30e587feba","year":2019},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.350705Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:145e54899b38a0ea8b6c6b3f4aa61dbceb40691ad31e6281ef7f8079be3703ab","observation_id":"9a251d40-bf34-425e-a82e-1a181b8af9e9","resolution":{"observed_at":"2026-08-10T19:44:13.769420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.05647","last_updated":"2022-09-05T23:59:57Z","snapshot_observed_at":"2026-08-13T15:05:34.130204Z","submitted_at":"2022-07-12T16:25:20Z","title":"How Much Entanglement Does a Quantum Code Need?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.05647","snapshot_observed_at":"2026-08-10T19:44:13.356554Z","title":"How much entanglement does a quantum code need?","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.356554Z"},"links":{"cited_paper":"/paper/2207.05647","citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:a533e439b120e8984baa0a94cca59fcc88452f98157503e990e810d2532b48df","observation_id":"342d21d9-7f89-4018-b8d6-9f96163312a3","resolution":{"observed_at":"2026-08-10T19:44:13.356554Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.742848Z","title":null,"venue":null,"work_id":"70648b0f-f7bf-47ac-9987-772780e92d57","year":2010},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.363283Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:6fe5a191a384c25945f5ad2270435a9baf88634d7c0a3ea2ed886de52b3b53c5","observation_id":"0c027b92-558f-40da-908a-cdb75eecfa41","resolution":{"observed_at":"2026-08-10T19:44:13.748895Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.724200Z","title":"On a class of error correcting binary group codes,","venue":null,"work_id":"73a005df-c16c-4d41-9189-e4c2937da972","year":1960},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.368798Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:b458d7b0c04ba0532e388adfcaef31f9e33072c4fdf6342885af8adef87f2cba","observation_id":"3e236b9a-8091-4dfe-baf2-abd1c302c5e8","resolution":{"observed_at":"2026-08-10T19:44:13.730640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.374962Z","title":"Codes correcteurs d’erreurs,","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.374962Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:f2337d0c97676007b6e685361f1379801c7059b8acdea1cbcd046afcedc01b5f","observation_id":"df21fc14-9397-43f9-bb75-4e3eb279a41a","resolution":{"observed_at":"2026-08-10T19:44:13.374962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.692534Z","title":"Entanglement-assisted quantum codes from cyclic codes,","venue":null,"work_id":"caef72a3-d93b-4c40-b024-30fc2c12ae32","year":2022},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.382202Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:5a2f9367ab72dc611375dce0681f6494010201de70ffe0965483857afa998d6a","observation_id":"f3556c26-1a7f-40bb-b395-b2c7fbdaa4d2","resolution":{"observed_at":"2026-08-10T19:44:13.698690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.672972Z","title":"The condition for a cyclic code to have a complementary dual,","venue":null,"work_id":"850e78c0-7462-400c-8c02-bada1074c539","year":1994},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.389153Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:7327ffea380cf0d56e73792b2afc48794ebf68840cbbd07178286d477f24cbea","observation_id":"7203e82b-bded-45a7-b2a8-8e943ca004f6","resolution":{"observed_at":"2026-08-10T19:44:13.678747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.656029Z","title":"On cyclic lrc codes that are also lcd codes,","venue":null,"work_id":"c1e41a5e-5372-4d5e-90fc-a6c4f063539c","year":2020},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.395882Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:84af7662a2145f1e868750e234aa58e17fe8c8a7153eeee004e889c51566b7af","observation_id":"9013d4fe-df00-41fc-ad6b-ed274371713c","resolution":{"observed_at":"2026-08-10T19:44:13.662049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.638397Z","title":"Constructions of good entanglement-assisted quantum error correcting codes,","venue":null,"work_id":"4a5f4079-0ceb-48ce-a2d6-09b7b49771c2","year":2018},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.401189Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:3a9f2165ed49151f0a49e3cddca8c8a053f8f5448f53f6c466ee3fea4e53f5f0","observation_id":"ebc4ee65-71d0-4b21-863d-ae71f0ca302a","resolution":{"observed_at":"2026-08-10T19:44:13.643665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:44:13.620528Z","title":"Linear codes overF q are equivalent to LCD codes forq >3,","venue":null,"work_id":"ba087dd2-9601-4b19-b58e-f4d0b5306f69","year":2018},"citing_paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T19:44:13.407355Z"},"links":{"citing_paper":"/paper/2608.06854"},"observation_digest":"sha256:181a1ec9a6892c11506ccaafe73f482e7e731e88277ea6eb0d32335746c073d2","observation_id":"81a65c55-c5db-4f5c-ab0d-19b0dfa0a8a7","resolution":{"observed_at":"2026-08-10T19:44:13.626659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.06854","last_updated":"2026-08-07T06:26:28Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-12T23:11:25.006522Z","submitted_at":"2026-08-07T06:26:28Z","title":"Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":25},"total_outbound_references":35},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2608.06854."}