{"as_of":"2026-08-11T14:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e2a0d14df03d67b836d33c9fb550f05880c3f589f375ca7ecffed6a894355102","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T15:51:19.297617Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T18:30:01.203081Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-09T21:28:16.122573Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"cited_work":{"arxiv_id":"2411.18614","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.18614","snapshot_observed_at":"2026-07-15T00:21:10.980381Z","title":"Addario-Berry, C","venue":null,"work_id":"1be0ca2a-8070-4538-889f-800c81861fbb","year":2024},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-07T22:58:33.732292Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"cited_paper":"/paper/2411.18614","citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:dde5940df0d860371710b253aa7d6234ff3bf16f9166cae73ba98d072344ec5e","observation_id":"1f5ae4f3-8c5c-4a77-b4db-bd6108ec332f","resolution":{"observed_at":"2026-07-15T00:21:10.980381Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-09T21:28:16.122573Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"cited_work":{"arxiv_id":"2411.18614","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.18614","snapshot_observed_at":"2026-07-15T00:21:10.980381Z","title":"Addario-Berry, C","venue":null,"work_id":"1be0ca2a-8070-4538-889f-800c81861fbb","year":2024},"citing_paper":{"arxiv_id":"2606.24465","last_updated":"2026-06-23T11:58:20Z","snapshot_observed_at":"2026-08-09T08:42:08.459225Z","submitted_at":"2026-06-23T11:58:20Z","title":"History estimation in random recursive trees: Pointwise approach via iterated Jordan centralities","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-25T22:52:59.897614Z"},"links":{"cited_paper":"/paper/2411.18614","citing_paper":"/paper/2606.24465"},"observation_digest":"sha256:f71bf96366b03b7340edda467138c26dda17bd015b1347f16098b9a3a5795b4c","observation_id":"1b8482f5-f240-481d-b830-a115c5ff6e40","resolution":{"observed_at":"2026-07-15T00:21:10.980381Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-09T21:28:16.122573Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.18614","snapshot_observed_at":"2026-08-01T15:51:19.297617Z","title":"Addario-Berry, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18201","last_updated":"2026-07-20T17:41:26Z","snapshot_observed_at":"2026-08-09T08:42:36.757322Z","submitted_at":"2026-07-20T17:41:26Z","title":"Finding Adam in noisy trees","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T15:51:19.297617Z"},"links":{"cited_paper":"/paper/2411.18614","citing_paper":"/paper/2607.18201"},"observation_digest":"sha256:5238e37113fb2012e7b406421901b23fb592f6c08dc948763dfc72f857ee94f2","observation_id":"b3f1038e-c06a-4fd4-94db-65ad9ea30a52","resolution":{"observed_at":"2026-08-01T15:51:19.297617Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-09T21:28:16.122573Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.18614","snapshot_observed_at":"2026-08-01T07:42:26.041582Z","title":"Optimal root recovery for uniform attachment trees and","venue":null,"work_id":null,"year":null},"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":1,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:26.041582Z"},"links":{"cited_paper":"/paper/2411.18614","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:c9f5634c65b6a5f4af303098cd5ff31c272a547f190a4ccf4ea5150b6abd507b","observation_id":"a005e7d9-0953-4188-814c-bc43698665fa","resolution":{"observed_at":"2026-08-01T07:42:26.041582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.18614/citation-record","integrity":"/paper/2411.18614/integrity","json":"/paper/2411.18614/citation-record.json","paper":"/paper/2411.18614"},"outbound":[],"paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-09T21:28:16.122573Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular 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 4 inbound Pith citation observations for arXiv:2411.18614."}