{"as_of":"2026-08-16T19:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:286ec6c8a0f655099ebc23fb77154f658c11b3142ef3e7aaea496074b8a20c4e","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-14T14:00:14.287369Z","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-14T14:00:14.527897Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1903.04113","last_updated":"2020-01-21T20:53:09Z","snapshot_observed_at":"2026-08-16T17:50:19.578315Z","submitted_at":"2019-03-11T03:32:01Z","title":"Stack words and a bound for 3-stack sortable permutations","version":4},"cited_work":{"arxiv_id":"1903.04113","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.04113","snapshot_observed_at":"2026-08-14T14:00:14.527897Z","title":"Stack words and a bound for 3-stack sortable permutations","venue":"math.CO","work_id":"de6f4e25-23b2-4eff-9ffd-1d2feea161fd","year":2019},"citing_paper":{"arxiv_id":"1908.04025","last_updated":"2021-08-30T17:52:06Z","snapshot_observed_at":"2026-08-16T03:25:31.215051Z","submitted_at":"2019-08-12T06:54:40Z","title":"Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:00:14.287369Z"},"links":{"cited_paper":"/paper/1903.04113","citing_paper":"/paper/1908.04025"},"observation_digest":"sha256:d3fa0b419559fedcf46432a707f7124a4459d0750622ace9660457b5b1b1e651","observation_id":"ff84f70f-93f2-494f-af3e-e45555c2212e","resolution":{"observed_at":"2026-08-14T14:00:14.534916Z","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/1903.04113/citation-record","integrity":"/paper/1903.04113/integrity","json":"/paper/1903.04113/citation-record.json","paper":"/paper/1903.04113"},"outbound":[],"paper":{"arxiv_id":"1903.04113","last_updated":"2020-01-21T20:53:09Z","latest_version":4,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T17:50:19.578315Z","submitted_at":"2019-03-11T03:32:01Z","title":"Stack words and a bound for 3-stack sortable permutations"},"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:1903.04113."}