{"as_of":"2026-08-18T09:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bd46fa68add5725aa4350c8b10d39b06f5162202710bfef5dbf666aadd507222","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:58:05.922659Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2506.15233/citation-record","integrity":"/paper/2506.15233/integrity","json":"/paper/2506.15233/citation-record.json","paper":"/paper/2506.15233"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:58:05.753931Z","title":"Network Information Flow,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.753931Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:d141c8663ab80dd3d417acec724b11a73fe2cf8003b8325c55880a750aed5cdd","observation_id":"c2e07712-21d3-4ffa-aa3f-510bbc920f9f","resolution":{"observed_at":"2026-08-15T19:58:05.753931Z","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-15T19:58:06.485411Z","title":"Network Coding and Error Correction,","venue":null,"work_id":"8ef271c8-31ac-4d1d-82d7-97d2431b08ec","year":2002},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.759669Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:579c1ba5ea7d289c2eb497e0f83b1d20436800cc759309d4457b20d0d6e7be2b","observation_id":"8258b735-760a-4b20-be0e-8ef906c0bb71","resolution":{"observed_at":"2026-08-15T19:58:06.490074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.471184Z","title":"Network Error Correction, I: Basic Concepts and Upper Bounds,","venue":null,"work_id":"7e1b2c83-0747-48bc-a9de-e81b45e8a4e5","year":2006},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.764329Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:ab1f3629889e78ee65ec0beee95accc809e59069f7df95f7834af31c44a433a8","observation_id":"32613277-065c-497e-a566-0c90b2d8e72a","resolution":{"observed_at":"2026-08-15T19:58:06.475826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.456305Z","title":"Network Error Correction, II: Lower Bounds,","venue":null,"work_id":"58626881-e2d7-4d2f-bd78-b4a410aa2898","year":2006},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.769031Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:b1afb35901dc23bb6d09752cd9f920597f681b7dfba81932576de5cc0f45b70b","observation_id":"ed5e9c62-a764-4616-93cc-2bd970058bdf","resolution":{"observed_at":"2026-08-15T19:58:06.461019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.442026Z","title":"Network Codes Resilient to Jamming and Eavesdropping,","venue":null,"work_id":"999d6e11-e8fc-4658-ba7f-01761d9d038a","year":1978},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.774272Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:14a86914adacd1c55891b5a0f078f1454c7ab16a09b26beb51c94a97b2a4c24e","observation_id":"e01661da-0dbe-4d46-b313-86e363c35aba","resolution":{"observed_at":"2026-08-15T19:58:06.446562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.427262Z","title":"Network Coding Theory: A Survey,","venue":null,"work_id":"231c14e7-78ec-468d-bac8-fc4b85749f2c","year":1950},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.778963Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:369c52f6f72172ff0a4cb620ade40fae200913070e16e309c6a1a6c96428a9f1","observation_id":"4c3cc260-3ceb-4d28-ba71-18df7c035528","resolution":{"observed_at":"2026-08-15T19:58:06.432208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.412198Z","title":"Coding for the Large-Alphabet Adversarial Channel,","venue":null,"work_id":"1674fad4-7551-4475-94a0-9b14140306c1","year":2017},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.783978Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:b5e6132d0ec6f762ac1d89bddec102964e56cd7146db5c7c85404be1a2bfdfd0","observation_id":"028e7668-27ba-466e-8c9c-81382e0f2e61","resolution":{"observed_at":"2026-08-15T19:58:06.417243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.397592Z","title":"Variable Packet-Error Coding,","venue":null,"work_id":"73d781e7-676f-4b29-b9b7-fdfeb285fc7c","year":2018},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.788558Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:82b4d12dd0a1ce4cf057e22992dbc0e26e79a855c2caac475fd9b1ac9d494247","observation_id":"c6789ce6-bb22-4c18-bee5-6f4fd704cb11","resolution":{"observed_at":"2026-08-15T19:58:06.402186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.382801Z","title":"Cluster Storage Systems Gotta Have HeART: Improving Storage Efficiency by Exploiting Disk-Reliability Heterogeneity,","venue":null,"work_id":"d7c6d8d9-38bb-453e-b26b-670482c0c836","year":2019},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.793211Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:e4504745723a8810859ac5a7a06c634c6c25e75b0c1fbc58bb49baacb8796d0f","observation_id":"ec185854-6038-4636-afd8-a4c7f357a6ca","resolution":{"observed_at":"2026-08-15T19:58:06.387752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.368262Z","title":"PACEMAKER: Avoiding HeART Attacks in Storage Clusters with Disk-adaptive Redundancy,","venue":null,"work_id":"5f558d40-42d9-44e1-8306-bf691fee0cdc","year":2020},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.797825Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:f9cbf3babceed76041357c13218f776afdf10069ec6435291c9bb6c5e2782784","observation_id":"0be2c8b6-be30-4d62-a78e-14976869483c","resolution":{"observed_at":"2026-08-15T19:58:06.372804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.354181Z","title":"Convertible Codes: Enabling Efficient Conversion of Coded Data in Distributed Storage,","venue":null,"work_id":"cb99259f-c770-4476-b2f9-c5b962a924cb","year":2022},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.802371Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:5593a64ef5d1b6d2161020bea812be3225c6df4a43388aabe91e5fe0636e4842","observation_id":"4b6dedd4-9737-4cf4-9f8d-5f5cf58065c2","resolution":{"observed_at":"2026-08-15T19:58:06.358996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.340279Z","title":"Code Conversions in Storage Systems,","venue":null,"work_id":"f820a436-5dbf-4ce8-bf76-3e5be3118e85","year":2024},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.807053Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:34cba64884c532f31b6e01ef6e584454752125bc0e6ae6e9a71514ad717ddf1d","observation_id":"3eea85f4-792a-4417-bfc7-b79ce254d606","resolution":{"observed_at":"2026-08-15T19:58:06.344674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.325536Z","title":"Multiple Description Coding: Compression Meets the Network,","venue":null,"work_id":"f813904b-9066-4a07-925f-43750dbc4b81","year":2001},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.811447Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:26aabbcc85cb6eed2ceefc6d2ef6c628006e0a755c8cb0b1cca6c93df36c1815","observation_id":"bca3ab96-26ec-4f22-b197-eefd91b75a2d","resolution":{"observed_at":"2026-08-15T19:58:06.330437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.311368Z","title":"Achievable Rates for Multiple Descriptions,","venue":null,"work_id":"e60e67e6-c1af-4869-bc0a-09db154b7f82","year":1982},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.816006Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:507aa484c6389e1d76e6049aaf90f0ebba5f68c2300a24ad4dd2b92c63824d89","observation_id":"217e1410-3f23-4b09-9495-040f4394149f","resolution":{"observed_at":"2026-08-15T19:58:06.315893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.296545Z","title":"Erasure Multiple Descriptions,","venue":null,"work_id":"ae6fb130-b3b6-4669-9f21-fc28af17432f","year":2012},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.820450Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:824d443bee68d9df05cae68c3d47d6f0cfc5446f593e7aa8cbda6aa64555ba8e","observation_id":"8eb61e4b-2c49-4978-9b98-d658eec202ea","resolution":{"observed_at":"2026-08-15T19:58:06.301581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.281594Z","title":"Goldreich, Foundations of Cryptography: Volume 2, Basic Applications","venue":null,"work_id":"2585ad5a-dc79-46c3-96fa-64ce15f4e69f","year":2009},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.824862Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:37f1e6a1921f3a0a6e326a0066a97fe210c7f789e646d767cac6594219b774cb","observation_id":"bbf0c999-b401-4958-8bf0-3607a3479a78","resolution":{"observed_at":"2026-08-15T19:58:06.286702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.266620Z","title":"Lossy Source Coding with Byzantine Adversaries,","venue":null,"work_id":"143390cb-5f0d-4870-a571-bf742f20db61","year":2011},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.829157Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:e3497aae92453b234b2e62996c596f6249baa0c7d6bb7b76583f8d28c33ca351","observation_id":"ea45091c-548a-4de4-ad3b-96196b02bd0b","resolution":{"observed_at":"2026-08-15T19:58:06.271466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.251742Z","title":"Higher-Order MDS Codes,","venue":null,"work_id":"f6963b61-30c9-4c47-a301-e46baa74daa7","year":2022},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.833661Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:7b3b4253d58bc0f9e9028cf83dcb003c4bf7719d0fb18e6c05b510e6e451510e","observation_id":"e8b92d85-47e1-460f-9633-02db1178d16c","resolution":{"observed_at":"2026-08-15T19:58:06.256402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.236825Z","title":"Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes,","venue":null,"work_id":"a4ecdd76-1903-4a0c-b936-a81327142260","year":2022},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.837637Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:03602adf8b0ef72042a332e0e4d6b87b74061eb3923606bfaad58756805e6576","observation_id":"4847659d-1fb3-44f7-b5a0-2a0a505e1bc1","resolution":{"observed_at":"2026-08-15T19:58:06.241688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.222633Z","title":null,"venue":null,"work_id":"f9c58af2-5918-4835-9a11-b2fc183f94c5","year":2005},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.841941Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:ffce120900ed238379cc97c9c430c2f0817b082ce1e158ec82f3feaa871b5a51","observation_id":"01843448-6536-4bf7-9012-d3aeb371e693","resolution":{"observed_at":"2026-08-15T19:58:06.227074Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.208707Z","title":"Elias, List Decoding for Noisy Channels","venue":null,"work_id":"885e9744-25b1-400d-becc-68552999854d","year":1957},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.846322Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:5f15875aca0ddb593b1029f0fe0c5137d3be142a3d7de0627077ed13e51257fd","observation_id":"2e6da04e-2ec6-42f4-a1e7-235fa6d11c3c","resolution":{"observed_at":"2026-08-15T19:58:06.213175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.195079Z","title":"List Decoding,","venue":null,"work_id":"5e84c242-930c-45db-8548-e8037b602d6e","year":1958},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.850664Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:a75adc8fd90e3ae33b9fa914ac2af0e371b3ea23a64caf47dd08871ce045adf6","observation_id":"46c8620f-1fc5-46fd-94e6-815a0b7c8d6f","resolution":{"observed_at":"2026-08-15T19:58:06.199565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.180617Z","title":"Channel Capacities for List Xodes,","venue":null,"work_id":"48aa353f-f876-4a08-92f0-f646372f220c","year":1973},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.855002Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:8ec7e0b7416d4a61357254a0c36aa674e842289793a1305395b91729da805be9","observation_id":"3cfa107a-95e8-4844-ab07-e0fe74eb1e73","resolution":{"observed_at":"2026-08-15T19:58:06.185438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.166579Z","title":"Bounds for Codes in Decoding by a List of Finite Length,","venue":null,"work_id":"ffcf5c14-dc1d-450b-a1e6-a1e86f365e5e","year":1986},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.859324Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:e1ef82ba54a34d48c90cd7a64507af0fa8af5ca1b93147c369d0394064972ecf","observation_id":"76c72ad8-1a31-41ef-8106-299695d62bf7","resolution":{"observed_at":"2026-08-15T19:58:06.171203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.152379Z","title":"Blinovsky, Asymptotic Combinatorial Coding Theory","venue":null,"work_id":"88b43396-eaf8-4fa7-97a8-8e1a2c27d314","year":1997},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.863501Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:474e2d5dce3d83f5cbab366cfc73081cb3538a15af5e612bc1a4852dc637f593","observation_id":"c2cc3e2e-4635-47e6-91a1-1043e5ac52d7","resolution":{"observed_at":"2026-08-15T19:58:06.156815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.137593Z","title":"Error-Correcting Codes for List Decoding,","venue":null,"work_id":"a5c7cb10-c888-4842-9cb1-1fc722e804e2","year":1991},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.867827Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:b82b229a932c86e6d251f832e622c7d08d27648c1721f5fdc57f35cfca52cd4d","observation_id":"c32ab331-6f61-46d8-bf40-f78767de5ff0","resolution":{"observed_at":"2026-08-15T19:58:06.142389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.122947Z","title":"On the Hardness of Permanent,","venue":null,"work_id":"649611cf-b5bb-4079-a925-b3cebc64a243","year":1999},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.872246Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:9e5702c63856550ea03d4d21744a5398d24d3e7a96e990966a355ad2f26c2f43","observation_id":"2c1e3baa-70b7-45ac-942b-78660481a897","resolution":{"observed_at":"2026-08-15T19:58:06.127578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.108072Z","title":"Unbalanced Expanders and Randomness Extractors from Parvaresh–Vardy Codes,","venue":null,"work_id":"84d47287-d339-4051-a6dc-850a346a73e2","year":2009},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.876994Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:8051e2dfd65092fdfa0180fb2cd12c96e71fbb7b98d90a03f06ad582a2d51ad8","observation_id":"83915a23-396e-4a95-bf2b-41f622642ab6","resolution":{"observed_at":"2026-08-15T19:58:06.113265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.093414Z","title":"On Membership Comparable Sets,","venue":null,"work_id":"f782ba4f-dafb-4210-a5b1-87208142c062","year":1999},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.881547Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:a23a96c54ccbff10e3239b67e4c8e9101ddf7fcada164c2ce20c4b8bd13e6c19","observation_id":"698fb04d-f461-4338-b916-94fd84ef1715","resolution":{"observed_at":"2026-08-15T19:58:06.097911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.079290Z","title":"Pseudorandom Generators without the XOR Lemma,","venue":null,"work_id":"695688bf-8c3f-42e9-8e14-83124e8adb27","year":1999},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.886020Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:d6d7d4ebf58a792dbce9de3a485dae2b2b7b87d8203dd85a9f7545ff554fa827","observation_id":"c17ad06d-0f65-4411-82bf-eb61bfcc695c","resolution":{"observed_at":"2026-08-15T19:58:06.083681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.062758Z","title":"Essential coding theory,","venue":null,"work_id":"f990f6f2-34fb-416c-bf9a-20d5557b97ea","year":2019},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.890608Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:d38f4be0597016df564066d9e258c32836e80a7dac7cc1cb29f04fe9f0e4cb46","observation_id":"2904d0d8-4c89-4286-8daa-fafe1e06f11d","resolution":{"observed_at":"2026-08-15T19:58:06.068078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.047066Z","title":"The Diametric Theorem in Hamming Spaces-Optimal Anticodes,","venue":null,"work_id":"543e776e-c77f-41b1-acaf-1c58b61865f3","year":1998},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.894827Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:f63bb1f3ef7e2a4dcd4034f4b8d2a0bccfeb10f5e60609051b33eb645c95d25a","observation_id":"353d614c-a431-43eb-863f-b10635fbce37","resolution":{"observed_at":"2026-08-15T19:58:06.051673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/090778274","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:58:05.952825Z","title":"List decoding tensor products and interleaved codes,","venue":null,"work_id":"8169ac2d-455f-4612-b20c-2e1e56b2cec0","year":2011},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.899432Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:428c19d73d57aebd657b36947a69514c991191360109d2235fd2d9c812d87ed6","observation_id":"b00175df-7090-4d56-8b74-1afeaa0008c6","resolution":{"observed_at":"2026-08-15T19:58:05.960154Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.032570Z","title":"Generic Reed-Solomon Codes Achieve List-decoding Capacity,","venue":null,"work_id":"af4ea6d5-bc14-4c89-b333-6702b5200431","year":2023},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.903951Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:3a365ebda9bbfd13acc313c62425607dc8ff4ab39d067eb1eb5bcba097e8e15e","observation_id":"34d0e5aa-9eb9-4c3e-9a34-95f43810b4fa","resolution":{"observed_at":"2026-08-15T19:58:06.037088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.017622Z","title":"Improved Field Size Bounds for Higher Order MDS Codes,","venue":null,"work_id":"7382f396-ff94-488b-8dc3-08f6365a9f3c","year":2024},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.908426Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:1436be16746f37d79e9adf43304f2069c10e084be0fdab7028810439912c938f","observation_id":"13a15bcd-9185-430f-877c-9c4864a6bef0","resolution":{"observed_at":"2026-08-15T19:58:06.022380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:06.002397Z","title":"Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes,","venue":null,"work_id":"9f33631b-e842-4d4d-81bd-961ad2653328","year":2024},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.913056Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:cba69e987f166416663dfbc13eeee659364c4e15785ce773c9559d85cae0a7c5","observation_id":"4012ba83-e27c-4dd6-968a-46f5c98fa33e","resolution":{"observed_at":"2026-08-15T19:58:06.007422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:58:05.917595Z","title":"Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.917595Z"},"links":{"cited_paper":"/paper/2408.15925","citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:e1d5ca168e138bafcf2d110b33c5c3bea6b75ec542ed1ca70a9c0186a8fbc799","observation_id":"ce37de69-9191-45df-890e-d87c9101d31e","resolution":{"observed_at":"2026-08-15T19:58:05.917595Z","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-15T19:58:05.987356Z","title":"MJRTY-A Fast Majority V ote Algorithm,","venue":null,"work_id":"5ed55210-fcca-44e8-a0ee-9a3ccd016993","year":1991},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.922659Z"},"links":{"citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:aecf4fe6b2401a397a6e7851c3da76bb6c7bc6f1ab38aa045ab0e8c6300b6526","observation_id":"3fb6dfad-b969-4a51-b48f-977f59ac1377","resolution":{"observed_at":"2026-08-15T19:58:05.992076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":34},"total_outbound_references":38},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2506.15233."}