{"as_of":"2026-08-12T14:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:42ac6bae27974c8383d49614ccfe60190c38596c1e34dc460d232c39dfa04dd7","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:12:06.514095Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2501.03195/citation-record","integrity":"/paper/2501.03195/integrity","json":"/paper/2501.03195/citation-record.json","paper":"/paper/2501.03195"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:07.317784Z","title":"A LDOUS , Asymptotic fringe distributions for general families of random trees , The Annals of Applied Probability, (1991), pp","venue":null,"work_id":"70e6d3c3-6740-48e2-8ba9-be69e26c3542","year":1991},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.354338Z"},"links":{"citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:7dd4b02d5dedf93446bfecd44650845c6d621c8caf754c957b99da57e3043a47","observation_id":"3e708b49-7c3f-4bf3-98cd-80fa7930be6b","resolution":{"observed_at":"2026-08-10T22:12:07.323619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:07.296370Z","title":"A LDOUS , A","venue":null,"work_id":"b23c6af4-0943-4f70-ab7b-b87a0dbd38dc","year":2023},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.374773Z"},"links":{"citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:8653c109449c44a8dbb987638dbb77a06a10cfa1368c1ef8ecca64a84fe0309f","observation_id":"727e1601-aef2-4c1c-badc-de98aa4a0eeb","resolution":{"observed_at":"2026-08-10T22:12:07.301125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:07.261135Z","title":null,"venue":null,"work_id":"cad2009b-7c05-400f-8686-29bc5cb510ce","year":1972},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.390974Z"},"links":{"citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:72fbbaf7c2716619692938883d8a5910727da3854ada6e4e6aedcc4539cea00d","observation_id":"cee3c894-78c8-4301-bce3-ae123984f4ac","resolution":{"observed_at":"2026-08-10T22:12:07.272117Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.15770","last_updated":"2021-03-29T17:03:08Z","snapshot_observed_at":"2026-08-12T14:04:02.457311Z","submitted_at":"2021-03-29T17:03:08Z","title":"Enumeration of fully parked trees","version":1},"cited_work":{"arxiv_id":"2103.15770","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.15770","snapshot_observed_at":"2026-08-10T22:12:06.628833Z","title":"Enumeration of fully parked trees","venue":"math.CO","work_id":"eac1c258-ac88-4da7-b856-8ce1af64b530","year":2021},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.400592Z"},"links":{"cited_paper":"/paper/2103.15770","citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:ac12be07e222e265e0279949a8b69bb36bdc9466b775763628c7dbb790979819","observation_id":"fcd755c0-1c4f-4c54-9c1b-29dc99fa591d","resolution":{"observed_at":"2026-08-10T22:12:06.636654Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:07.176884Z","title":"C HEN AND A","venue":null,"work_id":"06e47998-5725-4ddf-868e-d3d9b3d48b78","year":2024},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.412612Z"},"links":{"citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:debf75452eed995269f184e03a5062b45f0bc4a12de71356e6b53e2a981c6479","observation_id":"aa1547c9-d35d-466f-9dd8-18541034068e","resolution":{"observed_at":"2026-08-10T22:12:07.205719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:07.115292Z","title":"C HEN AND C","venue":null,"work_id":"df1bcee0-c930-4fa9-a167-5d174a381971","year":2021},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.423302Z"},"links":{"citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:951ca5a9e165363a68749f66dafb6dc8afabd6a9f2252afb2e8edf12cfc626f4","observation_id":"752670f3-5b43-4ac8-a17b-2b4555e0eb0c","resolution":{"observed_at":"2026-08-10T22:12:07.149882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:07.077302Z","title":"C ONTAT, Sharpness of the phase transition for parking on random trees , Random Structures & Algorithms, 61 (2022), pp","venue":null,"work_id":"7a053ebb-89c2-49c4-af23-3e4384040835","year":2022},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.430436Z"},"links":{"citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:91daa545003941ed5b2ae391f4dfdc62e19cd97feb0580c0b1da4c13213f5e85","observation_id":"711a6d77-f26c-40f7-a863-5a34394ae282","resolution":{"observed_at":"2026-08-10T22:12:07.091155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:07.035838Z","title":null,"venue":null,"work_id":"7c118176-40d9-4b13-b252-d403de4ae2bd","year":2023},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.436141Z"},"links":{"citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:9ab4d91e2cbe1521b2d608c18ab006603115174a34105701aca8ffb384e48169","observation_id":"d8ee5b99-c08c-4a0b-a235-f5755f8dd61d","resolution":{"observed_at":"2026-08-10T22:12:07.055176Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04472","last_updated":"2023-12-07T17:46:56Z","snapshot_observed_at":"2026-08-11T13:19:15.276409Z","submitted_at":"2023-12-07T17:46:56Z","title":"Parking on trees with a (random) given degree sequence and the Frozen configuration model","version":1},"cited_work":{"arxiv_id":"2312.04472","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.04472","snapshot_observed_at":"2026-08-10T22:12:06.597275Z","title":"Parking on trees with a (random) given degree sequence and the Frozen configuration model","venue":"math.PR","work_id":"6f84c8e4-2442-4b57-a438-91df21865b63","year":2023},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.441245Z"},"links":{"cited_paper":"/paper/2312.04472","citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:e673c3293d2119452fbd94a220671e91d78c7d4186cf0261e341923e7496ee29","observation_id":"531efec8-7584-4830-b460-5b77b8130659","resolution":{"observed_at":"2026-08-10T22:12:06.606149Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:06.953504Z","title":"C ONTAT AND N","venue":null,"work_id":"ecf1ad01-c53a-4d1d-b37c-d7c2b86f2df5","year":2023},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.448805Z"},"links":{"citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:d73cf507b346291267e8c45987e57720b36ab46e3e41f7ca4a30ff415f21381e","observation_id":"286ab29b-5ecf-4628-9789-6be4f2455635","resolution":{"observed_at":"2026-08-10T22:12:06.984752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19752","last_updated":"2024-12-27T17:21:41Z","snapshot_observed_at":"2026-08-11T03:27:55.271210Z","submitted_at":"2024-12-27T17:21:41Z","title":"A random walk among random graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19752","snapshot_observed_at":"2026-08-10T22:12:06.454435Z","title":"C URIEN , A random walk among random graphs , arXiv preprint arXiv:2412.19752, (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.454435Z"},"links":{"cited_paper":"/paper/2412.19752","citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:4e63aa2cc8d8584afef1cadfc363b507fd12299e6826ec74833691c816dce2b7","observation_id":"62f4ec70-6b07-4972-8efa-eeffa2eb482f","resolution":{"observed_at":"2026-08-10T22:12:06.454435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:06.874467Z","title":"C URIEN AND O","venue":null,"work_id":"94e90aec-9832-4c1c-b13e-b6bb3d9be990","year":2022},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.460738Z"},"links":{"citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:16feae40fe1052ef2840c375e5bc2ef7f9d7538663289495c484bda6aedc4148","observation_id":"8bd52681-7c56-4744-8a1e-36c4a5bbff42","resolution":{"observed_at":"2026-08-10T22:12:06.894755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:06.842122Z","title":"D EVROYE AND J","venue":null,"work_id":"4c2bd14e-6f13-456f-99b4-87ba4df0fc0b","year":1995},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.467514Z"},"links":{"citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:ec05b8cbe7b6ad29b256d2533bfa06055e5a9689d92985787cb3caf68ff3825d","observation_id":"2c1a22cb-dd22-4bd8-9db8-2c7a1613bd60","resolution":{"observed_at":"2026-08-10T22:12:06.847161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:06.821595Z","title":"D RMOTA, Random trees: an interplay between combinatorics and probability , Springer Science & Business Media, 2009","venue":null,"work_id":"eb155efe-a99b-44b7-9fc1-09457d2aea87","year":2009},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.473309Z"},"links":{"citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:3fe951f3c0a9197015415de988a3710f1a22892a99fe2caecb1301efe12e4c6c","observation_id":"021a6573-ec34-40ec-8131-f1d753e9335c","resolution":{"observed_at":"2026-08-10T22:12:06.828834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:06.751264Z","title":"G OLDSCHMIDT AND M","venue":null,"work_id":"7841d251-448a-4ab7-a147-2e3dfbdfe861","year":2019},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.479033Z"},"links":{"citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:b129580a58437115ee126bd68dd514043c19f9c64196656cbf18456b4212d68b","observation_id":"c0f8ba02-fcf3-40be-a570-082ad1bd0ba3","resolution":{"observed_at":"2026-08-10T22:12:06.757105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:06.709980Z","title":"H OLMGREN AND S","venue":null,"work_id":"adb247ff-5fa9-434a-abf9-3a68c80c9109","year":2017},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.491516Z"},"links":{"citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:86b1e39fe5738fcdca01c9e3779c4459f0b02ef98845637f9b606ffca8f5bf8d","observation_id":"ea62dc43-ce32-481d-ba10-d234d46c8ff4","resolution":{"observed_at":"2026-08-10T22:12:06.720008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:06.690801Z","title":null,"venue":null,"work_id":"745fd752-f0d8-4b09-8971-5141229927d1","year":1966},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.505549Z"},"links":{"citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:abc10006c489df76e612fd0bf3fa6bea7a56439a54bf46df675e9a9a2e0774a7","observation_id":"cb6b520b-4c77-4a93-a28d-31abdd25fafd","resolution":{"observed_at":"2026-08-10T22:12:06.696004Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:06.653927Z","title":"L ACKNER AND A","venue":null,"work_id":"3ad90380-c438-422f-a965-301c9b525f4b","year":2016},"citing_paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:06.514095Z"},"links":{"citing_paper":"/paper/2501.03195"},"observation_digest":"sha256:1ef12271426f34ec01f634c2519c4cc49d77b54a9bf310afafbf6450b45ddd77","observation_id":"aa7eaacc-378a-48a9-8da8-ff3c26bcdee8","resolution":{"observed_at":"2026-08-10T22:12:06.670118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.03195","last_updated":"2025-01-06T18:13:21Z","latest_version":1,"primary_category":"math.PR","snapshot_observed_at":"2026-08-10T21:50:43.969685Z","submitted_at":"2025-01-06T18:13:21Z","title":"Parking on the Random Recursive Tree"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":2,"verified_fuzzy":12},"total_outbound_references":18},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2501.03195."}