{"as_of":"2026-08-10T04:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d4238fa0ca5b5a761f47b165b2199f160e295365740306b17a86cb20bc82efd8","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-09T06:31:02.800959+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-08T16:39:14.287083Z","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-08T16:39:14.382263Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.08353","last_updated":"2025-02-17T21:15:05Z","snapshot_observed_at":"2026-07-06T15:27:06.126421Z","submitted_at":"2023-05-15T05:21:20Z","title":"Fast and Efficient Matching Algorithm with Deadline Instances","version":3},"cited_work":{"arxiv_id":"2305.08353","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.08353","snapshot_observed_at":"2026-08-08T16:39:14.382263Z","title":"Fast and Efficient Matching Algorithm with Deadline Instances","venue":"cs.DS","work_id":"4a4aacbf-599f-4652-96b3-b90e42ca18e1","year":2023},"citing_paper":{"arxiv_id":"2502.06167","last_updated":"2025-02-10T05:36:30Z","snapshot_observed_at":"2026-08-09T01:42:08.911908Z","submitted_at":"2025-02-10T05:36:30Z","title":"Universal Approximation of Visual Autoregressive Transformers","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-08T16:39:14.287083Z"},"links":{"cited_paper":"/paper/2305.08353","citing_paper":"/paper/2502.06167"},"observation_digest":"sha256:e95846091be2a24a130dc4eb28680975c3abc76dfbf76e5c4720f883a2b1d2d2","observation_id":"073721e7-ef57-4bec-a6f2-be118c6a9ce1","resolution":{"observed_at":"2026-08-08T16:39:14.385805Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2305.08353/citation-record","integrity":"/paper/2305.08353/integrity","json":"/paper/2305.08353/citation-record.json","paper":"/paper/2305.08353"},"outbound":[],"paper":{"arxiv_id":"2305.08353","last_updated":"2025-02-17T21:15:05Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T15:27:06.126421Z","submitted_at":"2023-05-15T05:21:20Z","title":"Fast and Efficient Matching Algorithm with Deadline Instances"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2305.08353."}