{"as_of":"2026-08-20T01:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ea14aaabf936f8fb1d5bb78341bbf7f4113f5d5e0fede4cf4e573c6006225897","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T12:38:00.747958Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-25T22:52:59.897614Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-04T18:30:01.205955Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"cited_work":{"arxiv_id":"2606.02472","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.02472","snapshot_observed_at":"2026-07-04T18:30:01.205955Z","title":"Correlated uniform attachment trees","venue":"math.PR","work_id":"a5a364cf-4d5d-4db4-baea-d5455d7b28ef","year":2026},"citing_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},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-25T22:52:59.897614Z"},"links":{"cited_paper":"/paper/2606.02472","citing_paper":"/paper/2606.24465"},"observation_digest":"sha256:b012f26f2705f03098ea9b6a789d310cf80f7e449984ab46453aa8c0b4fc6788","observation_id":"f176e140-a2ab-4019-8d24-133ab20ae74c","resolution":{"observed_at":"2026-07-04T18:30:01.207565Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2606.02472/citation-record","integrity":"/paper/2606.02472/integrity","json":"/paper/2606.02472/citation-record.json","paper":"/paper/2606.02472"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T12:38:00.747958Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:794ba4046542b1044c3bc505da3b908788042dba44c809514b6383a8a66262c0","observation_id":"87c016f4-f4f3-4656-9400-0dc91a9829a0","resolution":{"observed_at":"2026-06-28T12:38:00.747958Z","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-06-28T12:38:00.747958Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:f052b62b25f92cce69353b44e44bfbe39d672a5c585de86e4308d7491fab9378","observation_id":"2b9683bc-34f8-4555-9c1b-f93b46cda231","resolution":{"observed_at":"2026-06-28T12:38:00.747958Z","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-06-28T12:38:00.747958Z","title":"double cycles","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:cff92ab9e684c044dfb5f3acba0caadda0d43227fee21667ad999340ce382fcb","observation_id":"6dd3734a-7e72-4f15-9551-9a5f6fd1a54d","resolution":{"observed_at":"2026-06-28T12:38:00.747958Z","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-06-28T12:38:00.747958Z","title":"Theorem 2.1.LetT n ∼UA(n)and recall thatA K :=A K(n)denotes the set of theKmost central vertices inT n","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:03467c59f5d92ce3427d3659f32860b92b59c556ba8dd7a0fdb9696365e557a9","observation_id":"9eecc086-95df-4c4a-b7fc-fe30cbe6932a","resolution":{"observed_at":"2026-06-28T12:38:00.747958Z","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-06-28T12:38:00.747958Z","title":"Dividing both sides by log(n) proves the result","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:2667d8bed61ba653f7bb06ce8b92b95918cd66feb168a1d491130c60b019a3a4","observation_id":"1baef39e-c083-413b-9107-797896621c97","resolution":{"observed_at":"2026-06-28T12:38:00.747958Z","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-06-28T12:38:00.747958Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:668c94aa0cfbb3ec2d6e51103c19abe2873dc096063662533a6c6423f67e9ab6","observation_id":"91e77344-4081-47ef-94c5-49a718772e24","resolution":{"observed_at":"2026-06-28T12:38:00.747958Z","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-06-28T12:38:00.747958Z","title":", Rmℓ+1)g(Rm1,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:7e2ec9eeea2d24761da77f57a817945866b723663deaab82047af798f96efd8e","observation_id":"44b13183-7342-49bf-9466-f4a203b1b597","resolution":{"observed_at":"2026-06-28T12:38:00.747958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":"2411.18614","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.18614","snapshot_observed_at":"2026-07-15T00:21:10.980381Z","title":"Addario-Berry, C","venue":null,"work_id":"1be0ca2a-8070-4538-889f-800c81861fbb","year":2024},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"cited_paper":"/paper/2411.18614","citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:2cf13cf6899464d6a459ceb050d31c78d878e778ecfb83dba8df15df0e90200c","observation_id":"1f5ae4f3-8c5c-4a77-b4db-bd6108ec332f","resolution":{"observed_at":"2026-07-15T00:21:10.980381Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.12293","last_updated":"2025-06-29T21:18:24Z","snapshot_observed_at":"2026-08-18T16:47:02.626604Z","submitted_at":"2024-05-20T18:01:11Z","title":"Aligning Multiple Inhomogeneous Random Graphs: Fundamental Limits of Exact Recovery","version":2},"cited_work":{"arxiv_id":"2405.12293","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12293","snapshot_observed_at":"2026-07-03T16:28:38.789613Z","title":"and Hajek, B","venue":null,"work_id":"6c356315-6a95-4e89-aa61-9e1b6bf488ab","year":2024},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"cited_paper":"/paper/2405.12293","citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:13b8de6caf4cb7bc0cefe7d6c9b61bd9715ce3b261e08d043d1bd6351cf83c7a","observation_id":"0c343699-ba98-4481-bc7f-2998462fb2df","resolution":{"observed_at":"2026-07-02T01:06:24.502654Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T12:38:00.747958Z","title":"B¨ aumler, C","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:07baf9c9a187032b7e3e5f95ee8a7a41e1acea47146786a59672907f3bf63356","observation_id":"bb9da1d3-c06d-48b6-bc27-101d9dd6ff03","resolution":{"observed_at":"2026-06-28T12:38:00.747958Z","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-06-28T12:38:00.747958Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:57d25fa56d8cbcb61a2ee1b46cd11e79c4cea0ef9d28c873c824139aa2d93be8","observation_id":"e169bb42-658f-47e3-8dc7-6370fa01fd1e","resolution":{"observed_at":"2026-06-28T12:38:00.747958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.06783","last_updated":"2018-05-14T04:27:12Z","snapshot_observed_at":"2026-08-16T07:38:32.245373Z","submitted_at":"2017-11-18T00:57:18Z","title":"Exact alignment recovery for correlated Erd\\H{o}s-R\\'enyi graphs","version":2},"cited_work":{"arxiv_id":"1711.06783","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.06783","snapshot_observed_at":"2026-07-03T16:28:38.790966Z","title":"Exact alignment recovery for correlated Erd\\H{o}s-R\\'enyi graphs","venue":"cs.IT","work_id":"c2b5bab0-5f93-4201-bf02-c62c9ed66cef","year":2017},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"cited_paper":"/paper/1711.06783","citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:5d1a53905db0b1837e0d3410c77cf7302e71d25840ed107674b6e8f7b6fa681e","observation_id":"ab36a23a-94f6-4bb5-9455-9b4fb000a352","resolution":{"observed_at":"2026-07-02T01:06:24.498022Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T12:38:00.747958Z","title":"Ganassali, L","venue":null,"work_id":null,"year":2080},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:94b709b850255551af1f71748dfa4806f6dc5f1d156a3401b9c095d11315085d","observation_id":"5de8b460-e729-4c43-a70f-e1b7db227862","resolution":{"observed_at":"2026-06-28T12:38:00.747958Z","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":"2603.19493","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T01:06:24.495671Z","title":null,"venue":null,"work_id":"76978752-9e4b-4dda-b73c-b4776828a2c3","year":null},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:2d88d309048f4787d58eebcc9bb8e4f9e964c6d5af8782cc6f629cfc3dd2528d","observation_id":"0beb1dac-6927-427b-895a-5177018628d9","resolution":{"observed_at":"2026-07-02T01:06:24.497225Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1214/19-ejp268","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2, 5, 6, 7 V","venue":"Electronic Journal of Probability","work_id":"1b9d8f44-dbe2-4576-a6bc-3cb850732399","year":null},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:1ea13ddd2762570be8b38a4f832a02d20aa5047127745b91f5e068fa84a0ad67","observation_id":"5452de3d-00e7-4a9f-8ef0-78143476ae15","resolution":{"observed_at":"2026-06-28T12:42:08.733253Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/sp.2009.22","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Narayanan and V","venue":null,"work_id":"b98dc524-8749-431d-9486-b450f11b6e50","year":2009},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:93bbd5c7545b738094fbe11ee36f8d1180caa5aa10a74fa6d1c5699d29cff419","observation_id":"54235b92-e2a1-4f7d-aad0-080627b5ecea","resolution":{"observed_at":"2026-06-28T12:42:08.729840Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-07-11T17:50:27.57702+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T17:50:27.57702+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T12:38:00.747958Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:d5d989c076482fe8eb36bd7b45abbc9092bdbdc69978bafad5409d864e27e06c","observation_id":"4fea18a9-629b-4143-bd07-a7ecb6be66cb","resolution":{"observed_at":"2026-06-28T12:38:00.747958Z","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-06-28T12:38:00.747958Z","title":"Yang and H","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:feb8fa239dbae0b08a0f958ef379bbddba64d4c4b610ec40d8ebbaa7ddbd802b","observation_id":"6cefee6d-ba6c-4b69-83e0-c67adbb9382e","resolution":{"observed_at":"2026-06-28T12:38:00.747958Z","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-06-28T12:38:00.747958Z","title":null,"venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:061704918e551d570144e670c574526becd3c117df6e716a9d3bf0c861b27a12","observation_id":"c0cb070f-a430-4ac2-a563-b4209843c0ae","resolution":{"observed_at":"2026-06-28T12:38:00.747958Z","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-06-28T12:38:00.747958Z","title":"44 The form of the matrixQis computed based on the stochastic approximation results of Hernandez and Spall (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T12:38:00.747958Z"},"links":{"citing_paper":"/paper/2606.02472"},"observation_digest":"sha256:83bf1659d49c6da34bc01c8218131323f22446e97f46fe4fbfead5db1a7a23d3","observation_id":"488734e7-d96e-4054-8a1b-a0ea257f0cfd","resolution":{"observed_at":"2026-06-28T12:38:00.747958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.02472","last_updated":"2026-06-01T16:45:18Z","latest_version":1,"primary_category":"math.PR","snapshot_observed_at":"2026-08-16T09:44:28.422743Z","submitted_at":"2026-06-01T16:45:18Z","title":"Correlated uniform attachment trees"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":20},"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 20 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 1 inbound Pith citation observation for arXiv:2606.02472."}