{"as_of":"2026-08-20T02:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:47128bb5204ffd29869ac3ad5cea027eac63424d6d20ab38e99f918e3eabe73e","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T11:07:42.704066Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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-18T02:09:53.602153Z","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-16T09:44:28.422743Z","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:2cf13cf6899464d6a459ceb050d31c78d878e778ecfb83dba8df15df0e90200c","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-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":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","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-15T21:39:33.057295Z","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:d869b921cded7b94d9694d5c3d777cee897d3c1d20b1fad425b7e56be58d7761","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-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":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","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-18T02:57:34.227871Z","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:8d52007b48570656f8bc58e30734d5a1be9ee8d24ef4f3b75c263b3b916cadfa","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-18T02:09:53.602153Z","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-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":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:8b4826ff13780fdb19a9ebc6d0306d0a9b163becc587f0e9e7b0e04957795e6c","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":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1111/stan.12233","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:07:42.900655Z","title":"Convex transform order of beta distributions with some consequences","venue":null,"work_id":"b37e2d98-101f-4010-9c91-cabc786f4b8d","year":2021},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.616184Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:5c5dae3023167279706d5470e5b18db880120e9aa997688ee965c6caf5d9d4d9","observation_id":"55f3b54a-6933-4c20-91b1-4a3607b291e4","resolution":{"observed_at":"2026-08-12T11:07:42.905574Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:07:43.290456Z","title":null,"venue":null,"work_id":"b9b47bd7-ee17-418d-acd4-52ad7db4daa8","year":1969},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.621703Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:4c6240296455e9e8158f7ccd139ccd87d0caabe2349dd0c1433d12998223b4c7","observation_id":"668b77a6-ad51-4daa-8c9e-b7843d94c342","resolution":{"observed_at":"2026-08-12T11:07:43.295136Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":"10.1214/21-aap1731","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:07:42.884298Z","title":"Root finding algorithms and persistence of Jordan centrality in growing random trees","venue":null,"work_id":"edc4c847-fe26-4b8a-be28-59a2824ce3cc","year":2022},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.626764Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:8dfcdfa233aa0762cf3fc13decd28fce3c369f897612bf269715c8c5e6655ec9","observation_id":"ec10b9bc-3c66-470a-8a7c-a2280a585c5e","resolution":{"observed_at":"2026-08-12T11:07:42.889324Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":"10.1214/23-ejp930","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:07:42.868988Z","title":"Degree centrality and root finding in growing random networks","venue":null,"work_id":"69c489a6-777f-469a-bccf-53e31730b3e9","year":2023},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.632074Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:3d0566f84f26e1acdfef7d8b585c620e69b2d2e439cf44c347080eb52e79b602","observation_id":"55e0732f-f315-46a4-b333-db3c5f91527f","resolution":{"observed_at":"2026-08-12T11:07:42.874029Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/s0963548323000184","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:07:42.853855Z","title":"Archaeology of random recursive dags and cooper-frieze random networks","venue":null,"work_id":"4cc2447d-c1a4-4ec6-aed9-6d8bf18b5b3f","year":2023},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.637282Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:365460adf8144ff2157fbc86aa076bb8666e533da3643ff9a12b2d53ccb8e933","observation_id":"e585681b-9e3d-4125-a2c2-feee20a5b528","resolution":{"observed_at":"2026-08-12T11:07:42.858947Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":"2015.23975","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:07:43.240639Z","title":null,"venue":null,"work_id":"fbfa6d21-ca41-493c-a3e2-bf2dea86441f","year":2015},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.642381Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:0f1fdafe100b62b19a2707af539cb5329ca7175995e0819d536f84a946ee714b","observation_id":"e8bb40b0-7681-4126-b571-a963da5ab570","resolution":{"observed_at":"2026-08-12T11:07:43.248472Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:07:42.647717Z","title":"Finding Adam in random growing trees","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.647717Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:383ce4153cb2b6dbe71a481b37284c5ebadd368f375875e0521e5d70906eca0e","observation_id":"ffd536f4-a812-418d-b244-473edb12f360","resolution":{"observed_at":"2026-08-12T11:07:42.647717Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10959-013-0530-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-19T11:03:45.297681Z","title":"Smoothing Equations for Large P´ olya Urns","venue":"Journal of Theoretical Probability","work_id":"9769ef1e-0f17-4311-95a7-09022e3b29e0","year":2015},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.652677Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:965263236ef8e17629d61a9864699d30f7d2eb3fe3e808448e9ebbbbee281fe0","observation_id":"08c4c66e-2ef2-4771-8767-16a778748b81","resolution":{"observed_at":"2026-08-12T11:07:42.830870Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00440-023-01253-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"Eve, Adam and the preferential attachment tree","venue":"Probability Theory and Related Fields","work_id":"0139e66b-8ff3-4869-b5b9-09b9ed405c75","year":2024},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.657183Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:521a8119d80eaad10dd76088374a5eb9f9f4acc9d200b651e226f0853367c9df","observation_id":"521388ad-b33e-4140-937d-f56efd514be1","resolution":{"observed_at":"2026-08-12T11:07:42.813639Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":"10.1111/rssb.12428","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:07:42.793054Z","title":"Inference on the history of a randomly growing tree","venue":null,"work_id":"a3d4eee2-9aa1-4f1b-b869-cfde9016224c","year":2021},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.662125Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:af9fd9490dca0db1077dddf4e0d7922212f321e0626fdcd315d722ec259ca3ab","observation_id":"dbdff718-6f92-4143-aab1-45ce9614202c","resolution":{"observed_at":"2026-08-12T11:07:42.797904Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":"10.5802/jep.15","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:07:42.777516Z","title":"Scaling limits and influence of the seed graph in preferential attachment trees","venue":null,"work_id":"d7771673-b3d2-4cb3-8dbe-099781916194","year":2015},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.666533Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:3cb216eef24c0a92c2975ca4bf069736610a5d2728ff39c53b28f9825d2beedb","observation_id":"5d98317f-5246-48da-bfbd-c5f55a8892ef","resolution":{"observed_at":"2026-08-12T11:07:42.782935Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:07:42.671233Z","title":"On an elementary proof of some asymptotic formulas in the theory of partitions","venue":null,"work_id":null,"year":1942},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.671233Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:d949501c929c72d8869ba1fde69086ad30b93f82a95d61f13f28b08821254086","observation_id":"dd27af24-77d1-4da5-b1d7-6ba0b6927415","resolution":{"observed_at":"2026-08-12T11:07:42.671233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1214/16-aap1212","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:07:42.762417Z","title":"Looking for vertex number one","venue":null,"work_id":"ebe99cff-d06c-4b39-8a17-a77ac2cd4b69","year":2017},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.676346Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:2327ab1316d5788b3400bca81686443763885a9672e6b209c9e95340f08885c1","observation_id":"c95c9650-a666-45f4-b8a1-34c854cb6ed4","resolution":{"observed_at":"2026-08-12T11:07:42.767115Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:07:43.274781Z","title":null,"venue":null,"work_id":"72a2404a-d44b-40e8-97bc-ec5d93b40939","year":1964},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.680887Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:e921890823cf781f9b10e30fbd97b6d34c30dc6663ec6fc1b0042a300a1f7e9b","observation_id":"d1c833d8-8467-498b-a6b5-5a594545896c","resolution":{"observed_at":"2026-08-12T11:07:43.279638Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:07:42.685498Z","title":"Confidence sets for the source of a diffusion in regular trees","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.685498Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:efad7dde8eee6b119867667db3cac8a9446b50ebd272573c1949bb702c7b87e1","observation_id":"75d58db5-b1a4-4a44-a27e-c47fbed13888","resolution":{"observed_at":"2026-08-12T11:07:42.685498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1080/02331887808801456","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:07:42.745536Z","title":"Comparability of special distributions","venue":null,"work_id":"1b0832ce-3056-4c11-96cb-29a623214bbb","year":1978},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.689870Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:a6fe17a093fae6436991ca47f80752243f2ff3aeb77cf2f1130e860f6b752820","observation_id":"67aa52de-3ca7-43ee-8156-93997319991d","resolution":{"observed_at":"2026-08-12T11:07:42.751346Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:07:42.694581Z","title":"On the discovery of the seed in uniform attachment trees","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.694581Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:a8f946e409ce528fef8c109210d63b487273fac65df5ea10e3001db2d3f53759","observation_id":"8bf18dc7-3db1-450b-9b54-3d6af815892f","resolution":{"observed_at":"2026-08-12T11:07:42.694581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:07:43.259278Z","title":"Persistence of hubs in growing random networks","venue":null,"work_id":"cb5b53d3-f785-4724-87d8-c726960d9c8c","year":2021},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.699373Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:7ec163f731260c0990bf8f43843e7c69e8d03f3d1d8c8f8a0b6586d18fa03107","observation_id":"89a1ff82-ac05-4549-a707-62cd33034fd5","resolution":{"observed_at":"2026-08-12T11:07:43.264310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:07:42.704066Z","title":"Rumors in a network: Who’s the culprit? IEEE Transactions on Information Theory , 57(8):5163 – 5181, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T11:07:42.704066Z"},"links":{"citing_paper":"/paper/2411.18614"},"observation_digest":"sha256:679b0ebeb7e0e614e62647060d8aa0e231ee9267a4ed47cf7459b265bd98eb27","observation_id":"cdb614d3-2f18-462b-9648-e8789e5eadba","resolution":{"observed_at":"2026-08-12T11:07:42.704066Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":6,"verified_exact":10,"verified_fuzzy":1},"total_outbound_references":19},"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 20 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 4 inbound Pith citation observations for arXiv:2411.18614."}