{"as_of":"2026-08-11T17:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:08a3a47fd944e819153ca43116b986ca425e2c3c5b2a3ae92a3a3447d51a6f17","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-11T06:34:44.6726+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-01T07:42:30.210700Z","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":"1905.07652","last_updated":"2019-05-18T22:10:14Z","snapshot_observed_at":"2026-08-11T14:30:08.173061Z","submitted_at":"2019-05-18T22:10:14Z","title":"On a Tail Bound for Root-Finding in Randomly Growing Trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.07652","snapshot_observed_at":"2026-08-01T07:42:30.210700Z","title":null,"venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:30.210700Z"},"links":{"cited_paper":"/paper/1905.07652","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:4e16f458c4d453f54a5eb0ab8d4f6c28c5134ddba6b024d52925afd426b5cb99","observation_id":"3f842f54-3cc7-4970-999f-588933c54365","resolution":{"observed_at":"2026-08-01T07:42:30.210700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1905.07652/citation-record","integrity":"/paper/1905.07652/integrity","json":"/paper/1905.07652/citation-record.json","paper":"/paper/1905.07652"},"outbound":[],"paper":{"arxiv_id":"1905.07652","last_updated":"2019-05-18T22:10:14Z","latest_version":1,"primary_category":"math.PR","snapshot_observed_at":"2026-08-11T14:30:08.173061Z","submitted_at":"2019-05-18T22:10:14Z","title":"On a Tail Bound for Root-Finding in Randomly Growing Trees"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1905.07652."}