{"as_of":"2026-08-18T00:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d7242eae3bc9f67f718dc8df15889a4bf1b4cb6f5ae94acc4643ea5760a177e7","coverage":[{"denominator":6,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T17:13:38.725658Z","state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T23:18:50.608004Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2604.07234","last_updated":"2026-04-08T15:58:02Z","snapshot_observed_at":"2026-07-31T09:05:42.044881Z","submitted_at":"2026-04-08T15:58:02Z","title":"The Random Subsequence Model and Uniform Codes for the Deletion Channel","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.07234","snapshot_observed_at":"2026-08-01T23:18:50.608004Z","title":"The Random Subsequence Model and Uniform Codes for the Deletion Channel,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.15537","last_updated":"2026-07-17T01:13:26Z","snapshot_observed_at":"2026-08-15T21:39:37.086072Z","submitted_at":"2026-07-17T01:13:26Z","title":"Microscopic Side Information Controls Ordered Hayden--Preskill Recovery","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T23:18:50.608004Z"},"links":{"cited_paper":"/paper/2604.07234","citing_paper":"/paper/2607.15537"},"observation_digest":"sha256:1b7f20d5480fb3fc0b4dafd240f99b044946b0a0eb77038c6f502ef2e4896763","observation_id":"5f60082a-0e33-4fd7-b85e-58691ed0f5a9","resolution":{"observed_at":"2026-08-01T23:18:50.608004Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2604.07234/citation-record","integrity":"/paper/2604.07234/integrity","json":"/paper/2604.07234/citation-record.json","paper":"/paper/2604.07234"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On transmission over deletion channels","venue":null,"work_id":"5fd6bce0-baed-44d1-a62c-8bbda6b9052f","year":1994},"citing_paper":{"arxiv_id":"2604.07234","last_updated":"2026-04-08T15:58:02Z","snapshot_observed_at":"2026-07-31T09:05:42.044881Z","submitted_at":"2026-04-08T15:58:02Z","title":"The Random Subsequence Model and Uniform Codes for the Deletion Channel","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T17:13:38.725658Z"},"links":{"citing_paper":"/paper/2604.07234"},"observation_digest":"sha256:71bbd935bef470eb2209874b2e5ed5e7d9dff86754ff506c039785eef04b3d57","observation_id":"493acf57-c688-4189-99f9-67afbe97a007","resolution":{"observed_at":"2026-05-17T11:29:32.467530Z","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-06-05T21:23:00.469572Z","title":"Mutual information for a deletion channel","venue":null,"work_id":"85498e3e-cf83-4b38-a356-94f7800f74a0","year":2001},"citing_paper":{"arxiv_id":"2604.07234","last_updated":"2026-04-08T15:58:02Z","snapshot_observed_at":"2026-07-31T09:05:42.044881Z","submitted_at":"2026-04-08T15:58:02Z","title":"The Random Subsequence Model and Uniform Codes for the Deletion Channel","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T17:13:38.725658Z"},"links":{"citing_paper":"/paper/2604.07234"},"observation_digest":"sha256:7c76aacd84a3f3cf76b6052164580dbb713b9bd39a93856cee9d413a6d0aac40","observation_id":"54e87bec-ec7d-4b7f-a0c8-d58b41fd2605","resolution":{"observed_at":"2026-05-17T11:29:32.470777Z","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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"be153427-341b-4456-b76e-89f3e220393b","year":1975},"citing_paper":{"arxiv_id":"2604.07234","last_updated":"2026-04-08T15:58:02Z","snapshot_observed_at":"2026-07-31T09:05:42.044881Z","submitted_at":"2026-04-08T15:58:02Z","title":"The Random Subsequence Model and Uniform Codes for the Deletion Channel","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T17:13:38.725658Z"},"links":{"citing_paper":"/paper/2604.07234"},"observation_digest":"sha256:7fb0fa9100fa01cabaac608368a4f23d92fac865312ffbf051e1ab0dc0e7e856","observation_id":"a027cd7e-cb91-4054-89f8-26c506d6b62d","resolution":{"observed_at":"2026-05-17T11:29:32.475722Z","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":{"arxiv_id":"2407.10925","last_updated":"2024-07-15T17:25:41Z","snapshot_observed_at":"2026-08-16T13:34:03.854763Z","submitted_at":"2024-07-15T17:25:41Z","title":"Improved Lower Bounds on the Expected Length of Longest Common Subsequences","version":1},"cited_work":{"arxiv_id":"2407.10925","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.10925","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The zero-rate threshold for adversarial bit-deletions is less than 1/2","venue":null,"work_id":"51c0d8f7-f543-4ada-ae07-6cd1f4910a65","year":2021},"citing_paper":{"arxiv_id":"2604.07234","last_updated":"2026-04-08T15:58:02Z","snapshot_observed_at":"2026-07-31T09:05:42.044881Z","submitted_at":"2026-04-08T15:58:02Z","title":"The Random Subsequence Model and Uniform Codes for the Deletion Channel","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T17:13:38.725658Z"},"links":{"cited_paper":"/paper/2407.10925","citing_paper":"/paper/2604.07234"},"observation_digest":"sha256:4a1fcb41a7404bbf4d53fec345cec266d4414aad905cac75f98567e370670f4d","observation_id":"bab31dcd-9bea-4ad0-955d-ad48a0b16db9","resolution":{"observed_at":"2026-05-11T07:20:58.370434Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"64366ae4-7c47-4261-b594-0054ada12ec4","year":1982},"citing_paper":{"arxiv_id":"2604.07234","last_updated":"2026-04-08T15:58:02Z","snapshot_observed_at":"2026-07-31T09:05:42.044881Z","submitted_at":"2026-04-08T15:58:02Z","title":"The Random Subsequence Model and Uniform Codes for the Deletion Channel","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T17:13:38.725658Z"},"links":{"citing_paper":"/paper/2604.07234"},"observation_digest":"sha256:4f1a1dd4231f44b0b42a720fee0967d444f637ba9fe483fcc06df25213de3487","observation_id":"8b6226bd-bc6e-412d-a1f9-5029946411df","resolution":{"observed_at":"2026-05-17T11:29:32.464536Z","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-06-05T21:23:00.469572Z","title":"Zolotarev","venue":null,"work_id":"14aa994f-f7d3-4062-af17-75565b5fddda","year":1967},"citing_paper":{"arxiv_id":"2604.07234","last_updated":"2026-04-08T15:58:02Z","snapshot_observed_at":"2026-07-31T09:05:42.044881Z","submitted_at":"2026-04-08T15:58:02Z","title":"The Random Subsequence Model and Uniform Codes for the Deletion Channel","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T17:13:38.725658Z"},"links":{"citing_paper":"/paper/2604.07234"},"observation_digest":"sha256:7040f2bd3cee4abbf33134a9b945e878068eb321f3834ea6fbc4158a3a5f5b9b","observation_id":"30c2063c-a0e0-4f7e-baf6-ef7284b7794b","resolution":{"observed_at":"2026-05-17T11:29:32.473215Z","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":"2604.07234","last_updated":"2026-04-08T15:58:02Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-07-31T09:05:42.044881Z","submitted_at":"2026-04-08T15:58:02Z","title":"The Random Subsequence Model and Uniform Codes for the Deletion Channel"},"reference_resolution":{"displayed":6,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":3},"total_outbound_references":6},"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 18 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 1 inbound Pith citation observation for arXiv:2604.07234."}