{"as_of":"2026-08-13T15:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5333c18fc68c3c4c233f72669a32c834f55a85544bedd5ff7d44f0526aee74dc","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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-12T11:11:11.537583Z","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-12T11:11:11.606319Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.04261","last_updated":"2025-07-31T16:15:12Z","snapshot_observed_at":"2026-08-13T07:15:39.850502Z","submitted_at":"2024-05-07T12:21:42Z","title":"Graph Reconstruction from Noisy Random Subgraphs","version":2},"cited_work":{"arxiv_id":"2405.04261","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.04261","snapshot_observed_at":"2026-08-12T11:11:11.606319Z","title":"Graph Reconstruction from Noisy Random Subgraphs","venue":"cs.IT","work_id":"2f3c6359-79d3-43be-8414-f6371fbf7e34","year":2024},"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":27,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.537583Z"},"links":{"cited_paper":"/paper/2405.04261","citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:86c9a6c7ec321873017163d9c52f21da168405e921f391596d3519b9e0086b0a","observation_id":"afb373e0-bc0e-463a-ac46-7447849ec69e","resolution":{"observed_at":"2026-08-12T11:11:11.613631Z","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/2405.04261/citation-record","integrity":"/paper/2405.04261/integrity","json":"/paper/2405.04261/citation-record.json","paper":"/paper/2405.04261"},"outbound":[],"paper":{"arxiv_id":"2405.04261","last_updated":"2025-07-31T16:15:12Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-13T07:15:39.850502Z","submitted_at":"2024-05-07T12:21:42Z","title":"Graph Reconstruction from Noisy Random Subgraphs"},"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 1 inbound Pith citation observation for arXiv:2405.04261."}