{"as_of":"2026-08-15T21:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:90b6fdfc2029f8d3bdb787e905af42dad943aa66cec3197fb36e08218c9aa601","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-14T15:13:08.610559Z","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-14T15:13:08.673667Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1906.12053","last_updated":"2019-08-02T12:00:28Z","snapshot_observed_at":"2026-08-15T12:43:58.304953Z","submitted_at":"2019-06-28T06:13:56Z","title":"Generating Normal Networks via Leaf Insertion and Nearest Neighbor Interchange","version":3},"cited_work":{"arxiv_id":"1906.12053","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.12053","snapshot_observed_at":"2026-08-14T15:13:08.673667Z","title":"Generating Normal Networks via Leaf Insertion and Nearest Neighbor Interchange","venue":"q-bio.PE","work_id":"8711b8bc-3af7-4b38-b9a4-b80e93dda7f2","year":2019},"citing_paper":{"arxiv_id":"1908.01917","last_updated":"2020-02-26T21:58:09Z","snapshot_observed_at":"2026-08-15T04:51:16.749693Z","submitted_at":"2019-08-06T01:07:43Z","title":"Counting Tree-Child Networks and Their Subclasses","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T15:13:08.610559Z"},"links":{"cited_paper":"/paper/1906.12053","citing_paper":"/paper/1908.01917"},"observation_digest":"sha256:8ec78f102addc6adc4481bbc08374149bded573f5d239d6171fd26d29355a3fc","observation_id":"b794d91a-20ff-4006-a7ae-f0aebf767b22","resolution":{"observed_at":"2026-08-14T15:13:08.679776Z","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/1906.12053/citation-record","integrity":"/paper/1906.12053/integrity","json":"/paper/1906.12053/citation-record.json","paper":"/paper/1906.12053"},"outbound":[],"paper":{"arxiv_id":"1906.12053","last_updated":"2019-08-02T12:00:28Z","latest_version":3,"primary_category":"q-bio.PE","snapshot_observed_at":"2026-08-15T12:43:58.304953Z","submitted_at":"2019-06-28T06:13:56Z","title":"Generating Normal Networks via Leaf Insertion and Nearest Neighbor Interchange"},"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:1906.12053."}