Paper Citation Record · LEDGER

Optimal root recovery for uniform attachment trees and $d$-regular growing trees

As of 19 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 4 inbound Pith citation observations for arXiv:2411.18614.

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

pith.paper-citation-record.v1
2411.18614 v2

Coverage vector

measured 19 of 19 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-12T11:07:42.704066Z

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 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-01T15:51:19.297617Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-04T18:30:01.203081Z

Reference resolution

19 of 19 outbound references displayed

verified exact10
verified fuzzy1
unresolved6
parse uncertain0
malformed identifier1
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 55f3b54a-6933-4c20-91b1-4a3607b291e4 · outbound

This paper cites Convex transform order of beta distributions with some consequences.

Optimal root recovery for uniform attachment trees and $d$-regular growing trees Convex transform order of beta distributions with some consequences

Reference 1

Resolution: verified exact; doi, observed 2026-08-12T11:07:42.905574Z

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.

Observation 668b77a6-ad51-4daa-8c9e-b7843d94c342 · outbound

This paper cites an unresolved cited work.

Optimal root recovery for uniform attachment trees and $d$-regular growing trees Unresolved cited work

Reference 2

Resolution: unresolved; raw_fallback, observed 2026-08-12T11:07:43.295136Z

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.

Observation ec10b9bc-3c66-470a-8a7c-a2280a585c5e · outbound

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

Optimal root recovery for uniform attachment trees and $d$-regular growing trees Root finding algorithms and persistence of Jordan centrality in growing random trees

Reference 3

Resolution: verified exact; doi, observed 2026-08-12T11:07:42.889324Z

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.

Observation 55e0732f-f315-46a4-b333-db3c5f91527f · outbound

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

Optimal root recovery for uniform attachment trees and $d$-regular growing trees Degree centrality and root finding in growing random networks

Reference 4

Resolution: verified exact; doi, observed 2026-08-12T11:07:42.874029Z

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.

Observation e585681b-9e3d-4125-a2c2-feee20a5b528 · outbound

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

Optimal root recovery for uniform attachment trees and $d$-regular growing trees Archaeology of random recursive dags and cooper-frieze random networks

Reference 5

Resolution: verified exact; doi, observed 2026-08-12T11:07:42.858947Z

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.

Observation e8bb40b0-7681-4126-b571-a963da5ab570 · outbound

This paper cites an unresolved cited work.

Optimal root recovery for uniform attachment trees and $d$-regular growing trees Unresolved cited work

Reference 6

Resolution: metadata mismatch; raw_fallback, observed 2026-08-12T11:07:43.248472Z

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.

Observation ffd536f4-a812-418d-b244-473edb12f360 · outbound

This paper cites Finding Adam in random growing trees.

Optimal root recovery for uniform attachment trees and $d$-regular growing trees Finding Adam in random growing trees

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-12T11:07:42.647717Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08c4c66e-2ef2-4771-8767-16a778748b81 · outbound

This paper cites Smoothing Equations for Large P´ olya Urns.

Optimal root recovery for uniform attachment trees and $d$-regular growing trees Smoothing Equations for Large P´ olya Urns

Reference 8

Resolution: verified exact; doi, observed 2026-08-12T11:07:42.830870Z

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.

Observation 521388ad-b33e-4140-937d-f56efd514be1 · outbound

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

Optimal root recovery for uniform attachment trees and $d$-regular growing trees Eve, Adam and the preferential attachment tree

Reference 9

Resolution: verified exact; doi, observed 2026-08-12T11:07:42.813639Z

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.

Observation dbdff718-6f92-4143-aab1-45ce9614202c · outbound

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

Optimal root recovery for uniform attachment trees and $d$-regular growing trees Inference on the history of a randomly growing tree

Reference 10

Resolution: verified exact; doi, observed 2026-08-12T11:07:42.797904Z

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.

Observation 5d98317f-5246-48da-bfbd-c5f55a8892ef · outbound

This paper cites Scaling limits and influence of the seed graph in preferential attachment trees.

