{"as_of":"2026-08-16T14:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d68564f08309ae978c6bedc201bcf4679f25f326651c9fe4d28054a4e5adf3d5","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-11T13:02:47.932562Z","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-11T13:02:48.335837Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.11705","last_updated":"2025-04-11T11:36:11Z","snapshot_observed_at":"2026-08-16T07:09:50.686491Z","submitted_at":"2023-10-18T04:35:23Z","title":"Random minimum spanning tree and dense graph limits","version":3},"cited_work":{"arxiv_id":"2310.11705","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.11705","snapshot_observed_at":"2026-08-11T13:02:48.335837Z","title":"Random minimum spanning tree and dense graph limits","venue":"math.CO","work_id":"c83b1c3f-e03c-46a7-8f31-fd1363c56d6e","year":2023},"citing_paper":{"arxiv_id":"2412.13672","last_updated":"2025-01-19T04:48:26Z","snapshot_observed_at":"2026-08-11T12:52:31.094204Z","submitted_at":"2024-12-18T09:53:47Z","title":"Functional Central limit theorems for microscopic and macroscopic functionals of inhomogeneous random graphs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T13:02:47.932562Z"},"links":{"cited_paper":"/paper/2310.11705","citing_paper":"/paper/2412.13672"},"observation_digest":"sha256:1717dee2e338a8e33839ae0e463ce62ed208f59f8b420ed67ce760fff2796fa7","observation_id":"78f12278-d97d-42c2-ab5f-e34e57ae276e","resolution":{"observed_at":"2026-08-11T13:02:48.342736Z","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/2310.11705/citation-record","integrity":"/paper/2310.11705/integrity","json":"/paper/2310.11705/citation-record.json","paper":"/paper/2310.11705"},"outbound":[],"paper":{"arxiv_id":"2310.11705","last_updated":"2025-04-11T11:36:11Z","latest_version":3,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T07:09:50.686491Z","submitted_at":"2023-10-18T04:35:23Z","title":"Random minimum spanning tree and dense graph limits"},"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 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2310.11705."}