{"as_of":"2026-08-19T17:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0d23a9154319f03a416ed4f36a4aefd9f4540b5c8f2fad036cb869395a00cd6b","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-19T06:32:44.657259+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-18T02:09:53.602153Z","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.18614","snapshot_observed_at":"2026-08-01T07:42:26.041582Z","title":"Optimal root recovery for uniform attachment trees and","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.21428","last_updated":"2026-07-23T15:31:12Z","snapshot_observed_at":"2026-08-18T22:27:52.847788Z","submitted_at":"2026-07-23T15:31:12Z","title":"Subcritical percolation and network archaeology on random recursive tree substrate networks","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:26.041582Z"},"links":{"cited_paper":"/paper/2411.18614","citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:8b4826ff13780fdb19a9ebc6d0306d0a9b163becc587f0e9e7b0e04957795e6c","observation_id":"a005e7d9-0953-4188-814c-bc43698665fa","resolution":{"observed_at":"2026-08-01T07:42:26.041582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.06481","last_updated":"2024-10-09T02:15:57Z","snapshot_observed_at":"2026-08-16T13:11:18.321524Z","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-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":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:e75fb8cfb36aa3413a1102e5c56c82e48b6dbf52907c8384c3a02fc763bde48d","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-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":3,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:26.192604Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:0224b00ccff4cd29c5a0ec58c95b4e8950241d05ab7728f1f0151161bc40a559","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-12T13:49:48.607447Z","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-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":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:aac7108e5a30500937d0dd24dd6e1c570bcc313deb4b2adfa3859cbf94a1536f","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-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":5,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:26.412920Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:bf92e95fd8954a911dac8dd727a53b1e06353d099d92ce34d52978af68263f94","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-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":6,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:26.456285Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:3cf73c41480ae96cfd3202904638171fb119cb3d477903d6695dc852797aedc7","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-08-15T00:17:10.481845Z","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-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":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:411ee59c15f2815ed40c25ee54bcbbf8aa6e5a4a91559c1c53a01112a3056fdf","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-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":8,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:26.662733Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:637732a68f91a2801e5588a6f667501fdc1a44f65cd502acd30878967a9bdb60","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-14T23:11:52.795044Z","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-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":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:066f7b5639136d3ff789cd78b30ad9216a731d3e855d50c886839b6fe80f100c","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-08-14T23:17:56.036191Z","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-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":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:85995dc943645fb4add32292cfc32d903a9165d791da771b025be054f4a5ae6c","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-08-16T16:42:28.650036Z","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-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":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:4912c4d96526654a344972dec96a9cd5c4e67a87e152c76aadc174373572b582","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-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"}},{"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-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-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":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:b5327cd0d14baa1be94b39010088c20d3277a3c2df2524e3bd6c16a55231fa80","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-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":14,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:27.234903Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:fb3ebba4140285945984b02a3723277dd5ef8d5a888cc67bb86c28868cf9b9f6","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-15T21:39:33.057295Z","submitted_at":"2026-06-23T11:58:20Z","title":"History estimation in random recursive trees: Pointwise approach via iterated Jordan centralities","version":1},"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-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":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:b04709dc298abd9a8e0b51f161346fa34254e8581f76c6b359e7d90cb5a4dd9e","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-16T18:13:09.762508Z","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-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":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:ecaf9d9058b255910f8f6d487f5177b06de70200a8dfc708d485448f5c50ff40","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-13T01:02:07.546543Z","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-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":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:394a3eade238368c1e8f21b3214d7303697320ab021ee1eb7c88c9a104dc9203","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-16T15:49:45.837868Z","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-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":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:5e9199719001f0d105cee5025d5ebbaec9d7e0dc1453356d0ac4225c640c97be","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-14T18:20:53.562707Z","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-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":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:151cdffce00c80fa7930d4371115311eec0d2652e138f2fdb16256d9bcc8a8ec","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-18T02:57:34.227871Z","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-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":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:d10cfbb07e96bb57cad82169d1786f946505dce83afe69aa65c7ce57b9b0c833","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-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":21,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:28.676009Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:1cc84c5ad4f91da4eaf30e8fc2bb35177ca1921c5708217d4f6a53ffb6654d80","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-08-16T13:24:32.864492Z","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-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":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:a6863a1e61cc49c901cbaa64df2464f5c9d3e86c987490bd52b622c2faec6967","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-15T10:33:13.417688Z","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-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":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:8f8116b180653ffb67d6feb4e75a23770fddd4e4d84d0d2878a65b3569eba711","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-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":24,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:29.251554Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:949cb64c54aa8ae81c337a3c698e70e1fdca73172391a2855fb9872013cb7dde","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-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":25,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:29.421656Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:cb3264661392ea4eadda2f7aea4b6f46bfe143d044988265ec1a66702fdc4569","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-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":26,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:29.585194Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:123df66b000dbfec711fe5f5b251e21d4bd46e5be959c34565fedb385ed192c6","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-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":27,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:29.741732Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:9cea4cfcee12047a023114a25c48a5dac63e2b652b5588a1e4c4cc3d0d77d646","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-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":28,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:29.910812Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:db263a89502043e5c0e710bff9dfd81d5162273195ca33216cc6eef870a9f4a0","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-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":29,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:30.076800Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:d752470368e05d64f8089a7b1878e0573f123436164ec4237ee72e6499bd7434","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-08-14T16:30:12.462502Z","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-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":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:b2681a6883f5145ed9723929c81a12b33edd9a69152582f447ac48b3d4c9fceb","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-08-19T16:29:16.623895Z","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-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":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:74766a96fcce2ed4dd7158a6dd83178bad8fafba47f38f8636ad3f17c16c0633","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-14T19:57:39.829374Z","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-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":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:5175676b5a6171739507db9f45f47e18a7270710a14944fd52bdca8d34db2208","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-16T16:17:46.086570Z","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-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":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:a309a9b7e0e0a0933ed8b8e44e1a0f3eb08eb9b1c40b12dd901c927e297df30b","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-08-15T05:38:18.815735Z","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-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":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:567c0b4e241e30eb07b5635951c1ec3fa16e89974c961d28ddf059c2a681cf9f","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-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":35,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:30.768161Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:90ab5b92c14d96d4be982234f2ad9bca497e1a9f74906b62cb50ab1826eaec6f","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-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":36,"source":"arxiv_source","source_observed_at":"2026-08-01T07:42:30.887229Z"},"links":{"citing_paper":"/paper/2607.21428"},"observation_digest":"sha256:f183ee30c733c36086460cd4a92d820aa43ee26ad973add7efa00081a9136b48","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-14T19:32:48.615663Z","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-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":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:9fe4e26f491dd1faca087e6ccb4058d1f3f5f163a116815d5d476bf3301c2f13","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-18T22:27:52.847788Z","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-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 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2607.21428."}