{"as_of":"2026-08-13T11:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bcf60b7120efc527c2645a5878f41030c5821f65c3caae923926727123be0f83","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-13T06:32:02.005865+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-12T11:11:11.474788Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-12T05:26:54.795157Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2107.06454","last_updated":"2021-07-14T02:21:35Z","snapshot_observed_at":"2026-08-13T07:15:31.117827Z","submitted_at":"2021-07-14T02:21:35Z","title":"Approximate trace reconstruction of random strings from a constant number of traces","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.06454","snapshot_observed_at":"2026-08-12T11:11:11.474788Z","title":"Approximate trace reconstruction of random strings from a constant number of traces","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.474788Z"},"links":{"cited_paper":"/paper/2107.06454","citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:3ea358c37d08c007dcbc5c3077f0a8107bfbdedf5ccd23ba1b013ff07107a3bf","observation_id":"cdd5e733-2cc1-4fde-83fe-4d27c2289cd1","resolution":{"observed_at":"2026-08-12T11:11:11.474788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.06454","last_updated":"2021-07-14T02:21:35Z","snapshot_observed_at":"2026-08-13T07:15:31.117827Z","submitted_at":"2021-07-14T02:21:35Z","title":"Approximate trace reconstruction of random strings from a constant number of traces","version":1},"cited_work":{"arxiv_id":"2107.06454","doi":null,"metadata_source":"pith","pith_arxiv_id":"2107.06454","snapshot_observed_at":"2026-08-12T05:26:54.795157Z","title":"Approximate trace reconstruction of random strings from a constant number of traces","venue":"math.PR","work_id":"c2274e10-2e4a-4b70-8547-2f77ffd93730","year":2021},"citing_paper":{"arxiv_id":"2412.00674","last_updated":"2024-12-01T05:06:43Z","snapshot_observed_at":"2026-08-12T05:05:33.130402Z","submitted_at":"2024-12-01T05:06:43Z","title":"A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T05:26:54.613467Z"},"links":{"cited_paper":"/paper/2107.06454","citing_paper":"/paper/2412.00674"},"observation_digest":"sha256:39154830c9c39f86d4e332a729b2539b755607a8bce9dd186312ceec2b0b73a8","observation_id":"132037a1-75bd-465a-8fa5-4e8d935c010c","resolution":{"observed_at":"2026-08-12T05:26:54.801587Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2107.06454/citation-record","integrity":"/paper/2107.06454/integrity","json":"/paper/2107.06454/citation-record.json","paper":"/paper/2107.06454"},"outbound":[],"paper":{"arxiv_id":"2107.06454","last_updated":"2021-07-14T02:21:35Z","latest_version":1,"primary_category":"math.PR","snapshot_observed_at":"2026-08-13T07:15:31.117827Z","submitted_at":"2021-07-14T02:21:35Z","title":"Approximate trace reconstruction of random strings from a constant number of traces"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2107.06454."}