{"as_of":"2026-08-11T13:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0274fc8390f7c9155494b9c935850fdef69f1bf87700837e3f2eae001e2f6224","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T07:42:30.976978Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2607.21428/citation-record","integrity":"/paper/2607.21428/integrity","json":"/paper/2607.21428/citation-record.json","paper":"/paper/2607.21428"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.18614","last_updated":"2026-07-13T18:02:06Z","snapshot_observed_at":"2026-08-09T21:28:16.122573Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.18614","snapshot_observed_at":"2026-08-01T07:42:26.041582Z","title":"Optimal root recovery for uniform attachment trees and","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:26.041582Z"},"links":{"cited_paper":"/paper/2411.18614","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:c9f5634c65b6a5f4af303098cd5ff31c272a547f190a4ccf4ea5150b6abd507b","observation_id":"a005e7d9-0953-4188-814c-bc43698665fa","resolution":{"observed_at":"2026-08-01T07:42:26.041582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.06481","last_updated":"2024-10-09T02:15:57Z","snapshot_observed_at":"2026-08-06T01:52:48.741271Z","submitted_at":"2024-10-09T02:15:57Z","title":"Leaf Stripping on Uniform Attachment Trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.06481","snapshot_observed_at":"2026-08-01T07:42:26.120972Z","title":"Leaf stripping on uniform attachment trees , journal =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:26.120972Z"},"links":{"cited_paper":"/paper/2410.06481","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:56bf8666b55f1f82d99b701e35bf9be6223dea9f6df7bc7c9192922aedda8161","observation_id":"6ed1c9cd-9680-43ee-8735-b4f3c727a6e4","resolution":{"observed_at":"2026-08-01T07:42:26.120972Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T07:42:26.192604Z","title":"The Annals of Applied Probability , volume =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:26.192604Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:db6f7e0259b526bf28f7753c16b24f444b37b99549756030a692a59a3fe46fcb","observation_id":"0c573f9e-597a-48e7-9a8a-60341c60d051","resolution":{"observed_at":"2026-08-01T07:42:26.192604Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.13785","last_updated":"2021-05-14T13:02:41Z","snapshot_observed_at":"2026-08-08T04:09:59.755638Z","submitted_at":"2020-04-28T19:33:35Z","title":"Persistence of hubs in growing random networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.13785","snapshot_observed_at":"2026-08-01T07:42:26.322034Z","title":"Probability Theory and Related Fields , volume =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:26.322034Z"},"links":{"cited_paper":"/paper/2004.13785","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:2ba9bb9f7832deac04023a59a0db289aaf55e97dd4a7dc8142261bbd87dd60eb","observation_id":"dac85538-6037-4554-8fd3-391962fcce85","resolution":{"observed_at":"2026-08-01T07:42:26.322034Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T07:42:26.412920Z","title":"Electronic Journal of Probability , volume =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:26.412920Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:7301b2a76d938bf7afd3149f22197438fd4dd51f207cdaad3b38ba4233909841","observation_id":"588d7eaa-9608-4562-915f-54df861a40d6","resolution":{"observed_at":"2026-08-01T07:42:26.412920Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T07:42:26.456285Z","title":"Random Structures & Algorithms , volume =","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:26.456285Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:655f7a24942343853833e047f6810793ddc2e5733afca0f4ec76384fd905c2b2","observation_id":"88636ea1-95d8-4b96-9acb-3319ae6c6941","resolution":{"observed_at":"2026-08-01T07:42:26.456285Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1305.4762","last_updated":"2013-05-21T09:19:11Z","snapshot_observed_at":"2026-07-06T03:13:50.081738Z","submitted_at":"2013-05-21T09:19:11Z","title":"On the non-Gaussian fluctuations of the giant cluster for percolation on random recursive trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1305.4762","snapshot_observed_at":"2026-08-01T07:42:26.559641Z","title":"Electronic Journal of Probability , volume =","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:26.559641Z"},"links":{"cited_paper":"/paper/1305.4762","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:5c9d7a5809a7e35a9dfc8d505c2a12c4143fa2098bd094150ce58ad8f91bc9e8","observation_id":"5d3f5293-eddd-4027-85d1-51c1f1652e4e","resolution":{"observed_at":"2026-08-01T07:42:26.559641Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T07:42:26.662733Z","title":"The phase transition in inhomogeneous random graphs , journal =","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:26.662733Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:6c2a376a35331089a9c45ac7ff82056731648e57b6460b5f72c0b7d75e56d1b4","observation_id":"f70d5010-0a46-4676-b44d-adb5ce9a13e5","resolution":{"observed_at":"2026-08-01T07:42:26.662733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.3317","last_updated":"2015-12-01T17:33:50Z","snapshot_observed_at":"2026-08-11T05:24:11.243361Z","submitted_at":"2014-11-12T20:50:31Z","title":"Finding Adam in random growing trees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.3317","snapshot_observed_at":"2026-08-01T07:42:26.725603Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:26.725603Z"},"links":{"cited_paper":"/paper/1411.3317","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:e2047de8be064357b4bd6cd487cd366676f1e594dce968224afccedb53ec36ee","observation_id":"6a00b0c7-b17a-40b9-b011-962e3b48cebd","resolution":{"observed_at":"2026-08-01T07:42:26.725603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1409.7685","last_updated":"2014-10-21T03:37:52Z","snapshot_observed_at":"2026-07-06T03:55:43.679494Z","submitted_at":"2014-09-26T19:53:26Z","title":"From trees to seeds: on the inference of the seed from large trees in the uniform attachment model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1409.7685","snapshot_observed_at":"2026-08-01T07:42:26.795973Z","title":"From trees to seeds: on the inference of the seed from large trees in the uniform attachment model , journal =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:26.795973Z"},"links":{"cited_paper":"/paper/1409.7685","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:1f4c0a9d23598de72733416b114573e310cae414b8cbf16e4cf0212509c0c171","observation_id":"0a745f3a-0e66-491f-9b0d-d1f12947fb38","resolution":{"observed_at":"2026-08-01T07:42:26.795973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.14601","last_updated":"2022-07-29T10:46:55Z","snapshot_observed_at":"2026-07-06T13:36:40.942885Z","submitted_at":"2022-07-29T10:46:55Z","title":"Archaeology of random recursive dags and Cooper-Frieze random networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.14601","snapshot_observed_at":"2026-08-01T07:42:26.964359Z","title":"Archaeology of random recursive dags and","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:26.964359Z"},"links":{"cited_paper":"/paper/2207.14601","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:18a82b524fff1169e6198f386ccc2d1f982fdafadba32b5a943651480ffc9c87","observation_id":"ad0bf795-989b-4dbc-a0c4-3845bd3f8ecf","resolution":{"observed_at":"2026-08-01T07:42:26.964359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.14336","last_updated":"2024-11-21T17:30:49Z","snapshot_observed_at":"2026-08-10T08:37:29.333627Z","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-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":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:738f9db874a803af8f0150275b175e5ea05562987a48bf45e46e3939c5adedd6","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"}},{"citation":{"cited_paper":{"arxiv_id":"2403.09755","last_updated":"2024-12-16T09:20:42Z","snapshot_observed_at":"2026-08-03T13:04:13.393977Z","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-01T07:42:27.112085Z","title":"Estimating the history of a random recursive tree , journal =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:27.112085Z"},"links":{"cited_paper":"/paper/2403.09755","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:d9830cefc12f6bfe48243e03f882d561c145a08838dca3ab62886f4b93ae2bbd","observation_id":"2971be49-d965-4242-827e-240713b3e5c6","resolution":{"observed_at":"2026-08-01T07:42:27.112085Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T07:42:27.234903Z","title":"A study of centrality measures in random recursive trees , journal =","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-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:27.234903Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:9437f428284a1a832c931296bcab5113fb27ded71d2b77808e7fe7ca9ebc52cf","observation_id":"f7d80d64-42d5-44a0-bb45-0d0fe048078d","resolution":{"observed_at":"2026-08-01T07:42:27.234903Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.24465","last_updated":"2026-06-23T11:58:20Z","snapshot_observed_at":"2026-08-09T08:42:08.459225Z","submitted_at":"2026-06-23T11:58:20Z","title":"History estimation in random recursive trees: Pointwise approach via iterated Jordan centralities","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.24465","snapshot_observed_at":"2026-08-01T07:42:27.494896Z","title":"History estimation in random recursive trees: Pointwise approach via iterated","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:27.494896Z"},"links":{"cited_paper":"/paper/2606.24465","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:c30ac3e04f082924099e332550ca29fdc55171db13e1ffe3e79f4e7287074986","observation_id":"3be6dc85-7420-42ef-8316-abc84619cb5c","resolution":{"observed_at":"2026-08-01T07:42:27.494896Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.00153","last_updated":"2023-02-07T15:18:21Z","snapshot_observed_at":"2026-08-08T12:27:12.108008Z","submitted_at":"2021-07-01T00:11:04Z","title":"Root and community inference on the latent growth process of a network","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.00153","snapshot_observed_at":"2026-08-01T07:42:27.698477Z","title":"Journal of the Royal Statistical Society Series B: Statistical Methodology , volume =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:27.698477Z"},"links":{"cited_paper":"/paper/2107.00153","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:ab43e4bd03c09ce331121bdbbb01c05160f7dfddda3a2f2a5a868de6b981b35e","observation_id":"b5ada376-4b07-40b6-86f2-bf8acd9cc8b5","resolution":{"observed_at":"2026-08-01T07:42:27.698477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08794","last_updated":"2021-01-13T19:24:59Z","snapshot_observed_at":"2026-08-11T04:22:21.002782Z","submitted_at":"2020-05-18T15:15:15Z","title":"Inference on the History of a Randomly Growing Tree","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.08794","snapshot_observed_at":"2026-08-01T07:42:27.891890Z","title":"Journal of the Royal Statistical Society Series B: Statistical Methodology , volume =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:27.891890Z"},"links":{"cited_paper":"/paper/2005.08794","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:ecd9b3931373ce9ef0cac3d1952980e78441deefc5b4b6f420bb1662b26b6564","observation_id":"9f31f85e-9102-43e9-92f4-0cbd1585ed62","resolution":{"observed_at":"2026-08-01T07:42:27.891890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.04752","last_updated":"2023-04-11T07:24:10Z","snapshot_observed_at":"2026-08-03T04:10:54.572215Z","submitted_at":"2023-03-08T17:39:03Z","title":"Eve, Adam and the Preferential Attachment Tree","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.04752","snapshot_observed_at":"2026-08-01T07:42:28.098236Z","title":"Probability Theory and Related Fields , volume =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:28.098236Z"},"links":{"cited_paper":"/paper/2303.04752","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:05644404020488946c6f5d300b040687f7422f7b6ec5b8d64deae7e7c3227896","observation_id":"4feb6d30-ed74-49bf-9b91-520de76ea29c","resolution":{"observed_at":"2026-08-01T07:42:28.098236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00969","last_updated":"2019-02-22T20:33:17Z","snapshot_observed_at":"2026-08-10T04:35:40.350317Z","submitted_at":"2018-10-01T20:41:52Z","title":"On the discovery of the seed in uniform attachment trees","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00969","snapshot_observed_at":"2026-08-01T07:42:28.287781Z","title":"Internet Mathematics , volume =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:28.287781Z"},"links":{"cited_paper":"/paper/1810.00969","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:aff60a9cfd4a1b6ce9f987805d92c4350c92cf474012933b32985268b5822324","observation_id":"a4bfd166-4f87-41c0-8339-a8adcbc126fb","resolution":{"observed_at":"2026-08-01T07:42:28.287781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.18201","last_updated":"2026-07-20T17:41:26Z","snapshot_observed_at":"2026-08-09T08:42:36.757322Z","submitted_at":"2026-07-20T17:41:26Z","title":"Finding Adam in noisy trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.18201","snapshot_observed_at":"2026-08-01T07:42:28.509599Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:28.509599Z"},"links":{"cited_paper":"/paper/2607.18201","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:d2c9b19c6f9fa70c0471e5cce9d7023b2f533ba6bee9c044fd04377a60a3de38","observation_id":"e4cdf70b-2b88-4fbf-9f1a-4f25e7d71539","resolution":{"observed_at":"2026-08-01T07:42:28.509599Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T07:42:28.676009Z","title":"2009 , doi =","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:28.676009Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:99897a927554f5f74719edc595dbae04b77afc2cea7548f5d7e28cd990d58365","observation_id":"f348e8e3-3242-4996-a6bc-32b7572ce445","resolution":{"observed_at":"2026-08-01T07:42:28.676009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.12515","last_updated":"2026-06-03T16:06:25Z","snapshot_observed_at":"2026-07-06T19:04:43.716629Z","submitted_at":"2024-08-22T16:12:27Z","title":"Size distribution of clusters in site-percolation on random recursive tree","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.12515","snapshot_observed_at":"2026-08-01T07:42:28.870416Z","title":"Acta Mathematica Sinica, English Series , 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-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:28.870416Z"},"links":{"cited_paper":"/paper/2408.12515","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:a40f696ec7639c61acda134980e81705fa6c94f0d393c301d5b66e7781ff53e0","observation_id":"6bfa817d-c6c6-48f4-8b75-29e57adaf10c","resolution":{"observed_at":"2026-08-01T07:42:28.870416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0708.4404","last_updated":"2008-08-21T11:47:12Z","snapshot_observed_at":"2026-08-11T04:43:21.802561Z","submitted_at":"2007-08-31T18:09:53Z","title":"The largest component in a subcritical random graph with a power law degree distribution","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0708.4404","snapshot_observed_at":"2026-08-01T07:42:29.031461Z","title":"The Annals of Applied Probability , volume =","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:29.031461Z"},"links":{"cited_paper":"/paper/0708.4404","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:8556e1cadd1ca5d45ca97dc74e1fe1d98baee98968f1fcbaf4fea0f16077a6c6","observation_id":"3230c353-1142-4c27-be26-4264e653f71a","resolution":{"observed_at":"2026-08-01T07:42:29.031461Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T07:42:29.251554Z","title":"1975 , isbn =","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:29.251554Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:f4220562acab5def221a885e2ef5884bf58117395eaca19d8db34e1009283098","observation_id":"99776789-2de2-451d-b6bf-9fc363e1c6f1","resolution":{"observed_at":"2026-08-01T07:42:29.251554Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T07:42:29.421656Z","title":"Advances in Applied Probability , volume =","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:29.421656Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:5abdcc0734df4941177c11473609cb1897aa7b0d30143b9064af09ab47824f06","observation_id":"b47913a7-000b-48b9-a1e0-be8b627082ef","resolution":{"observed_at":"2026-08-01T07:42:29.421656Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T07:42:29.585194Z","title":"Moments of general time dependent branching processes with applications , journal =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:29.585194Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:fa0df6f2b35284328ae851c2d7cad1910fe627756667e23e152cab78c22deb16","observation_id":"2bbded79-369f-4002-be81-57f276335874","resolution":{"observed_at":"2026-08-01T07:42:29.585194Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T07:42:29.741732Z","title":"Zeitschrift f","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:29.741732Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:52e60479b25aab0240b03697f1e7955627a2f147b8e74da9c1fd64d32bceaaa1","observation_id":"1457f333-a0c4-4a44-a204-a0ddf432338a","resolution":{"observed_at":"2026-08-01T07:42:29.741732Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T07:42:29.910812Z","title":"Random trees and general branching processes , journal =","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:29.910812Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:8f1ecca6f794d25d7c231e2337663c09636f8ea532aafc07114e8205fefeaec5","observation_id":"bd2cdcf7-72e2-4a1d-9b75-4f9e69827edd","resolution":{"observed_at":"2026-08-01T07:42:29.910812Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T07:42:30.076800Z","title":"Random Structures & Algorithms , volume =","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:30.076800Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:67986da6535000dffd48930cb2c6de0a75007bf063da81d03403fa8c66b1afa6","observation_id":"6fa83ec5-ccef-4ddd-a1d7-23b3b9b1c6ed","resolution":{"observed_at":"2026-08-01T07:42:30.076800Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07652","last_updated":"2019-05-18T22:10:14Z","snapshot_observed_at":"2026-07-06T07:53:57.005386Z","submitted_at":"2019-05-18T22:10:14Z","title":"On a Tail Bound for Root-Finding in Randomly Growing Trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.07652","snapshot_observed_at":"2026-08-01T07:42:30.210700Z","title":null,"venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:30.210700Z"},"links":{"cited_paper":"/paper/1905.07652","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:9e7816d3f223e0dadb02677d94d21bf7c5330c83879fbd3ae81c7e0a1ee51c7d","observation_id":"3f842f54-3cc7-4970-999f-588933c54365","resolution":{"observed_at":"2026-08-01T07:42:30.210700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1510.05461","last_updated":"2015-10-19T13:21:39Z","snapshot_observed_at":"2026-07-06T04:33:32.236092Z","submitted_at":"2015-10-19T13:21:39Z","title":"Confidence Sets for the Source of a Diffusion in Regular Trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.05461","snapshot_observed_at":"2026-08-01T07:42:30.313398Z","title":"IEEE Transactions on Network Science and Engineering , volume =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:30.313398Z"},"links":{"cited_paper":"/paper/1510.05461","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:86dd3a7cf896760dbe08c7354e4edc93976977e47a210a022c957e290123cb5c","observation_id":"e8555aa5-ab7a-4956-8e9c-8625ab19ef00","resolution":{"observed_at":"2026-08-01T07:42:30.313398Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.01816","last_updated":"2018-01-05T16:14:27Z","snapshot_observed_at":"2026-08-10T20:26:30.411553Z","submitted_at":"2018-01-05T16:14:27Z","title":"Finding the seed of uniform attachment trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.01816","snapshot_observed_at":"2026-08-01T07:42:30.494680Z","title":"Finding the seed of uniform attachment trees , journal =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:30.494680Z"},"links":{"cited_paper":"/paper/1801.01816","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:831a6c85766c8407283d758393dccfae33c2dbb95f28ac9fbd9f7e3c1d5a76c4","observation_id":"a7587450-ae3a-48d6-9d0a-81f21c12f88f","resolution":{"observed_at":"2026-08-01T07:42:30.494680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1008.5166","last_updated":"2010-08-30T21:00:27Z","snapshot_observed_at":"2026-08-10T14:59:48.982976Z","submitted_at":"2010-08-30T21:00:27Z","title":"Network Archaeology: Uncovering Ancient Networks from Present-day Interactions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1008.5166","snapshot_observed_at":"2026-08-01T07:42:30.578821Z","title":"PLoS Computational Biology , volume =","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:30.578821Z"},"links":{"cited_paper":"/paper/1008.5166","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:e93d7ebe2cfcf8b3473cf6f4e916eb5971f222d5e5ff1fd94bdc7186de5d340f","observation_id":"af6ec58b-6085-4568-a682-c01f54b4fa87","resolution":{"observed_at":"2026-08-01T07:42:30.578821Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0909.4370","last_updated":"2010-10-29T00:15:33Z","snapshot_observed_at":"2026-07-06T01:57:43.439537Z","submitted_at":"2009-09-24T17:45:29Z","title":"Rumors in a Network: Who's the Culprit?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0909.4370","snapshot_observed_at":"2026-08-01T07:42:30.690956Z","title":"IEEE Transactions on Information Theory , volume =","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:30.690956Z"},"links":{"cited_paper":"/paper/0909.4370","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:27d8f8fad6512d17f1ecab54c8298faa07c664264820e67f72269e2085fbfced","observation_id":"7add9d6a-77f0-4cb3-a003-f468f78206e0","resolution":{"observed_at":"2026-08-01T07:42:30.690956Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T07:42:30.768161Z","title":"and Mahmoud, Hosam M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:30.768161Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:4b8086d6c4b0e38c670b4ab918ba0051aaec453999957c1e45be497077268500","observation_id":"1ae7c608-fbb7-4cad-a361-573180f03ce8","resolution":{"observed_at":"2026-08-01T07:42:30.768161Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T07:42:30.887229Z","title":"2024 , doi =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:30.887229Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:7ac0ebf3d927f4540598874a7227e09b46f0a2aaf0b61149bbcc3fe84f4f758a","observation_id":"29677cc5-3190-41d3-9843-2456043c0442","resolution":{"observed_at":"2026-08-01T07:42:30.887229Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.09191","last_updated":"2019-12-20T17:31:02Z","snapshot_observed_at":"2026-08-10T12:26:36.295394Z","submitted_at":"2018-03-25T02:09:10Z","title":"Phase transition in the recoverability of network history","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.09191","snapshot_observed_at":"2026-08-01T07:42:30.976978Z","title":"Phase transition in the recoverability of network history , journal =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:30.976978Z"},"links":{"cited_paper":"/paper/1803.09191","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:92ebc3e43003e543a776276a4003ee7fa0c07a8f324173efe1c0331b92cdea7a","observation_id":"5f597719-4ba1-4b2a-b5c0-5c95a1cd74df","resolution":{"observed_at":"2026-08-01T07:42:30.976978Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","latest_version":1,"primary_category":"math.PR","snapshot_observed_at":"2026-08-04T16:47:45.871751Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":37,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":37},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2607.21428."}