{"as_of":"2026-08-07T06:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b8530e487d1c9c6cf03e8033ef8e274b4b400205d6ae594cc94d7591ed83dfd2","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-06T06:34:29.942622+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-20T02:53:56.937465Z","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-20T02:58:00.271560Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2201.00001","last_updated":"2022-02-17T20:43:35Z","snapshot_observed_at":"2026-07-06T12:23:52.936803Z","submitted_at":"2021-12-14T23:57:39Z","title":"Modeling Advection on Directed Graphs using Mat\\'ern Gaussian Processes for Traffic Flow","version":3},"cited_work":{"arxiv_id":"2201.00001","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2201.00001","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2201.00001 , year=","venue":null,"work_id":"71917c8f-f79a-4f50-bbde-5dfac27127fb","year":null},"citing_paper":{"arxiv_id":"2605.19305","last_updated":"2026-05-19T03:33:52Z","snapshot_observed_at":"2026-08-01T12:10:41.327616Z","submitted_at":"2026-05-19T03:33:52Z","title":"Mat\\'ern Noise for Triangulation-Agnostic Flow Matching on Meshes","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-05-20T02:53:56.937465Z"},"links":{"cited_paper":"/paper/2201.00001","citing_paper":"/paper/2605.19305"},"observation_digest":"sha256:52c2abcada656d052d1e71b3eac0cd712930f2e353a08711a31ee02dd9d36f67","observation_id":"148f5aab-c8b0-4392-bc0c-1004569a0a0c","resolution":{"observed_at":"2026-05-20T02:58:00.275125Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2201.00001/citation-record","integrity":"/paper/2201.00001/integrity","json":"/paper/2201.00001/citation-record.json","paper":"/paper/2201.00001"},"outbound":[],"paper":{"arxiv_id":"2201.00001","last_updated":"2022-02-17T20:43:35Z","latest_version":3,"primary_category":"math.NA","snapshot_observed_at":"2026-07-06T12:23:52.936803Z","submitted_at":"2021-12-14T23:57:39Z","title":"Modeling Advection on Directed Graphs using Mat\\'ern Gaussian Processes for Traffic Flow"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2201.00001."}