{"as_of":"2026-08-15T16:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d6a2b2dd71c45030e2229ada8df859c5c089a70b5ff1f074742cc3d3f9f814e5","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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-08-09T14:12:44.037777Z","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-08-09T14:12:44.727792Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1901.00533","last_updated":"2020-02-11T14:02:02Z","snapshot_observed_at":"2026-08-14T17:35:48.912365Z","submitted_at":"2019-01-02T20:59:47Z","title":"A Simple Algorithm for Scalable Monte Carlo Inference","version":4},"cited_work":{"arxiv_id":"1901.00533","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.00533","snapshot_observed_at":"2026-08-09T14:12:44.727792Z","title":"A Simple Algorithm for Scalable Monte Carlo Inference","venue":"stat.CO","work_id":"c182b7a7-9c6b-4c63-bd7c-4c1d37376ead","year":2019},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.037777Z"},"links":{"cited_paper":"/paper/1901.00533","citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:a1d5f25f1d10ae60f733bcfeddafc958023ef254e8d0a2c7a65474a56e5229a6","observation_id":"7add7811-3972-4046-b2d5-36d765ead413","resolution":{"observed_at":"2026-08-09T14:12:44.732522Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1901.00533/citation-record","integrity":"/paper/1901.00533/integrity","json":"/paper/1901.00533/citation-record.json","paper":"/paper/1901.00533"},"outbound":[],"paper":{"arxiv_id":"1901.00533","last_updated":"2020-02-11T14:02:02Z","latest_version":4,"primary_category":"stat.CO","snapshot_observed_at":"2026-08-14T17:35:48.912365Z","submitted_at":"2019-01-02T20:59:47Z","title":"A Simple Algorithm for Scalable Monte Carlo Inference"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1901.00533."}