{"as_of":"2026-08-19T16:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dbe14ac3f3e608265258d3d34790fcba97bcebc4b99776a76d231bf58f5e93d2","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:29:24.788075Z","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-09T18:54:06.028913Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.09755","last_updated":"2024-12-16T09:20:42Z","snapshot_observed_at":"2026-08-16T14:09:49.115369Z","submitted_at":"2024-03-14T14:02:00Z","title":"Estimating the history of a random recursive tree","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.09755","snapshot_observed_at":"2026-08-12T15:29:24.788075Z","title":"Estimating the history of a random recursive tree","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.14336","last_updated":"2024-11-21T17:30:49Z","snapshot_observed_at":"2026-08-16T21:22:47.849906Z","submitted_at":"2024-11-21T17:30:49Z","title":"Finding the root in random nearest neighbor trees","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.788075Z"},"links":{"cited_paper":"/paper/2403.09755","citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:7ee645866ab80928f05f8709a504b4d14a8418e354cb89ef874c05692db2e655","observation_id":"2cb18b08-4eed-434d-a92c-7636e421dcc5","resolution":{"observed_at":"2026-08-12T15:29:24.788075Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.09755","last_updated":"2024-12-16T09:20:42Z","snapshot_observed_at":"2026-08-16T14:09:49.115369Z","submitted_at":"2024-03-14T14:02:00Z","title":"Estimating the history of a random recursive tree","version":3},"cited_work":{"arxiv_id":"2403.09755","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.09755","snapshot_observed_at":"2026-08-09T18:54:06.028913Z","title":"Estimating the history of a random recursive tree","venue":"stat.ML","work_id":"ac4ef96f-f596-40dc-8821-8cb1d5fa418c","year":2024},"citing_paper":{"arxiv_id":"2502.00514","last_updated":"2025-06-06T03:34:42Z","snapshot_observed_at":"2026-08-18T16:10:38.222296Z","submitted_at":"2025-02-01T18:19:36Z","title":"A Proof of The Changepoint Detection Threshold Conjecture in Preferential Attachment Models","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T18:54:05.680992Z"},"links":{"cited_paper":"/paper/2403.09755","citing_paper":"/paper/2502.00514"},"observation_digest":"sha256:d13c1ac267113170e79ba9e4cabb18b2925156867123f5a0e190eab61b51dc55","observation_id":"5c6a6410-341d-483a-9467-1035a2507a4a","resolution":{"observed_at":"2026-08-09T18:54:06.035078Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.09755","last_updated":"2024-12-16T09:20:42Z","snapshot_observed_at":"2026-08-16T14:09:49.115369Z","submitted_at":"2024-03-14T14:02:00Z","title":"Estimating the history of a random recursive tree","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.09755","snapshot_observed_at":"2026-08-01T07:42:27.112085Z","title":"Estimating the history of a random recursive tree , journal =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-18T22:27:52.847788Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:27.112085Z"},"links":{"cited_paper":"/paper/2403.09755","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:b5327cd0d14baa1be94b39010088c20d3277a3c2df2524e3bd6c16a55231fa80","observation_id":"2971be49-d965-4242-827e-240713b3e5c6","resolution":{"observed_at":"2026-08-01T07:42:27.112085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2403.09755/citation-record","integrity":"/paper/2403.09755/integrity","json":"/paper/2403.09755/citation-record.json","paper":"/paper/2403.09755"},"outbound":[],"paper":{"arxiv_id":"2403.09755","last_updated":"2024-12-16T09:20:42Z","latest_version":3,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-16T14:09:49.115369Z","submitted_at":"2024-03-14T14:02:00Z","title":"Estimating the history of a random recursive tree"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2403.09755."}