{"as_of":"2026-08-17T06:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0fec9cf9ada31ba84cc3cfcdf1630183643623eb21b60b4afab2cab6b239ef05","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-16T06:30:59.297886+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-14T13:38:39.431011Z","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-14T13:38:41.865269Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1504.08103","last_updated":"2023-02-04T11:24:28Z","snapshot_observed_at":"2026-08-16T12:09:27.634171Z","submitted_at":"2015-04-30T07:28:00Z","title":"On local weak limit and subgraph counts for sparse random graphs","version":3},"cited_work":{"arxiv_id":"1504.08103","doi":null,"metadata_source":"pith","pith_arxiv_id":"1504.08103","snapshot_observed_at":"2026-08-14T13:38:41.865269Z","title":"On local weak limit and subgraph counts for sparse random graphs","venue":"math.PR","work_id":"15a66fa1-940f-4053-9860-e1854a7b44ed","year":2015},"citing_paper":{"arxiv_id":"1908.04850","last_updated":"2019-08-13T20:40:06Z","snapshot_observed_at":"2026-08-16T05:19:30.644069Z","submitted_at":"2019-08-13T20:40:06Z","title":"Local convergence of random planar graphs","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-14T13:38:39.431011Z"},"links":{"cited_paper":"/paper/1504.08103","citing_paper":"/paper/1908.04850"},"observation_digest":"sha256:4be0d229888377638cdb4d2315ded16e072961c9fe76a181aac225bfa1b54624","observation_id":"2f483619-5b52-490d-861f-dd7f81151cf9","resolution":{"observed_at":"2026-08-14T13:38:41.889340Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1504.08103/citation-record","integrity":"/paper/1504.08103/integrity","json":"/paper/1504.08103/citation-record.json","paper":"/paper/1504.08103"},"outbound":[],"paper":{"arxiv_id":"1504.08103","last_updated":"2023-02-04T11:24:28Z","latest_version":3,"primary_category":"math.PR","snapshot_observed_at":"2026-08-16T12:09:27.634171Z","submitted_at":"2015-04-30T07:28:00Z","title":"On local weak limit and subgraph counts for sparse random graphs"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1504.08103."}