{"as_of":"2026-08-16T12:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e625c19c5466f2cdb3874eea066a624a6820ce2b105949efe61b49b07dbffd4a","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:50:11.392143Z","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:50:11.530578Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1811.02091","last_updated":"2018-11-29T02:56:29Z","snapshot_observed_at":"2026-08-14T18:03:46.954748Z","submitted_at":"2018-11-05T23:53:59Z","title":"Simple, Distributed, and Accelerated Probabilistic Programming","version":2},"cited_work":{"arxiv_id":"1811.02091","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.02091","snapshot_observed_at":"2026-08-14T14:50:11.530578Z","title":"Simple, Distributed, and Accelerated Probabilistic Programming","venue":"stat.ML","work_id":"a6d8be5e-ec81-4df6-86b7-dfc233ead301","year":2018},"citing_paper":{"arxiv_id":"1908.02427","last_updated":"2019-08-07T03:04:38Z","snapshot_observed_at":"2026-08-16T04:36:00.668515Z","submitted_at":"2019-08-07T03:04:38Z","title":"Strengthening the Case for a Bayesian Approach to Car-following Model Calibration and Validation using Probabilistic Programming","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:11.392143Z"},"links":{"cited_paper":"/paper/1811.02091","citing_paper":"/paper/1908.02427"},"observation_digest":"sha256:75d0610f4dbb3dc7f5e96cf29b763a28963b87c871cab23a97321cbe179d73e9","observation_id":"fe777667-89e3-4c60-bcc4-4c85c8362029","resolution":{"observed_at":"2026-08-14T14:50:11.536859Z","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/1811.02091/citation-record","integrity":"/paper/1811.02091/integrity","json":"/paper/1811.02091/citation-record.json","paper":"/paper/1811.02091"},"outbound":[],"paper":{"arxiv_id":"1811.02091","last_updated":"2018-11-29T02:56:29Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-14T18:03:46.954748Z","submitted_at":"2018-11-05T23:53:59Z","title":"Simple, Distributed, and Accelerated Probabilistic Programming"},"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:1811.02091."}