Optimal root recovery for uniform attachment trees and $d$-regular growing trees Scaling limits and influence of the seed graph in preferential attachment trees

Reference 11

Resolution: verified exact; doi, observed 2026-08-12T11:07:42.782935Z

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.

Observation dd27af24-77d1-4da5-b1d7-6ba0b6927415 · outbound

This paper cites On an elementary proof of some asymptotic formulas in the theory of partitions.

Optimal root recovery for uniform attachment trees and $d$-regular growing trees On an elementary proof of some asymptotic formulas in the theory of partitions

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-12T11:07:42.671233Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c95c9650-a666-45f4-b8a1-34c854cb6ed4 · outbound

This paper cites Looking for vertex number one.

Optimal root recovery for uniform attachment trees and $d$-regular growing trees Looking for vertex number one

Reference 13

Resolution: verified exact; doi, observed 2026-08-12T11:07:42.767115Z

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.

Observation d1c833d8-8467-498b-a6b5-5a594545896c · outbound

This paper cites an unresolved cited work.

Optimal root recovery for uniform attachment trees and $d$-regular growing trees Unresolved cited work

Reference 14

Resolution: unresolved; raw_fallback, observed 2026-08-12T11:07:43.279638Z

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.

Observation 75d58db5-b1a4-4a44-a27e-c47fbed13888 · outbound

This paper cites Confidence sets for the source of a diffusion in regular trees.

Optimal root recovery for uniform attachment trees and $d$-regular growing trees Confidence sets for the source of a diffusion in regular trees

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-12T11:07:42.685498Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 67aa52de-3ca7-43ee-8156-93997319991d · outbound

This paper cites Comparability of special distributions.

Optimal root recovery for uniform attachment trees and $d$-regular growing trees Comparability of special distributions

Reference 16

Resolution: verified exact; doi, observed 2026-08-12T11:07:42.751346Z

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.

Observation 8bf18dc7-3db1-450b-9b54-3d6af815892f · outbound

This paper cites On the discovery of the seed in uniform attachment trees.

Optimal root recovery for uniform attachment trees and $d$-regular growing trees On the discovery of the seed in uniform attachment trees

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-12T11:07:42.694581Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 89a1ff82-ac05-4549-a707-62cd33034fd5 · outbound

This paper cites Persistence of hubs in growing random networks.

Optimal root recovery for uniform attachment trees and $d$-regular growing trees Persistence of hubs in growing random networks

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:07:43.264310Z

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.

Observation cdb614d3-2f18-462b-9648-e8789e5eadba · outbound

This paper cites Rumors in a network: Who’s the culprit? IEEE Transactions on Information Theory , 57(8):5163 – 5181, 2011.

Optimal root recovery for uniform attachment trees and $d$-regular growing trees Rumors in a network: Who’s the culprit? IEEE Transactions on Information Theory , 57(8):5163 – 5181, 2011

Reference 19

Resolution: malformed identifier; no resolver link, observed 2026-08-12T11:07:42.704066Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation 1f5ae4f3-8c5c-4a77-b4db-bd6108ec332f · inbound

Correlated uniform attachment trees cites this paper.

Reference 8

Resolution: verified exact; arxiv_id, observed 2026-07-15T00:21:10.980381Z

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.

Observation 1b8482f5-f240-481d-b830-a115c5ff6e40 · inbound

History estimation in random recursive trees: Pointwise approach via iterated Jordan centralities cites this paper.

History estimation in random recursive trees: Pointwise approach via iterated Jordan centralities Optimal root recovery for uniform attachment trees and $d$-regular growing trees

Reference 2

Resolution: verified exact; arxiv_id, observed 2026-07-15T00:21:10.980381Z

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.

Observation b3f1038e-c06a-4fd4-94db-65ad9ea30a52 · inbound

Finding Adam in noisy trees cites this paper.

Finding Adam in noisy trees Optimal root recovery for uniform attachment trees and $d$-regular growing trees

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-01T15:51:19.297617Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a005e7d9-0953-4188-814c-bc43698665fa · 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 Optimal root recovery for uniform attachment trees and $d$-regular growing trees

Reference 1

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.