{"as_of":"2026-08-19T12:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b158076d18549626e86419149ccb476195697d0a9da8879997b66dbe18fc5d60","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T01:27:05.627985Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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.12193/citation-record","integrity":"/paper/2506.12193/integrity","json":"/paper/2506.12193/citation-record.json","paper":"/paper/2506.12193"},"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-07T01:27:06.066523Z","title":"Synchronization strings: codes for insertions and deletions ap- proaching the singleton bound,","venue":null,"work_id":"168beb64-1ca1-4fe4-86f0-8c6d9b4de22e","year":2017},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.560909Z"},"links":{"citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:e909a7cf65f4fb69aefc3d807e544506ecd395d578170d229eb2ef5b8d28716c","observation_id":"e2dc686d-74be-4aad-84ef-df27ff3c3bbc","resolution":{"observed_at":"2026-08-07T01:27:06.070388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07T01:27:06.056667Z","title":"Deterministic document exchange protocols, and almost optimal binary codes for edit errors,","venue":null,"work_id":"18b1e9c5-d3ad-4ec5-8cc0-50d65d02b4da","year":2018},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.565131Z"},"links":{"citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:c878435ef91f4c63c96610e255f3b4156d8589b40c1de4c556c82ef1eee0390d","observation_id":"0a1b2405-62d1-4a4e-97f9-f1942e0ea35a","resolution":{"observed_at":"2026-08-07T01:27:06.060267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07T01:27:06.047424Z","title":"Optimal document exchange and new codes for insertions and deletions,","venue":null,"work_id":"8145b6d3-28b6-4457-84f0-a6585ba66f1b","year":2019},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.568955Z"},"links":{"citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:8af9940e7947bf1a9fe64d712a5a2a856a0b2860dee0194ec7bcaf28f60d0687","observation_id":"03fe3a31-aec3-4471-a563-8c28fc5ff816","resolution":{"observed_at":"2026-08-07T01:27:06.050813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07T01:27:06.038011Z","title":"On linear and cyclic codes for correcting deletions,","venue":null,"work_id":"60494847-8dc1-4ce7-beae-ee2c292bb2bf","year":2007},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.572330Z"},"links":{"citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:7a988b4cf2b49071779c71ee1a33a19ac504410c052ed94932b636959b8d40de","observation_id":"3e437a5a-cb46-40cd-ae4a-6e8ef46aa615","resolution":{"observed_at":"2026-08-07T01:27:06.041116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07T01:27:06.028377Z","title":"Efficient linear and affine codes for cor- recting insertions/deletions,","venue":null,"work_id":"793548ec-b7c5-447d-b036-b4059f68adcf","year":2022},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.575922Z"},"links":{"citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:0a65efc205dc19142ae30adb48842e1a354159c4e1918ee37f23b044097c1d26","observation_id":"6fc0282d-fd48-4fcb-9b96-686ecc6f81c3","resolution":{"observed_at":"2026-08-07T01:27:06.031877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07T01:27:06.017467Z","title":"Explicit and efficient constructions of linear codes against ad- versarial insertions and deletions,","venue":null,"work_id":"73a5abc0-0a0f-496e-b122-2e1e44388e56","year":2022},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.579430Z"},"links":{"citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:145db159395adc2f1e857896bc5caae2a24de78f21694eed7c777532f2f0863d","observation_id":"89f13b89-4bde-4eff-a0bc-ffef4b60c2ea","resolution":{"observed_at":"2026-08-07T01:27:06.021433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07T01:27:06.005187Z","title":"Linear insertion deletion codes in the high-noise and high-rate regimes,","venue":null,"work_id":"be00def8-f698-4533-adbc-0649c70bc4ca","year":2023},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.583275Z"},"links":{"citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:953015c4b80951eff2a501d15b8ed241b50e9bb10a7fad4a8002dd3a4f1ca076","observation_id":"fcc93034-a8b6-48b3-8f4e-b41061c9004f","resolution":{"observed_at":"2026-08-07T01:27:06.009989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07T01:27:05.992760Z","title":"Deletion codes in the high-noise and high-rate regimes,","venue":null,"work_id":"f51baef4-6d25-4412-90d9-6179874d7459","year":1961},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.587431Z"},"links":{"citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:76523089d5b81644a375b8e00423c3fc90529325fa5a29a0d0258e5e0a5524ba","observation_id":"2aedb982-2da6-4ce6-bd93-53b3600c9373","resolution":{"observed_at":"2026-08-07T01:27:05.996671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:27:05.892944Z","title":"Optimally resilient codes for list-decoding from insertions and deletions,","venue":null,"work_id":"91736591-ac6a-4133-914f-4d72c4d0f2c9","year":2020},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.590803Z"},"links":{"citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:edc2010fbbdd54acdd12a4a142d0c45e17fc53be21cadad273b163550e3f3f18","observation_id":"47e1a220-2f7e-45d4-8a90-108f6d424615","resolution":{"observed_at":"2026-08-07T01:27:05.896702Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07T01:27:05.981977Z","title":"Reed solomon codes against adversarial insertions and deletions,","venue":null,"work_id":"53dfde13-5fc9-4075-b0e6-45c9c91379a8","year":2023},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.594259Z"},"links":{"citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:c350b1b1e3ff6693716aa3b1b131394830b70f1462fcb958272cb645060f0348","observation_id":"68831703-c187-4d72-9783-8437e9e008ec","resolution":{"observed_at":"2026-08-07T01:27:05.985555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07T01:27:05.971517Z","title":"Optimal two-dimensional reed–solomon codes correcting insertions and deletions,","venue":null,"work_id":"ccc94774-28b4-4f9d-a852-74b870bf5230","year":2024},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.597838Z"},"links":{"citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:dc5632047837b0238a8bad118dfee6b73ac831535ed28b84005c4f4913811917","observation_id":"a60822af-cfb1-4923-9c33-5957e0f31f0e","resolution":{"observed_at":"2026-08-07T01:27:05.975218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.07299","last_updated":"2024-07-10T01:41:15Z","snapshot_observed_at":"2026-08-16T13:35:36.208236Z","submitted_at":"2024-07-10T01:41:15Z","title":"Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets","version":1},"cited_work":{"arxiv_id":"2407.07299","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.07299","snapshot_observed_at":"2026-08-07T01:27:05.675662Z","title":"Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets","venue":"cs.IT","work_id":"bdcd09d0-5236-405e-bde6-9e2b6fde6f8b","year":2024},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.601572Z"},"links":{"cited_paper":"/paper/2407.07299","citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:f7cd7f69148ddf077a7203e49aadfbe3244ac400becc9207ada0eb5154ad3139","observation_id":"9293e5d4-dff6-4cce-9519-15af51b94c31","resolution":{"observed_at":"2026-08-07T01:27:05.679614Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-14T02:28:07.665078Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"cited_work":{"arxiv_id":"2501.11371","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.11371","snapshot_observed_at":"2026-08-07T01:27:05.657574Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","venue":"cs.IT","work_id":"7e1a87b4-9172-4fcc-8669-939075cc7c89","year":2025},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.606371Z"},"links":{"cited_paper":"/paper/2501.11371","citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:4cb1b26c86711062c609e3427d60c513e670ef8efa309ae5bccf025ea2bba79e","observation_id":"52ac86c1-fac4-406a-83f2-06f411fd027b","resolution":{"observed_at":"2026-08-07T01:27:05.664943Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07T01:27:05.960950Z","title":"Simple constructions of almost k-wise independent random variables,","venue":null,"work_id":"5465a3fc-0ac9-4956-bf81-0a2d32807745","year":1992},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.610428Z"},"links":{"citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:c4cfb7ccd17aa9773780245c98dac66db0c0f0cbfc11910fe286e46bba2743b0","observation_id":"1ea06a6f-475c-4138-a649-62372f284c09","resolution":{"observed_at":"2026-08-07T01:27:05.964582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07T01:27:05.949753Z","title":"Three xor-lemmas—an exposition,","venue":null,"work_id":"c3293f72-32f9-44ef-8141-9a76395756fa","year":2011},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.614089Z"},"links":{"citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:737dcb5106c50db464226087cb1e175a8661ff6bc001a5a9fd96219697e43ee1","observation_id":"ecfdc7e6-0720-4997-a3c5-c0a9ed8c480a","resolution":{"observed_at":"2026-08-07T01:27:05.953326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07T01:27:05.939234Z","title":"On the list-decodability of random linear codes,","venue":null,"work_id":"240228ec-2614-4a29-8957-ae20a58b62fb","year":2010},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.618225Z"},"links":{"citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:a6b4996e3b72e2980d65fa86d5dbaa5875e628de2d1770014bdf497b640d7bbd","observation_id":"7285548b-3955-407c-abbd-cf65742e49e7","resolution":{"observed_at":"2026-08-07T01:27:05.943271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07T01:27:05.927715Z","title":"Pseudorandomness,","venue":null,"work_id":"50357fd4-0b28-49b3-ada6-e85e5c5149c2","year":2012},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.621507Z"},"links":{"citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:c1901748f3d380c11b62ae19ae6fb253a397ddd303f72120078d9fff0856a4ae","observation_id":"f71f9c62-9169-4aba-93a1-17f756ffc787","resolution":{"observed_at":"2026-08-07T01:27:05.931891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07T01:27:05.917073Z","title":"Local list recovery of high-rate tensor codes and applications,","venue":null,"work_id":"f930dcfa-4b0b-4843-9bae-96b205580fc6","year":2019},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.624574Z"},"links":{"citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:55d6459e21e6fbe094f50e44f988eae0f1bfececc18f422b2f19c87b3806d15f","observation_id":"a5991d0e-93dd-416f-abf1-f0e2e8543401","resolution":{"observed_at":"2026-08-07T01:27:05.920689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07T01:27:05.905720Z","title":"Deletion codes in the high-noise and high-rate regimes,","venue":null,"work_id":"17049107-c58e-4c2f-ada4-188fc2b0cf62","year":1961},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.627985Z"},"links":{"citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:14b780f79dd38e9db2d6d8d66aa97477c4fd25c5e5dd89e9e0c543d2d7698558","observation_id":"a3d750c0-daaf-4352-ad1b-f7fc05f60f98","resolution":{"observed_at":"2026-08-07T01:27:05.909593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":3,"verified_fuzzy":16},"total_outbound_references":19},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2506.12193."}