Pith. sign in

Paper Citation Record · LEDGER

Finding the root in random nearest neighbor trees

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2411.14336 v1

Coverage vector

measured 22 of 22 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-12T15:29:24.831261Z

measured 23 of 23 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-01T07:42:27.060708Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

22 of 22 outbound references displayed

  • verified exact0
  • verified fuzzy18
  • unresolved4
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 01486a02-1c9d-4ec1-ab35-d8614464e000 · outbound

This paper cites Random partitions of the plane via poissonian coloring and a self-similar process of coalescing planar partitions.

Finding the root in random nearest neighbor trees Random partitions of the plane via poissonian coloring and a self-similar process of coalescing planar partitions

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:25.078752Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.772520Z digest=sha256:a2b7364597124ef89b0ac5029baf6e1628818705ccf235a8a807d9b9c51e3a44

Observation e4281de5-0bb6-4ce3-873e-d6c5c4fba97b · outbound

This paper cites Root finding algorithms and persistence of Jordan centrality in growing random trees.

Finding the root in random nearest neighbor trees Root finding algorithms and persistence of Jordan centrality in growing random trees

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:25.070953Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.776353Z digest=sha256:da59436388f0e01dc6f97efb607d1621183313d0296d3bfe205ad12a0fa43c8c

Observation 543e91fc-18f0-4b6a-9d02-69d3161e6cb9 · outbound

This paper cites Archaeology of random recursive dags and cooper-frieze random networks.

Finding the root in random nearest neighbor trees Archaeology of random recursive dags and cooper-frieze random networks

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:25.062738Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.779324Z digest=sha256:2086e4fb27e35f06b91d68c6a465dc19cd3d63001e25be6229651e41d258fd83

Observation 08bc6b81-e7fc-4f78-9d3a-db033934f1b3 · outbound

This paper cites Root estimation in galton--watson trees.

Finding the root in random nearest neighbor trees Root estimation in galton--watson trees

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:25.054491Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.782114Z digest=sha256:56f362ca16a7e3b00d78caaab32e62af0cb59a7c1efc5f4297734b0f5090f070

Observation 4d8fa7cd-cec9-4186-ba9d-1aae944f8a3d · outbound

This paper cites Finding Adam in random growing trees.

Finding the root in random nearest neighbor trees Finding Adam in random growing trees

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:25.046475Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.785300Z digest=sha256:4593b9b9d690fbf692ae5197416aae27e7736cd03fc1d61305ed077dbf56d9c1

Observation 2cb18b08-4eed-434d-a92c-7636e421dcc5 · outbound

This paper cites Estimating the history of a random recursive tree.

Finding the root in random nearest neighbor trees Estimating the history of a random recursive tree

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-12T15:29:24.788075Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T15:29:24.788075Z digest=sha256:7ee645866ab80928f05f8709a504b4d14a8418e354cb89ef874c05692db2e655

Observation a7381e37-c43f-40a4-ae3d-81304322e3e1 · outbound

This paper cites Degree centrality and root finding in growing random networks.

Finding the root in random nearest neighbor trees Degree centrality and root finding in growing random networks

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:25.039807Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.791183Z digest=sha256:0422e83d92d8dc2c3697d24d7e3a98d46626ceb0a291f7ca6e2ef6b2a32f1a8b

Observation 53276bf4-4f9d-4810-84cf-b78e0a34b2bd · outbound

This paper cites Eve, Adam and the preferential attachment tree.

Finding the root in random nearest neighbor trees Eve, Adam and the preferential attachment tree

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:25.033495Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.793956Z digest=sha256:65d8ca2e1fa694ffd535fd472e6c4b9d4d065965820fbfc85e8e3cae1691f97e

Observation 7703e939-02c2-445b-a7fc-fd0a7a13bb3e · outbound

This paper cites Inference on the history of a randomly growing tree.

Finding the root in random nearest neighbor trees Inference on the history of a randomly growing tree

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:25.026129Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.796815Z digest=sha256:4231043d2fabcac194f6b144f4ea08c655180f63c61a5914dcc150dec88a3f3b

Observation 3bed4a51-6d92-4c40-be78-bd70c9edfa8b · outbound

This paper cites A probabilistic theory of pattern recognition , volume 31.

Finding the root in random nearest neighbor trees A probabilistic theory of pattern recognition , volume 31

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-12T15:29:24.799957Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T15:29:24.799957Z digest=sha256:abc23bf6ea67b37be4cd02d3f5ca09c4d101ff145f953ea5a6523289b6e4d0ce

Observation 1b49bb49-ef87-4563-a519-3d9daf8c43fa · outbound

This paper cites On the measure of voronoi cells.

Finding the root in random nearest neighbor trees On the measure of voronoi cells

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:25.013977Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.802876Z digest=sha256:2099037ce9425c0b15cc249b1dc1f19fb61156c06ddf9bf370d4c390e8d605a7

Observation 02b27bc2-9e9e-4611-b022-04a3cd9539c2 · outbound

This paper cites A geometric preferential attachment model of networks.

