{"as_of":"2026-08-08T21:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e053ba7b600eb27350e256fbe1f41722412298e097a619cfd051e941023e0778","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-08T06:32:00.761636+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-07T11:31:20.707478Z","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-07T11:31:20.955514Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.02800","last_updated":"2020-04-06T16:45:40Z","snapshot_observed_at":"2026-08-02T19:34:56.783738Z","submitted_at":"2020-04-06T16:45:40Z","title":"Large induced trees in dense random graphs","version":1},"cited_work":{"arxiv_id":"2004.02800","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.02800","snapshot_observed_at":"2026-08-07T11:31:20.955514Z","title":"Large induced trees in dense random graphs","venue":"math.CO","work_id":"6d0118a7-7030-4166-94f9-7781725d5350","year":2020},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.707478Z"},"links":{"cited_paper":"/paper/2004.02800","citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:a9ba5e938d00fd97339df2985b7bd71f5240f1e271c5a8a97188bdc5bf3e12ec","observation_id":"d6ad43af-1a67-4f33-a8a4-6242cc9beac5","resolution":{"observed_at":"2026-08-07T11:31:20.959886Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2004.02800/citation-record","integrity":"/paper/2004.02800/integrity","json":"/paper/2004.02800/citation-record.json","paper":"/paper/2004.02800"},"outbound":[],"paper":{"arxiv_id":"2004.02800","last_updated":"2020-04-06T16:45:40Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-02T19:34:56.783738Z","submitted_at":"2020-04-06T16:45:40Z","title":"Large induced trees in dense random graphs"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2004.02800."}