{"as_of":"2026-08-17T12:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e8f6461919986367a8d1b69d911ff3a6d2f9336f219b8d080e9cbabce44f778b","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":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:07:01.126629Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T23:07:01.320584Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"2502.05858","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.05858","snapshot_observed_at":"2026-08-15T23:07:01.320584Z","title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes","venue":"cs.IT","work_id":"811f5ede-554e-42d9-b434-f55a86744d66","year":2025},"citing_paper":{"arxiv_id":"2505.05935","last_updated":"2025-05-09T10:26:12Z","snapshot_observed_at":"2026-08-17T05:01:02.807040Z","submitted_at":"2025-05-09T10:26:12Z","title":"List-Recovery of Random Linear Codes over Small Fields","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.126629Z"},"links":{"cited_paper":"/paper/2502.05858","citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:ac70b5cc0487450a8d09f7678af826c9b1590dfb838eb56239b450cb93bb03df","observation_id":"b294736a-35c9-47ff-8a59-ea2921a25ad2","resolution":{"observed_at":"2026-08-15T23:07:01.328094Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"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:11418703cb764baa92445f305849986aeab7bdf2e192578ee19ab7c1cfcd7f11","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T14:17:37.895861Z","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:49d657f7428f7bd952a9b73d22263d988a3569ca2e7aa66376a22592bd414a31","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T14:31:08.550052Z","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:96a0c01afe75fceceef5ebfec2161501d472490495d0c2f2a37a530d86600e5f","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:531a72cbddee4caeb99bdc897c3731645476bb3c5b035123ecf3b9415b90a003","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:f517ba01fabd7592fecc7ee9258e972f7973b237c6d647fcd287e7acd859fa7e","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:775b02acb8d30d0fa90d8bd01376a436550996274d600f38f3212add1b1b1f20","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:7b69c83b56c3d6ae23cd1b5d155954eb0be97febf1f496bf632cc74af21f4e31","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T13:23:09.380059Z","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:c74e69cd058a2f0c63e90defbe6b55c221de043f6ed288114918c803bedc6c6b","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-16T12:56:55.808876Z","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:8ed1f2f4bfa207554ec8ef8e5582e90f02ce938e9df5d4ad26a7d67161694a65","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:d41feaf9439b0f4f4cb13b381157636f34179c4ab9e37277e531a9ec0672e78d","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 1 inbound Pith citation observation for arXiv:2502.05858."}