Finding the root in random nearest neighbor trees A geometric preferential attachment model of networks

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:25.007033Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.805836Z digest=sha256:30a953a09a0ce6d8e82f0e340c3b81f4be8df7119cf334bd0042da8ef41031e8

Observation cd28654e-4607-4f18-99ee-5f7f3e27b334 · outbound

This paper cites A spatial preferential attachment model with local clustering.

Finding the root in random nearest neighbor trees A spatial preferential attachment model with local clustering

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:25.000036Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.808891Z digest=sha256:5e780db8b637b6e097bb08f5bd1a92177866d816ce9fec05046abb6d26cdf0b2

Observation 52ebb431-46f4-4945-b4ad-eb0283174c22 · outbound

This paper cites Phase transitions for random geometric preferential attachment graphs.

Finding the root in random nearest neighbor trees Phase transitions for random geometric preferential attachment graphs

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:24.993050Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.811636Z digest=sha256:c31c0526d9221da15d9a8565c7cda149acf72772892063dc5e1807fdea863d88

Observation a9506702-3c5a-4a3e-95ff-8cdad05e0bf2 · outbound

This paper cites New results for the random nearest neighbor tree.

Finding the root in random nearest neighbor trees New results for the random nearest neighbor tree

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:24.985949Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.814413Z digest=sha256:c0f44d10aea63aa5e060c56f84b4b48d8289e06ae1fda590559ebc05a9320092

Observation 79ed43fd-a11a-4274-80f5-17a4116644a5 · outbound

This paper cites Network archaeology: uncovering ancient networks from present-day interactions.

Finding the root in random nearest neighbor trees Network archaeology: uncovering ancient networks from present-day interactions

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:24.978723Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.817632Z digest=sha256:08cee843a88b4dff7640923142c811b2802a832b2dd6544f0a431733b1d862d0

Observation 0643ef27-5da9-4725-9fb0-130b6e25a552 · outbound

This paper cites an unresolved cited work.

Finding the root in random nearest neighbor trees Unresolved cited work

Reference 17

Resolution
unresolved
raw_fallback, observed 2026-08-12T15:29:24.970256Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.820407Z digest=sha256:872dc420a2e05f4c12049b10d33ca85cdd83cef14b5c5e5c3945645b445b3a41

Observation d109d544-085b-4df2-aa83-cbfef93906a2 · outbound

This paper cites Limit theory for the random on-line nearest-neighbour graph.

Finding the root in random nearest neighbor trees Limit theory for the random on-line nearest-neighbour graph

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:24.963161Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.822967Z digest=sha256:6caa1dc10e9ebb4d41500d2b69467e1d46aab28a394ecba04600ea43b781473c

Observation 5b8f796d-75a2-4a4a-914b-c8dccc15129d · outbound

This paper cites Cost of sequential connection for points in space.

Finding the root in random nearest neighbor trees Cost of sequential connection for points in space

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:24.956626Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.824940Z digest=sha256:f9b19cd225069bfe9ceeb8e9cff590c93dadf18ea3c75e7aebaaa2f6ee2e6436

Observation 035de760-73d7-4610-b8c0-603f22ce4d78 · outbound

This paper cites Quantitative CLTs on the Poisson space via Skorohod estimates and $p$-Poincar\'e inequalities.

Finding the root in random nearest neighbor trees Quantitative CLTs on the Poisson space via Skorohod estimates and $p$-Poincar\'e inequalities

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-12T15:29:24.826936Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T15:29:24.826936Z digest=sha256:bb05dc2ac460e6cc2ed291f168a97d2f6506bcbefd99d1cbbc7c694ee4ed712e

Observation 4a9ce399-8d36-4424-9496-085a53989a8e · outbound

This paper cites Explicit laws of large numbers for random nearest-neighbour-type graphs.

Finding the root in random nearest neighbor trees Explicit laws of large numbers for random nearest-neighbour-type graphs

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:24.950209Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.829324Z digest=sha256:09cf0f9cafc647e9c9eb6b58cb9a4a7bcd91cb9496b3d1ff924002a48ccd9aa9

Observation f28c6fae-7000-4d80-8ed0-aa34040ee750 · outbound

This paper cites Asymptotic theory for the multidimensional random on-line nearest-neighbour graph.

Finding the root in random nearest neighbor trees Asymptotic theory for the multidimensional random on-line nearest-neighbour graph

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:29:24.941602Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-12T15:29:24.831261Z digest=sha256:d42f844b847c9eab672b5e3cb65a3b7368ceecf1a5cf553f1975c06c42e88513

Pith citing papers

Observation 6944ded0-1153-4695-8e8f-c8183b075711 · inbound

Subcritical percolation and network archaeology on random recursive tree substrate networks cites this paper.

Subcritical percolation and network archaeology on random recursive tree substrate networks Finding the root in random nearest neighbor trees

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-01T07:42:27.060708Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T07:42:27.060708Z digest=sha256:0ac9fd117900bc22130c5414ec225feddc9ef246a361b0545758e436e1750621