{"as_of":"2026-08-16T23:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:990d48135f706040cf602eed5be27f47d7cfea289caba7205b44a3a6f08ff529","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:08:18.691492Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-24T11:24:24.077698Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2009.03296","last_updated":"2022-01-11T12:10:13Z","snapshot_observed_at":"2026-08-04T17:34:09.994233Z","submitted_at":"2020-09-07T17:56:08Z","title":"New upper bounds for trace reconstruction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.03296","snapshot_observed_at":"2026-08-14T14:08:18.691492Z","title":"New upper bounds for trace reconstruction","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1908.03996","last_updated":"2020-09-11T22:28:29Z","snapshot_observed_at":"2026-08-14T13:52:50.293022Z","submitted_at":"2019-08-12T04:27:12Z","title":"Coded trace reconstruction in a constant number of traces","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T14:08:18.691492Z"},"links":{"cited_paper":"/paper/2009.03296","citing_paper":"/paper/1908.03996"},"observation_digest":"sha256:1272f213fa5e2a5b013dbca43ebf814462dc5ac5623022445bf26fdc84939293","observation_id":"4d4ef7ae-720f-4ced-ac9e-336fbf83d62c","resolution":{"observed_at":"2026-08-14T14:08:18.691492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03296","last_updated":"2022-01-11T12:10:13Z","snapshot_observed_at":"2026-08-04T17:34:09.994233Z","submitted_at":"2020-09-07T17:56:08Z","title":"New upper bounds for trace reconstruction","version":3},"cited_work":{"arxiv_id":"2009.03296","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2009.03296","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"New upper bounds for trace reconstruction","venue":null,"work_id":"f9446377-2c39-40ff-9d6c-83f39b90e051","year":2009},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-08-02T20:02:29.638874Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"cited_paper":"/paper/2009.03296","citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:51b6a56cdbf9ddbbe5290152513ce0d6d6efa01fcf063979d5722e5098a080b0","observation_id":"be6082d0-ca12-4a0e-827c-5d345e6c09f6","resolution":{"observed_at":"2026-05-24T11:24:24.081625Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2009.03296/citation-record","integrity":"/paper/2009.03296/integrity","json":"/paper/2009.03296/citation-record.json","paper":"/paper/2009.03296"},"outbound":[],"paper":{"arxiv_id":"2009.03296","last_updated":"2022-01-11T12:10:13Z","latest_version":3,"primary_category":"math.PR","snapshot_observed_at":"2026-08-04T17:34:09.994233Z","submitted_at":"2020-09-07T17:56:08Z","title":"New upper bounds for trace reconstruction"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2009.03296."}