{"as_of":"2026-08-19T10:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c35f07d44eee14d4c562a684033e6e991f6d54d3a4330f96ef5cc1683a91a659","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:29:24.831261Z","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":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-16T21:22:47.849906Z","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-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":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:0ac9fd117900bc22130c5414ec225feddc9ef246a361b0545758e436e1750621","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":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:29:25.075328Z","title":"Random partitions of the plane via poissonian coloring and a self-similar process of coalescing planar partitions","venue":null,"work_id":"22bb1404-8fdb-4716-ac3a-b6d8cbb899f6","year":2000},"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":1,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.772520Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:a2b7364597124ef89b0ac5029baf6e1628818705ccf235a8a807d9b9c51e3a44","observation_id":"01486a02-1c9d-4ec1-ab35-d8614464e000","resolution":{"observed_at":"2026-08-12T15:29:25.078752Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:29:25.068149Z","title":"Root finding algorithms and persistence of Jordan centrality in growing random trees","venue":null,"work_id":"3cb705ba-d4c1-4cbb-8197-ee05ef2b9bcd","year":2022},"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":2,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.776353Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:da59436388f0e01dc6f97efb607d1621183313d0296d3bfe205ad12a0fa43c8c","observation_id":"e4281de5-0bb6-4ce3-873e-d6c5c4fba97b","resolution":{"observed_at":"2026-08-12T15:29:25.070953Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:29:25.059282Z","title":"Archaeology of random recursive dags and cooper-frieze random networks","venue":null,"work_id":"4589a245-472d-4a8b-ae61-6f58cc75a8f3","year":2023},"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":3,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.779324Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:2086e4fb27e35f06b91d68c6a465dc19cd3d63001e25be6229651e41d258fd83","observation_id":"543e91fc-18f0-4b6a-9d02-69d3161e6cb9","resolution":{"observed_at":"2026-08-12T15:29:25.062738Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:29:25.051699Z","title":"Root estimation in galton--watson trees","venue":null,"work_id":"460277f2-48da-45da-bf6b-cdf9889f26a3","year":2022},"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":4,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.782114Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:56f362ca16a7e3b00d78caaab32e62af0cb59a7c1efc5f4297734b0f5090f070","observation_id":"08bc6b81-e7fc-4f78-9d3a-db033934f1b3","resolution":{"observed_at":"2026-08-12T15:29:25.054491Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:29:25.043844Z","title":"Finding Adam in random growing trees","venue":null,"work_id":"88264796-0da8-44be-ac11-b56f4838fad2","year":2017},"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":5,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.785300Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:4593b9b9d690fbf692ae5197416aae27e7736cd03fc1d61305ed077dbf56d9c1","observation_id":"4d8fa7cd-cec9-4186-ba9d-1aae944f8a3d","resolution":{"observed_at":"2026-08-12T15:29:25.046475Z","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":{"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:29:25.037576Z","title":"Degree centrality and root finding in growing random networks","venue":null,"work_id":"26817e06-882c-4535-a780-df5d08cc0a5f","year":2023},"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":7,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.791183Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:0422e83d92d8dc2c3697d24d7e3a98d46626ceb0a291f7ca6e2ef6b2a32f1a8b","observation_id":"a7381e37-c43f-40a4-ae3d-81304322e3e1","resolution":{"observed_at":"2026-08-12T15:29:25.039807Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:29:25.031138Z","title":"Eve, Adam and the preferential attachment tree","venue":null,"work_id":"46679f2f-dcbf-44fa-83e4-d4a2d7f4f9ce","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":8,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.793956Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:65d8ca2e1fa694ffd535fd472e6c4b9d4d065965820fbfc85e8e3cae1691f97e","observation_id":"53276bf4-4f9d-4810-84cf-b78e0a34b2bd","resolution":{"observed_at":"2026-08-12T15:29:25.033495Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:29:25.022251Z","title":"Inference on the history of a randomly growing tree","venue":null,"work_id":"1f2ca206-61e0-458e-869d-0a6d6ec940e6","year":2021},"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":9,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.796815Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:4231043d2fabcac194f6b144f4ea08c655180f63c61a5914dcc150dec88a3f3b","observation_id":"7703e939-02c2-445b-a7fc-fd0a7a13bb3e","resolution":{"observed_at":"2026-08-12T15:29:25.026129Z","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-12T15:29:24.799957Z","title":"A probabilistic theory of pattern recognition , volume 31","venue":null,"work_id":null,"year":2013},"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":10,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.799957Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:abc23bf6ea67b37be4cd02d3f5ca09c4d101ff145f953ea5a6523289b6e4d0ce","observation_id":"3bed4a51-6d92-4c40-be78-bd70c9edfa8b","resolution":{"observed_at":"2026-08-12T15:29:24.799957Z","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-12T15:29:25.011415Z","title":"On the measure of voronoi cells","venue":null,"work_id":"2b541105-10a0-4734-ae6c-8739aa6bd07a","year":2017},"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":11,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.802876Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:2099037ce9425c0b15cc249b1dc1f19fb61156c06ddf9bf370d4c390e8d605a7","observation_id":"1b49bb49-ef87-4563-a519-3d9daf8c43fa","resolution":{"observed_at":"2026-08-12T15:29:25.013977Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:29:25.004368Z","title":"A geometric preferential attachment model of networks","venue":null,"work_id":"e08fed57-5fca-4c8c-a6f3-71e1eb07ad12","year":2006},"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":12,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.805836Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:30a953a09a0ce6d8e82f0e340c3b81f4be8df7119cf334bd0042da8ef41031e8","observation_id":"02b27bc2-9e9e-4611-b022-04a3cd9539c2","resolution":{"observed_at":"2026-08-12T15:29:25.007033Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:29:24.997436Z","title":"A spatial preferential attachment model with local clustering","venue":null,"work_id":"90c30cdf-74a2-4596-bcde-74b32a9f9818","year":2013},"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":13,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.808891Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:5e780db8b637b6e097bb08f5bd1a92177866d816ce9fec05046abb6d26cdf0b2","observation_id":"cd28654e-4607-4f18-99ee-5f7f3e27b334","resolution":{"observed_at":"2026-08-12T15:29:25.000036Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:29:24.990226Z","title":"Phase transitions for random geometric preferential attachment graphs","venue":null,"work_id":"fd5e3d77-2f0b-4dbb-93f9-58d473e62e96","year":2015},"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":14,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.811636Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:c31c0526d9221da15d9a8565c7cda149acf72772892063dc5e1807fdea863d88","observation_id":"52ebb431-46f4-4945-b4ad-eb0283174c22","resolution":{"observed_at":"2026-08-12T15:29:24.993050Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:29:24.983295Z","title":"New results for the random nearest neighbor tree","venue":null,"work_id":"2f17b57d-69a3-4cb3-b4fa-1afaa56b0d2e","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":15,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.814413Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:c0f44d10aea63aa5e060c56f84b4b48d8289e06ae1fda590559ebc05a9320092","observation_id":"a9506702-3c5a-4a3e-95ff-8cdad05e0bf2","resolution":{"observed_at":"2026-08-12T15:29:24.985949Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:29:24.975093Z","title":"Network archaeology: uncovering ancient networks from present-day interactions","venue":null,"work_id":"9a2813ce-e7aa-4532-bd51-dee97411cdf6","year":2011},"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":16,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.817632Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:08cee843a88b4dff7640923142c811b2802a832b2dd6544f0a431733b1d862d0","observation_id":"79ed43fd-a11a-4274-80f5-17a4116644a5","resolution":{"observed_at":"2026-08-12T15:29:24.978723Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:29:24.967545Z","title":null,"venue":null,"work_id":"651ebd63-37ad-4809-8832-877c15695f6d","year":1945},"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":17,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.820407Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:872dc420a2e05f4c12049b10d33ca85cdd83cef14b5c5e5c3945645b445b3a41","observation_id":"0643ef27-5da9-4725-9fb0-130b6e25a552","resolution":{"observed_at":"2026-08-12T15:29:24.970256Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:29:24.960870Z","title":"Limit theory for the random on-line nearest-neighbour graph","venue":null,"work_id":"b1a1374c-6624-42ed-be16-a785ac4913af","year":2006},"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":18,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.822967Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:6caa1dc10e9ebb4d41500d2b69467e1d46aab28a394ecba04600ea43b781473c","observation_id":"d109d544-085b-4df2-aa83-cbfef93906a2","resolution":{"observed_at":"2026-08-12T15:29:24.963161Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:29:24.954303Z","title":"Cost of sequential connection for points in space","venue":null,"work_id":"19f2a274-65fb-46c7-acb0-9a536d9d2261","year":1989},"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":19,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.824940Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:f9b19cd225069bfe9ceeb8e9cff590c93dadf18ea3c75e7aebaaa2f6ee2e6436","observation_id":"5b8f796d-75a2-4a4a-914b-c8dccc15129d","resolution":{"observed_at":"2026-08-12T15:29:24.956626Z","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":{"arxiv_id":"2212.03782","last_updated":"2022-12-07T17:05:29Z","snapshot_observed_at":"2026-08-17T04:34:09.430616Z","submitted_at":"2022-12-07T17:05:29Z","title":"Quantitative CLTs on the Poisson space via Skorohod estimates and $p$-Poincar\\'e inequalities","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.03782","snapshot_observed_at":"2026-08-12T15:29:24.826936Z","title":"Quantitative CLTs on the P oisson space via S korohod estimates and p - P oincar\\'e inequalities","venue":null,"work_id":null,"year":2022},"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":20,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.826936Z"},"links":{"cited_paper":"/paper/2212.03782","citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:bb05dc2ac460e6cc2ed291f168a97d2f6506bcbefd99d1cbbc7c694ee4ed712e","observation_id":"035de760-73d7-4610-b8c0-603f22ce4d78","resolution":{"observed_at":"2026-08-12T15:29:24.826936Z","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-12T15:29:24.946904Z","title":"Explicit laws of large numbers for random nearest-neighbour-type graphs","venue":null,"work_id":"a4120a9f-29aa-455b-ad68-4a3000f802cb","year":2007},"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":21,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.829324Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:09cf0f9cafc647e9c9eb6b58cb9a4a7bcd91cb9496b3d1ff924002a48ccd9aa9","observation_id":"4a9ce399-8d36-4424-9496-085a53989a8e","resolution":{"observed_at":"2026-08-12T15:29:24.950209Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:29:24.936461Z","title":"Asymptotic theory for the multidimensional random on-line nearest-neighbour graph","venue":null,"work_id":"003b89b6-6328-4d8e-8da4-5ffc4ba9f0e3","year":1911},"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":22,"source":"arxiv_source","source_observed_at":"2026-08-12T15:29:24.831261Z"},"links":{"citing_paper":"/paper/2411.14336"},"observation_digest":"sha256:d42f844b847c9eab672b5e3cb65a3b7368ceecf1a5cf553f1975c06c42e88513","observation_id":"f28c6fae-7000-4d80-8ed0-aa34040ee750","resolution":{"observed_at":"2026-08-12T15:29:24.941602Z","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"}}],"paper":{"arxiv_id":"2411.14336","last_updated":"2024-11-21T17:30:49Z","latest_version":1,"primary_category":"math.PR","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"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":18},"total_outbound_references":22},"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 22 of 22 outbound references and 1 inbound Pith citation observation for arXiv:2411.14336."}