{"as_of":"2026-08-17T13:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e34636f6f2b197e66a097873908a4592cc8d598b4aa6a06cca652e9dc966d6b1","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:07:01.193356Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2505.05935/citation-record","integrity":"/paper/2505.05935/integrity","json":"/paper/2505.05935/citation-record.json","paper":"/paper/2505.05935"},"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-15T23:07:01.802852Z","title":"Near-optimal erasure list-decodable codes","venue":null,"work_id":"15decddb-8713-4588-8359-e6c9f2ecc86f","year":2020},"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":1,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.035999Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:f257a1d3f70d7a16dcddd2def4618eaa90a26323568edb7b3c7fb3d4c606ee42","observation_id":"c0c93217-2cf6-4ea8-9b6a-c63d95146321","resolution":{"observed_at":"2026-08-15T23:07:01.807002Z","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-15T23:07:01.791835Z","title":"Cover and Joy A","venue":null,"work_id":"09ef8e63-e18b-45e4-9ab1-9c162771c04c","year":2006},"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":2,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.040471Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:e168048ec3c01406837c22488415c049a4f1a1e1761b4bc98afcfbbb355cea6a","observation_id":"9659e5e4-8f85-4698-83c2-9e1d4422c887","resolution":{"observed_at":"2026-08-15T23:07:01.795656Z","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-15T23:07:01.044420Z","title":"Explicit folded Reed-Solomon and multiplicity codes achieve relaxed generalized Singleton bounds, 2024","venue":null,"work_id":null,"year":2024},"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":3,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.044420Z"},"links":{"cited_paper":"/paper/2408.15925","citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:ac21e25173302e1f8c2de2c45dbe31d55e696594f09ba8dd6a36aaf71fac7ede","observation_id":"dcb622d1-7dc9-4220-bd86-8520a492812f","resolution":{"observed_at":"2026-08-15T23:07:01.044420Z","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-15T23:07:01.780438Z","title":"Nearly optimal pseudorandomness from hardness","venue":null,"work_id":"f1370919-9116-4f91-929e-f6d947c30bff","year":2022},"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":4,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.050433Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:9dae93aa45169db7f253af54d7b0cd3cc78b7880b8f98b8e9da0ad7d1c2b5151","observation_id":"b0f52b07-57a9-4676-8885-42eb32b883df","resolution":{"observed_at":"2026-08-15T23:07:01.784410Z","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-15T23:07:01.768066Z","title":"High-probability list-recovery, and applications to heavy hitters","venue":null,"work_id":"676add85-27a2-4d78-a43f-3af483648383","year":2022},"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":5,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.054065Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:468c4baff8742ee622b7fe83bed0811aa7cc4c6b4d93fa7342c8e1f0700ba343","observation_id":"02f4d084-6302-47b0-9d1f-869ee8ab8304","resolution":{"observed_at":"2026-08-15T23:07:01.772796Z","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-15T23:07:01.755116Z","title":"List decoding for noisy channels, 1957","venue":null,"work_id":"bd547d24-20c4-4d86-ba13-cdf51aded0b5","year":1957},"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":6,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.058293Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:946b19a3e73efff2ae7f30bf452e8616af6d4605c3efcaaa78c9d9c9f6204ad5","observation_id":"acce1a0d-8bf0-4791-9572-0f215ad227fe","resolution":{"observed_at":"2026-08-15T23:07:01.760130Z","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-15T23:07:01.741508Z","title":"On the list-decodability of random linear codes","venue":null,"work_id":"39bb9999-8292-4cb4-8970-e0195358b6b4","year":2011},"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":7,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.062455Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:25ee9bf27a1e5dcacef5b30585bd71d0cee2754c63adedbb854418e2c7ded3e5","observation_id":"095d7302-25a3-4c5f-aa2c-4c6ca5b54e5a","resolution":{"observed_at":"2026-08-15T23:07:01.746969Z","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-15T23:07:01.728455Z","title":"Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets","venue":null,"work_id":"45cd9bae-2a93-4afb-ba89-b4821092c7fc","year":2002},"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":8,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.066510Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:1f71ef396495e008034b993a20ea7cd0d5e0e8d8660ba67638e691de39bb086f","observation_id":"a1bf28b3-ce9a-4ac9-bd55-895251822f21","resolution":{"observed_at":"2026-08-15T23:07:01.732552Z","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-15T23:07:01.714918Z","title":"Linear time encodable and list decodable codes","venue":null,"work_id":"a10cbd8e-e1b5-4708-a722-842744e333e0","year":2003},"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":9,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.070143Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:5c69e864e52c1ca9e26432135e5117e6e09e2dea495077526e19a75feb100b9a","observation_id":"ca206c90-7ae3-4526-8630-c751ed217160","resolution":{"observed_at":"2026-08-15T23:07:01.719313Z","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-15T23:07:01.702434Z","title":"Efficiently decodable codes meeting G ilbert- V arshamov bound for low rates","venue":null,"work_id":"60a9d467-9c27-4e10-a785-6e0534a6c3b5","year":2004},"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":10,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.073859Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:1b370e82e23ef88acda04bfd8dd7024ba0666df6f29f6d43ffb5a67213956e03","observation_id":"124913fc-1619-4f54-94ca-81c9082d5106","resolution":{"observed_at":"2026-08-15T23:07:01.706615Z","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-15T23:07:01.690289Z","title":"Linear-time encodable/decodable codes with near-optimal rate","venue":null,"work_id":"a9033289-6bfb-4d51-90f7-d75091e2df07","year":2005},"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":11,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.077482Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:44bb44b5eb2a5172fc0f746652976adf9355667812c237d543e82b4478523f88","observation_id":"d95511c1-47a3-4ca8-a035-31a64f33b30e","resolution":{"observed_at":"2026-08-15T23:07:01.694601Z","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-15T23:07:01.677884Z","title":"Locally testable and locally correctable codes approaching the Gilbert-Varshamov bound","venue":null,"work_id":"fe17bc53-3bf7-44a8-a5ba-3aeba694ca1d","year":2018},"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":12,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.081380Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:9e13b304b00dd1ad6760a9803d12bf0c6b58095586bc85b22c8dc3fdc90862e2","observation_id":"d3493de9-1b00-45d6-933c-41f8493e73eb","resolution":{"observed_at":"2026-08-15T23:07:01.682333Z","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-15T23:07:01.661931Z","title":"Bounds for list-decoding and list-recovery of random linear codes","venue":null,"work_id":"70332a7b-890f-41b7-9f25-caf8c815ad5c","year":2022},"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":13,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.085112Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:5f8f93f53c2cf5fb7af925b9e9752c843361fd553a103cce550d6b5fcbecb760","observation_id":"20b35a14-50db-4bfa-aa5a-80dbc8e2d73d","resolution":{"observed_at":"2026-08-15T23:07:01.668652Z","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-15T23:07:01.649111Z","title":"Gilbert, Yi Li, Ely Porat, and Martin J","venue":null,"work_id":"65473652-d5be-4b2c-b397-6ed3e0bc6d65","year":2017},"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":14,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.088589Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:a5f9e69da808f5d4e9a765a68f7925c2e9129c9213a377f5850f8ab702e0922d","observation_id":"19ae1f99-a82c-4c0b-a014-925bc72d2a0c","resolution":{"observed_at":"2026-08-15T23:07:01.653709Z","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-15T23:07:01.636648Z","title":"Improved list-decodability and list-recoverability of Reed-Solomon codes via tree packings","venue":null,"work_id":"f6e58926-3ded-4e9e-837f-92ca5fdf0d72","year":2021},"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":15,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.092200Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:d2b34a7fe3504bdd0b7989c8161322ac3013c2c01fccb8357e8c683296f85abe","observation_id":"36404740-4163-4032-8dfe-ca7228cd219a","resolution":{"observed_at":"2026-08-15T23:07:01.641039Z","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-15T23:07:01.623582Z","title":"On the list-decodability of random linear rank-metric codes","venue":null,"work_id":"0016d038-1204-4ec9-9c04-6dcdb29568e7","year":2018},"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":16,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.095875Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:340cc063ddb23207605a9f2235cb49645844bccf31ff7f63561642391930c699","observation_id":"620b0056-63b3-417d-b8aa-cc61736b45fa","resolution":{"observed_at":"2026-08-15T23:07:01.628148Z","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-15T23:07:01.606900Z","title":"Singleton-type bounds for list-decoding and list-recovery, and related results","venue":null,"work_id":"f85891b5-32c4-4cda-a135-ea0f84f17ce4","year":2022},"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":17,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.099579Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:09c4dab8d76fbcfdaf9cab94ea87ec93c89e1b0bf65b7b68b8cf42b6717ee777","observation_id":"cb58a368-2de4-41b5-96eb-0da5debc62d6","resolution":{"observed_at":"2026-08-15T23:07:01.611626Z","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-15T23:07:01.593047Z","title":"List decoding from erasures: Bounds and code constructions","venue":null,"work_id":"22ed60cd-7a9d-4c8f-96cc-daa20a7af204","year":2003},"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":18,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.103640Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:ab2ad43d6707591211a80ba8abfdf2b7dbd349cb8d7003d25adba71f382a8e95","observation_id":"0c3b9739-7430-4b78-8fc6-2ccba6fee014","resolution":{"observed_at":"2026-08-15T23:07:01.597736Z","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-15T23:07:01.580548Z","title":null,"venue":null,"work_id":"de879b5a-aa77-490f-9481-b43adf44e3b3","year":2009},"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":19,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.107292Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:5ac443b45185785e3cfacb2a69d6887fdde0cd1c5e5e6b052886083b2ef511c5","observation_id":"bd7d6254-7700-4fa0-9b6f-653b481aae51","resolution":{"observed_at":"2026-08-15T23:07:01.584777Z","resolver_source":"raw_fallback","status":"unresolved"},"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-15T23:07:01.567637Z","title":"Parallel hashing via list recoverability","venue":null,"work_id":"a2752134-fc97-45d8-b5fb-917c59138cd5","year":2015},"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":20,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.111328Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:6eefa39927c3903ac013f8fcd038e1b1fef2a936e04aed2673e4ea356db85cd8","observation_id":"c8f41cba-5804-4e87-9d7c-b4f90cf6ea8d","resolution":{"observed_at":"2026-08-15T23:07:01.572247Z","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-15T23:07:01.555150Z","title":"Rothblum","venue":null,"work_id":"fb7c6e5c-fb9c-4290-97dc-b311071e6cad","year":2021},"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":21,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.115125Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:ea11598af5268db72a9b453929d0ee530e8d504cf2e7be4814d292a965ae828d","observation_id":"48219240-b5df-48e4-b79f-4bcf2ade8e40","resolution":{"observed_at":"2026-08-15T23:07:01.559326Z","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-15T23:07:01.542134Z","title":"Local list recovery of high-rate tensor codes and applications","venue":null,"work_id":"edec2288-dc38-45be-839b-d0db09aef321","year":2020},"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":22,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.118681Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:1df696c1275a740b890c306953e3e3521431f5045e7fbde549ffa4cc9d931135","observation_id":"0e26b3e1-bdfb-474a-9745-29d58896c4a4","resolution":{"observed_at":"2026-08-15T23:07:01.546786Z","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-15T23:07:01.528403Z","title":"Efficiently decodable non-adaptive group testing","venue":null,"work_id":"5ab41091-c283-4e24-985e-430f68fd7934","year":2010},"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":23,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.122153Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:44d993f75a99f388e54bd948006a01477c5e75d4290cd6be9982145a56c0d2e4","observation_id":"b19c6fff-46c4-415e-ab7b-84aa60e9dd82","resolution":{"observed_at":"2026-08-15T23:07:01.533014Z","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":"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:07:01.514943Z","title":"High-rate locally correctable and locally testable codes with sub-polynomial query complexity","venue":null,"work_id":"ac235e0c-29b0-471b-b804-02247249c973","year":2017},"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":25,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.130939Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:ca7e5852bbcafd2fb1a5b635a0e681065d38e85bed43a7841054e266cb06b867","observation_id":"f9b4d849-5441-4192-bf33-cc0b103de0aa","resolution":{"observed_at":"2026-08-15T23:07:01.519386Z","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-15T23:07:01.501579Z","title":"Improved decoding of folded Reed-Solomon and multiplicity codes","venue":null,"work_id":"d44a617c-0504-483d-8bad-da67e0ea8628","year":2018},"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":26,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.134695Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:88015a9ef4883656b143fc5f415569bb3f81ba11f0cbe8071f1ea39197fd3084","observation_id":"30181aeb-c7bf-4f3e-90b0-54919f3e76a4","resolution":{"observed_at":"2026-08-15T23:07:01.505840Z","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-15T23:07:01.489220Z","title":"Unbalanced expanders from multiplicity codes","venue":null,"work_id":"1ee84d66-4fa2-4580-b52f-69c882a10bf9","year":2022},"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":27,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.138539Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:2b413dd55310397d9b9a100515d26ec82a9cf982c3653c214020728d91988ecb","observation_id":"86cb97ca-0e88-4942-a4d2-e1ca2cd63d06","resolution":{"observed_at":"2026-08-15T23:07:01.493187Z","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-15T23:07:01.476865Z","title":null,"venue":null,"work_id":"638fd773-ff24-437e-b256-6a49b2c4daf2","year":2001},"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":28,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.142794Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:c65f6bbd0c9f33e6dee4709902e94950874a68572b6fff6aa06c3152c9d07a4f","observation_id":"ce0f5dbf-9acf-4a06-beca-9098fde606f7","resolution":{"observed_at":"2026-08-15T23:07:01.480804Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:07:01.146486Z","title":"Random Reed-Solomon codes and random linear codes are locally equivalent, 2024","venue":null,"work_id":null,"year":2024},"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":29,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.146486Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:47827201e12beea0211b79c831f664d559f28b9b7f7e0235f82d37e302f5e9e5","observation_id":"b7330a30-21fc-4fa1-8d83-344ad4e78683","resolution":{"observed_at":"2026-08-15T23:07:01.146486Z","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-15T23:07:01.463868Z","title":"Nguyen, and Mikkel Thorup","venue":null,"work_id":"dca0fd6f-a835-4ca6-b597-f98daa7e74cd","year":2016},"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":30,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.149947Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:a2af537e5bca8f8fb09844589b88ee5aa3ab9233565955ff403eedebc4829249","observation_id":"21c5f1cf-7e94-43da-bbfc-53b2879ee713","resolution":{"observed_at":"2026-08-15T23:07:01.467749Z","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-15T23:07:01.452786Z","title":"On the list recoverability of randomly punctured codes","venue":null,"work_id":"4b3922eb-6549-4f67-b7d3-2201f2be9ae7","year":2020},"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":31,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.153939Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:6089c063cebca990ab2e812dfb25970a11b6d0e000fd7bc20e63c51cc980c8c8","observation_id":"c5770377-03df-49b0-9af0-79173c69c28d","resolution":{"observed_at":"2026-08-15T23:07:01.456818Z","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":"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13877","snapshot_observed_at":"2026-08-15T23:07:01.157645Z","title":"Near-optimal list-recovery of linear code families, 2025","venue":null,"work_id":null,"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":32,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.157645Z"},"links":{"cited_paper":"/paper/2502.13877","citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:968e3d2aff8dda083bdc64040a2eaddb4f511fa77b8f1bd11bef0873ebf88a5a","observation_id":"6de8bfba-123e-4333-86a6-32b0d4923005","resolution":{"observed_at":"2026-08-15T23:07:01.157645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.11533","snapshot_observed_at":"2026-08-15T23:07:01.161468Z","title":"Randomness-efficient constructions of capacity-achieving list-decodable codes, 2024","venue":null,"work_id":null,"year":2024},"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":33,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.161468Z"},"links":{"cited_paper":"/paper/2402.11533","citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:6d971f4691562c194db2627e74787141b9efd06eaf9a1b568522fd08b4fca217","observation_id":"3c3c92fa-575a-4aee-b20a-1be400784f46","resolution":{"observed_at":"2026-08-15T23:07:01.161468Z","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-15T23:07:01.439757Z","title":"Efficiently decodable error-correcting list disjunct matrices and applications","venue":null,"work_id":"df467b1e-0531-4947-98b7-a0475e89a8d8","year":2011},"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":34,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.165771Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:c47f39637ef6d4f19c3543aeb9a4e752ad3e76b42da988327525a46b9eb1ca11","observation_id":"23259d41-0eaf-4d47-8f82-e690c0411e27","resolution":{"observed_at":"2026-08-15T23:07:01.444329Z","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-15T23:07:01.427104Z","title":"List-Decodable Codes: (Randomized) Constructions and Applications","venue":null,"work_id":"c2c78673-c0f4-414e-bdd0-0d9e117131e4","year":2020},"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":35,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.169281Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:44c82583ab7a434c69f03092749e67397a2e18f91023178591a0756f14f5020d","observation_id":"22541525-17b1-4f8a-b8b6-022b31ae6905","resolution":{"observed_at":"2026-08-15T23:07:01.431315Z","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-15T23:07:01.414364Z","title":"Every list-decodable code for high noise has abundant near-optimal rate puncturings","venue":null,"work_id":"0f0d2090-b042-4a2e-af43-69e2702e7a21","year":2014},"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":36,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.173314Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:66fb14dcebea5bde0fbb3d802c09ebececd4eedddc75915219e29988f770ea54","observation_id":"60883bac-9a62-4c6b-b017-48c6a951f464","resolution":{"observed_at":"2026-08-15T23:07:01.418866Z","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-15T23:07:01.400615Z","title":"Average-radius list-recoverability of random linear codes","venue":null,"work_id":"ba4210e2-71d5-43c2-9d6c-f4e07da76561","year":2018},"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":37,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.177282Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:a9ce4602b1f44524aead536e1d23ffe0b77e19335ad8b0770158465b21e64974","observation_id":"3f5111fb-39ae-48e7-90a8-ccf215b446b5","resolution":{"observed_at":"2026-08-15T23:07:01.405123Z","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-15T23:07:01.387727Z","title":"Tighter list-size bounds for list-decoding and recovery of folded Reed-Solomon and multiplicity codes","venue":null,"work_id":"37c1f081-d83a-4f35-813f-aa63aa741906","year":2024},"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":38,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.180811Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:f60d880638722487621d87bffc3c9f5d249b6a6a06b676ef75130654ca2bf046","observation_id":"4ea2b0eb-691d-4f5c-a336-5e23d408372d","resolution":{"observed_at":"2026-08-15T23:07:01.391707Z","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-15T23:07:01.375655Z","title":"Extractor codes","venue":null,"work_id":"c62c9b3c-3816-42b4-8a84-11ea1f42bce5","year":2004},"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":39,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.184805Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:7ed7abe69152ae638c5b1cadc1f771b1f0456a4035f5bc2dd68e32343f9a7579","observation_id":"9ac2a923-51ac-4cb7-8348-f79580473955","resolution":{"observed_at":"2026-08-15T23:07:01.379836Z","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-15T23:07:01.363265Z","title":"Sequential Decoding","venue":null,"work_id":"11c0ae77-3239-436e-8ba8-8f1e19e70733","year":1961},"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":40,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.189706Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:a9be7956acd8d20b2631d2b98d6412da11cb070fb3f44d8e62bf59db1fe6567c","observation_id":"3e6bf818-4f92-41d6-960d-bc5a6afc2471","resolution":{"observed_at":"2026-08-15T23:07:01.367452Z","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-15T23:07:01.350821Z","title":"List concatenated decoding","venue":null,"work_id":"69dc819d-d6a5-49fa-af89-a3adb1192512","year":1981},"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":41,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.193356Z"},"links":{"citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:2dc969fa206418abc05ea5a19c89e9a39140099f134e32f70eb9c2c471dd8d14","observation_id":"fc7d948e-bc63-420d-be39-62f686b10cf4","resolution":{"observed_at":"2026-08-15T23:07:01.355022Z","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"}}],"paper":{"arxiv_id":"2505.05935","last_updated":"2025-05-09T10:26:12Z","latest_version":1,"primary_category":"cs.IT","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"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":34},"total_outbound_references":41},"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 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2505.05935."}