{"as_of":"2026-08-09T08:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8e45931b7b7721b657888a6b9526113eb03aa5afd3253836c4c38fede20f0ae7","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:04:53.262716Z","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-02T12:06:55.744345Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.09871","last_updated":"2020-07-21T01:24:19Z","snapshot_observed_at":"2026-08-08T19:49:21.415982Z","submitted_at":"2020-07-20T03:46:36Z","title":"Automating Involutive MCMC using Probabilistic and Differentiable Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.09871","snapshot_observed_at":"2026-08-07T05:04:53.262716Z","title":"Automating involutive mcmc using probabilistic and differentiable programming","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.08756","last_updated":"2025-06-10T12:53:31Z","snapshot_observed_at":"2026-08-08T21:29:54.701321Z","submitted_at":"2025-06-10T12:53:31Z","title":"Bayesian Inverse Physics for Neuro-Symbolic Robot Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T05:04:53.262716Z"},"links":{"cited_paper":"/paper/2007.09871","citing_paper":"/paper/2506.08756"},"observation_digest":"sha256:edb64424108c32e11ef1d19bf996b0951fb48e73de5413a81f7282ccdc9d4b74","observation_id":"bd727349-22c9-45ae-a97f-ca3a4e7e3592","resolution":{"observed_at":"2026-08-07T05:04:53.262716Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.09871","last_updated":"2020-07-21T01:24:19Z","snapshot_observed_at":"2026-08-08T19:49:21.415982Z","submitted_at":"2020-07-20T03:46:36Z","title":"Automating Involutive MCMC using Probabilistic and Differentiable Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.09871","snapshot_observed_at":"2026-08-05T14:51:01.877432Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.20922","last_updated":"2026-07-25T00:40:50Z","snapshot_observed_at":"2026-08-07T07:23:52.232879Z","submitted_at":"2025-08-28T15:51:16Z","title":"Static Factorisation of Probabilistic Programs With User-Labelled Sample Statements and While Loops","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T14:51:01.877432Z"},"links":{"cited_paper":"/paper/2007.09871","citing_paper":"/paper/2508.20922"},"observation_digest":"sha256:5cb94f98b34c7392be4b0824cdc3adb50f8d8404632ea4a2bab102b82dc18399","observation_id":"a50ad12b-40e7-492c-af09-35ce6a5c3add","resolution":{"observed_at":"2026-08-05T14:51:01.877432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.09871","last_updated":"2020-07-21T01:24:19Z","snapshot_observed_at":"2026-08-08T19:49:21.415982Z","submitted_at":"2020-07-20T03:46:36Z","title":"Automating Involutive MCMC using Probabilistic and Differentiable Programming","version":2},"cited_work":{"arxiv_id":"2007.09871","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.09871","snapshot_observed_at":"2026-07-02T12:06:55.744345Z","title":"Cusumano-Towner, Alexander K","venue":null,"work_id":"ff4a0858-ad89-48a9-a4c2-29bf83579e18","year":2020},"citing_paper":{"arxiv_id":"2606.05348","last_updated":"2026-06-03T18:49:07Z","snapshot_observed_at":"2026-08-07T22:02:21.860865Z","submitted_at":"2026-06-03T18:49:07Z","title":"Incremental Computation for Efficient Programmable Inference in Probabilistic Programs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T02:33:28.353942Z"},"links":{"cited_paper":"/paper/2007.09871","citing_paper":"/paper/2606.05348"},"observation_digest":"sha256:0629e652edf0a608576d119b04f3e856e9172c2b337550dd4cac12e8bbc6adcb","observation_id":"fc45a355-ba98-4635-8ca7-5a4d4a0bee53","resolution":{"observed_at":"2026-07-02T12:06:55.745768Z","resolver_source":"arxiv_id","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/2007.09871/citation-record","integrity":"/paper/2007.09871/integrity","json":"/paper/2007.09871/citation-record.json","paper":"/paper/2007.09871"},"outbound":[],"paper":{"arxiv_id":"2007.09871","last_updated":"2020-07-21T01:24:19Z","latest_version":2,"primary_category":"stat.CO","snapshot_observed_at":"2026-08-08T19:49:21.415982Z","submitted_at":"2020-07-20T03:46:36Z","title":"Automating Involutive MCMC using Probabilistic and Differentiable 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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2007.09871."}