{"as_of":"2026-08-20T23:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:054377dee03626028afc2f334560fdc7c429f78bcbff6e8c6f8341dd068e4a3b","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T08:47:45.659668Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2606.03442/citation-record","integrity":"/paper/2606.03442/integrity","json":"/paper/2606.03442/citation-record.json","paper":"/paper/2606.03442"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:47:45.659668Z","title":"Stein’s method meets computational statistics: A review of some recent developments","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:8f3ad56781f998bf5407f8759dc41c6f7493760b4427609ed882677b81f16e00","observation_id":"90860cf9-b2f5-4d16-bdcf-d96de36ea69c","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"A normal approximation for the number of local maxima of a random function on a graph","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:f1cc8637a8bb8f426af9b67eb050b4f609f18faf1723a1a20563d4157559d2bf","observation_id":"130b0e84-fa05-4271-add5-42e1518858eb","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Stein’s method and Poisson process convergence","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:314fa1a791920f0d4278dab4f50f378dc7ba2ca6dd5a6709096d05a7e355dd46","observation_id":"bbe00873-4574-4373-b96d-eceea5dc2b4c","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Stein’s method for diffusion approximations Probability Theory and Related Fields 1990;84: 297–322","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:929e263f1f7814748f4d4507ab03e9e9a229ededa7a812bb395f99fc96cd0722","observation_id":"446c4321-7b5c-49b4-9961-8bdfa6887b26","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Compound Poisson approximation: a user’s guide","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:3ff282cf55312ed504172e82980d01e51e0257001016d007df6ffeb65de4a4b2","observation_id":"859a1277-9eaf-441b-afe4-f7a4a9f52e7f","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Poisson Approximation","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:25b35abf2ee24e9dd1692bec31928db108755c24a0494f3a0dddfd9412ac395a","observation_id":"83800fc4-4baf-4cf9-b45e-0b2b7804fbd9","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"A central limit theorem for decomposable random variables with applications to random graphs","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:f23d1b7b12082c0e1c6a907974807a6b00c199017aa3ce6edbff7624acaa7e8f","observation_id":"1d29dec5-2836-41ab-a2fd-053bf2e6af8d","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Networks: Probability and Statistics","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:58913caec83a163a55d27fa1d58ddcde9e063342e71cdb7c06f670122e4d96d7","observation_id":"a2a3646e-46a9-4a5e-8ff9-9552d79458dd","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing, Advances in Mathematics","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:fb18e5f64c51f35e77cabdfd16e85e1f4ac8f353f1a04e4b8cb747cff181e200","observation_id":"df8915e6-38b6-4c34-b5c3-34750ce4b570","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Convergent sequences of dense graphs II","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:e02bf932b587977db93831f52a987314ee45d4682f351c0e283053f517b92354","observation_id":"56ad4ea3-4a89-4d42-ac4b-e99502ff42ae","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"A new method of normal approximation","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:a3b98b5794259c007a86bc6f9ecc34d703d57691539842b15cf5ce1c751c17e1","observation_id":"73c67313-66d9-46fa-94a7-03e1a9ad2a09","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Poisson approximation for dependent trials","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:b49c21bdae869eef974da3e64eb4af3da6a11e2f1ea0b153b5798bed8601301e","observation_id":"14b059f5-93c2-42b5-85ef-18969f5df20d","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Normal approximation by Stein’s method","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:dd6de2f457a8bd8ed4d2300100f16a94793d95757220f1607591342ba8955e4e","observation_id":"8e527d96-5b16-4546-a1b6-42b05e3f1281","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:6877e68055d380fe214f8448a565888a354c12cbcc02d6385f9ed8913137325d","observation_id":"97640375-fc26-4f20-816c-5be7d9965111","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Random geometric graph: Some recent develop- ments and perspectives","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:4a4b532a315fc4d97fb835854aaead7692926917d877a0b3da705a9b91f552ca","observation_id":"b2d2083f-f1e3-4903-9ef3-2a14d9746d9a","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Markov Processes: Characterization and Convergence","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:958579a6132ba2016cf150a031e1d2ebf0c15d91f9c62d56a7d0dbffa51fd50c","observation_id":"7f7c35f9-c85e-4e8f-9229-d93d532c3f09","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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":"10.1007/s00440-025-01397-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Normal approximation for expo- nential random graphs","venue":"Probability Theory and Related Fields","work_id":"9f2e6bd9-5790-4d05-a53b-be0759126dd9","year":2025},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:e4ed145901013022030aeabff8f484035a8273abfaee7960797a0027adc08a2f","observation_id":"909df482-752a-4c1b-bd7c-aca313c8516a","resolution":{"observed_at":"2026-06-28T08:51:48.438009Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.15159","last_updated":"2025-06-18T06:06:44Z","snapshot_observed_at":"2026-08-16T12:18:17.608212Z","submitted_at":"2025-06-18T06:06:44Z","title":"Conditional central limit theorems for exponential random graphs","version":1},"cited_work":{"arxiv_id":"2506.15159","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.15159","snapshot_observed_at":"2026-07-02T04:56:38.473077Z","title":"Conditional central limit theorems for exponential random graphs","venue":null,"work_id":"e2a058f3-f792-4a81-85a8-b781bc968500","year":2025},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"cited_paper":"/paper/2506.15159","citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:4cf4c5a67c33c3f11f6b82c197ded2d058b2b12bbb66b23087f6beb53c8f2c07","observation_id":"c480aed0-f3a8-4f2f-bd36-125dcd5ef593","resolution":{"observed_at":"2026-07-02T04:56:38.474811Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-28T08:47:45.659668Z","title":"A pure hypothesis test for inhomogeneous random graph models based on a kernelised Stein discrepancy","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:925f4eafb39ac341c2e0c5784486c986a33849e89e1cb618791823a187d8e4d9","observation_id":"1bf2a537-813e-4ab4-a588-73aaaa3187e0","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"On the rate of convergence in the multivariate CLT","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:2856d5382136c8233c2cfc76ebd43feebd380eabc32e742128b660500854cfd9","observation_id":"e730ea56-f3ed-4c09-908a-1d1935ac342b","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Multivariate normal approximations by Stein’s method and size bias couplings","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:1a16a63a711f082ab31b0ec717e180b9df541b10fe0cfe75dc1d66b780b5be73","observation_id":"c2b4411c-f8e4-41b6-8dc6-33f0e979f342","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Latent space approaches to social network analysis","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:c7add7a4b6c142642704e72fa2a312826ae34c6757a7921bdc68b991d25c4359","observation_id":"1d03eaaf-2ac0-474c-8d97-3cf7c833ffa3","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Inhomogeneous random graphs","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:3583953d3d11c57520a8302fabf9a13f7f295b17d8f7850139ebc9b6e5b1aac4","observation_id":"3ab5c7d2-8705-412f-8ca2-43c1ff2f4122","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Random measures, theory and applications","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:6081ec4555fef17e3268965a4d04e46fd27b2bdacdeb91b5b1164dcf304984d1","observation_id":"6990811c-610e-4881-ab6c-ccc18f202c15","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"The Collegial Phenomenon: The Social Mechanisms of Cooperation Among Peers in a Corporate Law Partnership","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:2b9cda8cad695b3bf3e38948fb8610cdc25e0480045423b0d0b4328df4832be9","observation_id":"2e550692-4763-4a1e-9273-824b144665b2","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Stein’s density approach and information inequalities","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:8db4fd4bea1d23087d4331a95cc728709c85b07ddb65f861e9e71387fbb646aa","observation_id":"ae1fba6c-6783-46c4-a81d-9bdd9009ea24","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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.07467","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T04:56:38.470061Z","title":"Probabilistic Inference and Learning with Stein’s Method","venue":null,"work_id":"e55be7b2-43e7-4dfe-93e9-0572bbcb2985","year":2026},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:fcf18d8d54f0daae634fc598ee7cf7162b17a37584e5dffcaad8d8bf3a2641f1","observation_id":"95d2016f-4bdf-49da-930a-286557cd773f","resolution":{"observed_at":"2026-07-02T04:56:38.471821Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-28T08:47:45.659668Z","title":"Stein’s density method for multivariate continuous distributions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:c8c7e54d0eea03da19436e6f0ead87422bb1e48f016413b4272f0426e34357fd","observation_id":"f1798f43-e966-4432-bd31-0094ab88dcf3","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Network motifs: simple building blocks of complex networks","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:13049952b3e7ac5ce8be747c9282b5396120785aee28226b132a460cf0924394","observation_id":"c6d72e21-2924-496b-9c68-0577bb07c688","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Random Geometric Graphs","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:1577f0024b075e9c304cefef81b551b6f0f117a955e232fbce771e3b7652c76b","observation_id":"824783cd-a0a5-4914-ba64-378575e1fdcb","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Approximating stationary distributions of fast mixing Glauber dynamics, with applications to exponential random graphs","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:a66ae1fb916abd7d430258927575683ab8951eb2d2b9be2f13d0232ccfcab739","observation_id":"b9de2c30-5049-44c5-8e62-5e0c7e672d01","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Fundamentals of Stein’s method","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:a588c2f144a9c6c7f710588d91c22700c56c060fadc5a3348a9b63e90f4a784f","observation_id":"39fa49c4-86c9-49a9-b368-efdf103033a0","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"When are small subgraphs of a random graph normally distributed?, Probability Theory and Related Fields","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:729091aa5fbdf93d556e67add9692a46146fee365ea1abefc0ff1b1fe662e1e7","observation_id":"1539cb9d-670a-46e6-8c74-206c5bc10bf7","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12165","last_updated":"2023-08-23T14:31:30Z","snapshot_observed_at":"2026-08-16T15:06:21.505877Z","submitted_at":"2023-08-23T14:31:30Z","title":"Assignment Based Metrics for Attributed Graphs","version":1},"cited_work":{"arxiv_id":"2308.12165","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2308.12165","snapshot_observed_at":"2026-07-02T04:56:38.476266Z","title":"Assignment based metrics for attributed graphs","venue":null,"work_id":"10dd2155-04a6-41f0-9de8-88a320dfbf8b","year":2023},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"cited_paper":"/paper/2308.12165","citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:4b50885082a7ceeb237199e5310a1612fad12b5687353521444031683aeb45f9","observation_id":"42c1cecb-38f0-43ac-ad0d-0b4238245869","resolution":{"observed_at":"2026-07-02T04:56:38.478175Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.02917","last_updated":"2024-11-05T09:03:05Z","snapshot_observed_at":"2026-08-16T13:02:51.290112Z","submitted_at":"2024-11-05T09:03:05Z","title":"Stein's Method for Spatial Random Graphs","version":1},"cited_work":{"arxiv_id":"2411.02917","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.02917","snapshot_observed_at":"2026-07-02T04:56:38.467535Z","title":"Stein’s method for spatial random graphs","venue":null,"work_id":"08d662e9-a486-4a7a-a50f-32eac5b6828d","year":2024},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"cited_paper":"/paper/2411.02917","citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:6473551dbd9b9b48d70cee587c9f9317663df41af8dcd3d191850bdcbb8437df","observation_id":"36a681e0-b5e0-4385-8baa-8013b0bc1947","resolution":{"observed_at":"2026-07-02T04:56:38.469246Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-28T08:47:45.659668Z","title":"Rates of multivariate normal approximation for statistics in geometric probability","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:d9f5acaf28126588551839bd4ad2032d01a152e9721754c3cc7f7097a2cc9986","observation_id":"50bb1010-234f-4774-8c82-72f00ceed847","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"A review of latent space models for social networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:866dc344cf4b29c21acc18765c746ddbaf3a108ab269fa4b5485ac0c17fa57d2","observation_id":"dc688954-7ed8-4db6-9a12-4b4956863dc9","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Compound Poisson approximations of subgraph counts in random graphs","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:6489c55ecd8b43d308b399cd3f21f9493d3ecd9fa8d5231734a2741723fcef17","observation_id":"3d925592-4de3-49a0-bce3-004774de4ef2","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Approximate Computation of Expectations","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:d207265df6b29d83c05e2c07a48e73149cc112564dd008f3a80ee1190dc026c7","observation_id":"9a67ffbb-9875-462f-aeca-1abf2c988afa","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"Uncovering the fingerprint of online social networks using a network motif based approach","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:71fbb38da761d697f7da0020f25d3b7ed895722779816e4cd9672cb9913d0c9c","observation_id":"a655c1f6-b339-4f63-8343-c8f25d5a73f9","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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":"2507.10531","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T04:56:38.479611Z","title":"Quantitative central limit theorems for exponential random graphs","venue":null,"work_id":"81ff5550-fdb0-4813-8d94-6d68eb113335","year":2025},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:d9e4979b34488a5a06e6e2c06554412707e82b7ba8abfc20c0e64e253ef070f9","observation_id":"27762239-41f0-4eb4-bc50-dd467f56983c","resolution":{"observed_at":"2026-07-02T04:56:38.481658Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-28T08:47:45.659668Z","title":"Spatial Random Graphs: Studying dependence structures in spatial data; 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:83a7371fec7aee567672d210b076682b1d7c82ef343b8a655c666b0505fbab66","observation_id":"54898f80-1f4c-4f4a-a0f2-c253f97991b2","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","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-28T08:47:45.659668Z","title":"A Stein goodness of fit test for exponential random graph mod- els","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-28T08:47:45.659668Z"},"links":{"citing_paper":"/paper/2606.03442"},"observation_digest":"sha256:b7fcb0dc04187f475dfb2a19bc316a1983f5ba16199db236fd4689e6e37d4658","observation_id":"956e9f52-e2c2-4e71-b76c-5633efad76f2","resolution":{"observed_at":"2026-06-28T08:47:45.659668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.03442","last_updated":"2026-06-02T10:26:45Z","latest_version":1,"primary_category":"math.PR","snapshot_observed_at":"2026-08-10T01:27:56.923492Z","submitted_at":"2026-06-02T10:26:45Z","title":"Stein's method in network analysis"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":37,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":43},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2606.03442."}