{"as_of":"2026-08-08T13:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5e0b37b54caafe021c9ad9596752241b05b8ff1fd43c6ae2dd8080ede74affca","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-08T06:32:00.761636+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-05-23T23:58:35.733203Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T23:58:38.179736Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.04716","last_updated":"2026-07-09T12:26:14Z","snapshot_observed_at":"2026-08-05T03:21:02.623665Z","submitted_at":"2023-05-08T14:02:06Z","title":"A dynamical approach to spanning and surplus edges of random graphs","version":3},"cited_work":{"arxiv_id":"2305.04716","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.04716","snapshot_observed_at":"2026-07-10T01:19:36.643126Z","title":null,"venue":null,"work_id":"0a0edc45-fb7a-4dd9-8fa4-b1a90abb0163","year":2023},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"cited_paper":"/paper/2305.04716","citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:ecb7d2a78a1feb0912eb3915615e8eebc902845647c392a84bef5b620c921815","observation_id":"074bb0d5-2efa-40c8-882e-1f8fb20616a4","resolution":{"observed_at":"2026-07-10T01:19:36.643126Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2305.04716/citation-record","integrity":"/paper/2305.04716/integrity","json":"/paper/2305.04716/citation-record.json","paper":"/paper/2305.04716"},"outbound":[],"paper":{"arxiv_id":"2305.04716","last_updated":"2026-07-09T12:26:14Z","latest_version":3,"primary_category":"math.PR","snapshot_observed_at":"2026-08-05T03:21:02.623665Z","submitted_at":"2023-05-08T14:02:06Z","title":"A dynamical approach to spanning and surplus edges of 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2305.04716."}