{"as_of":"2026-08-07T19:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f8312403639d9aa3b73bb94d4284f16117857c089a40e799826c2ecc28e78511","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T08:09:27.586104Z","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-07-04T05:49:37.962565Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.03682","last_updated":"2024-08-07T10:50:59Z","snapshot_observed_at":"2026-07-06T18:57:48.065595Z","submitted_at":"2024-08-07T10:50:59Z","title":"Automated Techniques for Efficient Sampling of Piecewise-Deterministic Markov Processes","version":1},"cited_work":{"arxiv_id":"2408.03682","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.03682","snapshot_observed_at":"2026-07-04T05:49:37.962565Z","title":"Automated techniques for effi- cient sampling of piecewise-deterministic Markov processes.arXiv preprint arXiv:2408.03682, 2024","venue":null,"work_id":"7c78fccf-d1e5-41b6-ab34-5d6a18fdb234","year":2024},"citing_paper":{"arxiv_id":"2606.19909","last_updated":"2026-06-18T08:04:12Z","snapshot_observed_at":"2026-08-06T12:15:30.030544Z","submitted_at":"2026-06-18T08:04:12Z","title":"Establishing an $\\Omega(\\sqrt{d})$ complexity lower bound for PDMP samplers and how to break it: a sub-$\\sqrt{d}$ algorithm for Gaussian-tailed targets","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-26T15:20:10.943873Z"},"links":{"cited_paper":"/paper/2408.03682","citing_paper":"/paper/2606.19909"},"observation_digest":"sha256:cc5c10a5f6e8c4df29c5b8e7ff009c2100dbb6e36f7a443e99ae783d5f2cd642","observation_id":"0d1dbb8e-636c-4387-8ccc-e107131bca65","resolution":{"observed_at":"2026-07-04T05:49:37.965050Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03682","last_updated":"2024-08-07T10:50:59Z","snapshot_observed_at":"2026-07-06T18:57:48.065595Z","submitted_at":"2024-08-07T10:50:59Z","title":"Automated Techniques for Efficient Sampling of Piecewise-Deterministic Markov Processes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03682","snapshot_observed_at":"2026-07-31T08:09:27.586104Z","title":"Automated techniques for efficient sampling of piecewise-deterministic Markov processes, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28413","last_updated":"2026-07-30T15:59:25Z","snapshot_observed_at":"2026-08-04T14:30:26.426370Z","submitted_at":"2026-07-30T15:59:25Z","title":"Windowed thinning and query complexity for the bouncy particle and Zigzag samplers","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-31T08:09:27.586104Z"},"links":{"cited_paper":"/paper/2408.03682","citing_paper":"/paper/2607.28413"},"observation_digest":"sha256:cd343282568ae3269fcac82d60926494559cda465eacb93ff0536d21fd3a4a75","observation_id":"978e7c8c-96ea-4c9b-8326-2e3399eb6e58","resolution":{"observed_at":"2026-07-31T08:09:27.586104Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2408.03682/citation-record","integrity":"/paper/2408.03682/integrity","json":"/paper/2408.03682/citation-record.json","paper":"/paper/2408.03682"},"outbound":[],"paper":{"arxiv_id":"2408.03682","last_updated":"2024-08-07T10:50:59Z","latest_version":1,"primary_category":"stat.CO","snapshot_observed_at":"2026-07-06T18:57:48.065595Z","submitted_at":"2024-08-07T10:50:59Z","title":"Automated Techniques for Efficient Sampling of Piecewise-Deterministic Markov Processes"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2408.03682."}