{"as_of":"2026-08-14T21:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dc3b4cb1eb13e4bfe9fd076950bb47e781db67b858b0a5ee4201f4f50c2f5e33","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T17:54:42.181686Z","state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2502.05858/citation-record","integrity":"/paper/2502.05858/integrity","json":"/paper/2502.05858/citation-record.json","paper":"/paper/2502.05858"},"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-08T17:54:42.495134Z","title":"Almost K-Wise vs. k-Wi se Independent Permuta- tions, and Uniformity for General Group Actions","venue":null,"work_id":"fbfa646b-6488-464d-a997-30cfeeaa8211","year":2013},"citing_paper":{"arxiv_id":"2502.05858","last_updated":"2025-05-08T19:26:25Z","snapshot_observed_at":"2026-08-14T03:00:47.861872Z","submitted_at":"2025-02-09T11:34:54Z","title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T17:54:42.148311Z"},"links":{"citing_paper":"/paper/2502.05858"},"observation_digest":"sha256:83fe9fdf439f89e84bff1133bde751f59a5a520f9c69ed98f5e981d8a8d2862b","observation_id":"dc7acaed-6348-419f-9757-995e0d0a91aa","resolution":{"observed_at":"2026-08-08T17:54:42.498399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.11533","last_updated":"2024-05-15T14:32:09Z","snapshot_observed_at":"2026-08-14T19:15:22.385719Z","submitted_at":"2024-02-18T10:11:46Z","title":"Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes","version":2},"cited_work":{"arxiv_id":"2402.11533","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.11533","snapshot_observed_at":"2026-08-08T17:54:42.233218Z","title":"Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes","venue":"cs.IT","work_id":"0ff4287f-8bc0-4f51-8d74-14592ce41364","year":2024},"citing_paper":{"arxiv_id":"2502.05858","last_updated":"2025-05-08T19:26:25Z","snapshot_observed_at":"2026-08-14T03:00:47.861872Z","submitted_at":"2025-02-09T11:34:54Z","title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T17:54:42.174754Z"},"links":{"cited_paper":"/paper/2402.11533","citing_paper":"/paper/2502.05858"},"observation_digest":"sha256:e5486370bf44c23500913e3f07a258ec90f040b8f71255d959c8468d5ec95729","observation_id":"93339f28-b46e-4ceb-9bd5-7230c664c436","resolution":{"observed_at":"2026-08-08T17:54:42.237222Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.17097","last_updated":"2023-12-28T16:20:17Z","snapshot_observed_at":"2026-08-14T09:41:18.947468Z","submitted_at":"2023-12-28T16:20:17Z","title":"Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes","version":1},"cited_work":{"arxiv_id":"2312.17097","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.17097","snapshot_observed_at":"2026-08-08T17:54:42.216969Z","title":"Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes","venue":"cs.IT","work_id":"f52247cb-ab0a-4340-9b03-07ede9d8f39f","year":2023},"citing_paper":{"arxiv_id":"2502.05858","last_updated":"2025-05-08T19:26:25Z","snapshot_observed_at":"2026-08-14T03:00:47.861872Z","submitted_at":"2025-02-09T11:34:54Z","title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T17:54:42.181686Z"},"links":{"cited_paper":"/paper/2312.17097","citing_paper":"/paper/2502.05858"},"observation_digest":"sha256:dd41b95d096ebead23b228a84678907166c6e26f9de12360549d25f7728ca121","observation_id":"bac82d7d-c843-4c57-a673-b0ffbc68de32","resolution":{"observed_at":"2026-08-08T17:54:42.221914Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T17:54:42.484542Z","title":"Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Z entrum f¨ ur Informatik, 2022, 55:1–55:17","venue":null,"work_id":"abbdf747-2d17-47c2-bbc4-6fdcde5967cc","year":2022},"citing_paper":{"arxiv_id":"2502.05858","last_updated":"2025-05-08T19:26:25Z","snapshot_observed_at":"2026-08-14T03:00:47.861872Z","submitted_at":"2025-02-09T11:34:54Z","title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes","version":2},"reference_index":229,"source":"pdf_text","source_observed_at":"2026-08-08T17:54:42.155473Z"},"links":{"citing_paper":"/paper/2502.05858"},"observation_digest":"sha256:b4b0ae906265f97bdbded219416204a06aa22dc48e043ee9eb0821e90e13dc1c","observation_id":"5da12eac-ee59-4172-9247-8b16d17c705a","resolution":{"observed_at":"2026-08-08T17:54:42.487564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T17:54:42.463698Z","title":"ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk","venue":null,"work_id":"e08d75a9-a19d-42bd-af91-cd38bd232662","year":2008},"citing_paper":{"arxiv_id":"2502.05858","last_updated":"2025-05-08T19:26:25Z","snapshot_observed_at":"2026-08-14T03:00:47.861872Z","submitted_at":"2025-02-09T11:34:54Z","title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes","version":2},"reference_index":234,"source":"pdf_text","source_observed_at":"2026-08-08T17:54:42.161709Z"},"links":{"citing_paper":"/paper/2502.05858"},"observation_digest":"sha256:35f961591fd0cff3b5a6bb3928c2ec02027063041bda97df3c1356f0a38d6dc1","observation_id":"6b711581-107d-4b28-9a57-e528841e006c","resolution":{"observed_at":"2026-08-08T17:54:42.466839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-58737-5_11","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"doi: 10.1007/978-3-031-58737-5_11","venue":"Lecture notes in computer science","work_id":"cc0f79f8-8bad-4e9e-a418-f8d885398058","year":null},"citing_paper":{"arxiv_id":"2502.05858","last_updated":"2025-05-08T19:26:25Z","snapshot_observed_at":"2026-08-14T03:00:47.861872Z","submitted_at":"2025-02-09T11:34:54Z","title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes","version":2},"reference_index":315,"source":"pdf_text","source_observed_at":"2026-08-08T17:54:42.171824Z"},"links":{"citing_paper":"/paper/2502.05858"},"observation_digest":"sha256:362a50434d9353391dfbd12e7b43958ea015bb8a96511c71702fd90fa3abc48b","observation_id":"bbd135c8-9618-42cc-86cd-b16de3388963","resolution":{"observed_at":"2026-08-08T17:54:42.205309Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T17:54:42.473971Z","title":"On the List-Decodability of Random Linear Codes","venue":null,"work_id":"77ebf46a-1ce4-44e5-bd90-19e09ba0fb79","year":2011},"citing_paper":{"arxiv_id":"2502.05858","last_updated":"2025-05-08T19:26:25Z","snapshot_observed_at":"2026-08-14T03:00:47.861872Z","submitted_at":"2025-02-09T11:34:54Z","title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes","version":2},"reference_index":1957,"source":"pdf_text","source_observed_at":"2026-08-08T17:54:42.158527Z"},"links":{"citing_paper":"/paper/2502.05858"},"observation_digest":"sha256:13fbdacdd88fea91d87e79945f03f523a328da31fdcd61d3589fdf35bc1df499","observation_id":"f92542ae-67eb-40b3-9498-e33d9c9e6b2a","resolution":{"observed_at":"2026-08-08T17:54:42.477296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15925","last_updated":"2025-04-14T04:26:07Z","snapshot_observed_at":"2026-08-12T22:55:46.086122Z","submitted_at":"2024-08-28T16:39:58Z","title":"Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15925","snapshot_observed_at":"2026-08-08T17:54:42.151739Z","title":"High-Probability Lis t-Recovery, and Applica- tions to Heavy Hitters","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05858","last_updated":"2025-05-08T19:26:25Z","snapshot_observed_at":"2026-08-14T03:00:47.861872Z","submitted_at":"2025-02-09T11:34:54Z","title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-08T17:54:42.151739Z"},"links":{"cited_paper":"/paper/2408.15925","citing_paper":"/paper/2502.05858"},"observation_digest":"sha256:a375f9c279057a933251b5df73d2fc062b0e45e652389085806c40e228aa2611","observation_id":"67930a5c-c08f-4b87-8e9e-b9088da619ee","resolution":{"observed_at":"2026-08-08T17:54:42.151739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13877","last_updated":"2025-02-27T19:23:37Z","snapshot_observed_at":"2026-08-14T07:04:28.639562Z","submitted_at":"2025-02-19T17:02:36Z","title":"Near-Optimal List-Recovery of Linear Code Families","version":2},"cited_work":{"arxiv_id":"2502.13877","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.13877","snapshot_observed_at":"2026-08-08T17:54:42.248728Z","title":"Near-Optimal List-Recovery of Linear Code Families","venue":"cs.IT","work_id":"9f94dbee-d2cd-4cb1-87da-852a8c9cfa2d","year":2025},"citing_paper":{"arxiv_id":"2502.05858","last_updated":"2025-05-08T19:26:25Z","snapshot_observed_at":"2026-08-14T03:00:47.861872Z","submitted_at":"2025-02-09T11:34:54Z","title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-08T17:54:42.168427Z"},"links":{"cited_paper":"/paper/2502.13877","citing_paper":"/paper/2502.05858"},"observation_digest":"sha256:9b5642f9b54298d8d09e60bf6fbf82d2378a51b1fe639cb618225c5d69a948c1","observation_id":"32a73985-d623-4745-be06-47333123db6e","resolution":{"observed_at":"2026-08-08T17:54:42.252837Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2406.02238","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:54:42.441525Z","title":"Local List Recovery of High- Rate Tensor Codes and Applications","venue":null,"work_id":"6529eca3-5ceb-4297-b7d2-e282f3c881af","year":2024},"citing_paper":{"arxiv_id":"2502.05858","last_updated":"2025-05-08T19:26:25Z","snapshot_observed_at":"2026-08-14T03:00:47.861872Z","submitted_at":"2025-02-09T11:34:54Z","title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes","version":2},"reference_index":3268,"source":"pdf_text","source_observed_at":"2026-08-08T17:54:42.165453Z"},"links":{"citing_paper":"/paper/2502.05858"},"observation_digest":"sha256:e3fe8db75276e79b90be8ed8ff6610f1c3ea9922d6ef4a688f20a0f5c6391a23","observation_id":"5a82355c-0a79-4b32-9de2-7e0708456084","resolution":{"observed_at":"2026-08-08T17:54:42.446389Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.05858","last_updated":"2025-05-08T19:26:25Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T03:00:47.861872Z","submitted_at":"2025-02-09T11:34:54Z","title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":1,"verified_exact":4,"verified_fuzzy":4},"total_outbound_references":10},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 0 inbound Pith citation observations for arXiv:2502.05858."}