{"as_of":"2026-08-12T05:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:04d399f2dac13266bbcbf6e54b68bd1daf7ffa57c25f181bc871a813d17bd94b","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:27.060708Z","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":"2411.14336","last_updated":"2024-11-21T17:30:49Z","snapshot_observed_at":"2026-08-10T08:37:29.333627Z","submitted_at":"2024-11-21T17:30:49Z","title":"Finding the root in random nearest neighbor trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.14336","snapshot_observed_at":"2026-08-01T07:42:27.060708Z","title":"Random Structures & Algorithms , volume =","venue":null,"work_id":null,"year":2026},"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":12,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:27.060708Z"},"links":{"cited_paper":"/paper/2411.14336","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:738f9db874a803af8f0150275b175e5ea05562987a48bf45e46e3939c5adedd6","observation_id":"6944ded0-1153-4695-8e8f-c8183b075711","resolution":{"observed_at":"2026-08-01T07:42:27.060708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.14336/citation-record","integrity":"/paper/2411.14336/integrity","json":"/paper/2411.14336/citation-record.json","paper":"/paper/2411.14336"},"outbound":[],"paper":{"arxiv_id":"2411.14336","last_updated":"2024-11-21T17:30:49Z","latest_version":1,"primary_category":"math.PR","snapshot_observed_at":"2026-08-10T08:37:29.333627Z","submitted_at":"2024-11-21T17:30:49Z","title":"Finding the root in random nearest neighbor 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 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2411.14336."}