{"as_of":"2026-08-16T11:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8c3118a69e0e812cd7e2f2f6f955e1545f5058765c6718cf053f01f108bbb1d6","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:08:47.439543Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.09744/citation-record","integrity":"/paper/1908.09744/integrity","json":"/paper/1908.09744/citation-record.json","paper":"/paper/1908.09744"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:49.303682Z","title":"Winbugs-a bayesian modelling framework: concepts, structure, and extensibility","venue":null,"work_id":"986c174f-7719-4a6b-bc48-5e4cb7530608","year":2000},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:45.819788Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:f376f54e2642d500b63646cae03399dd0412db648b1c50c53f80f4fee435e2a1","observation_id":"2cf87994-d556-48bf-80ce-d3bf07fff3ee","resolution":{"observed_at":"2026-08-14T11:08:49.310442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:49.281836Z","title":"Stan: A probabilistic programming language","venue":null,"work_id":"6ebf47cd-597e-4ba9-955f-05cc5370429d","year":2017},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:45.845988Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:a17fa269e62f0cfb6bf1f441fd2fcdd4586bc3179c546e7bc41eb68772ee7904","observation_id":"86f4d291-a679-499f-922f-3f6944c87e2c","resolution":{"observed_at":"2026-08-14T11:08:49.289334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:49.257848Z","title":"Simple, distributed, and accelerated probabilistic programming","venue":null,"work_id":"c03f1dd4-3481-4e60-a721-09d7e6ea5769","year":2018},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:45.938821Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:75de553fc88c1ab45d36b397ae132b94a6857542f802702008aec062db5c2616","observation_id":"8ab9a103-9751-497b-bf14-6b301370837e","resolution":{"observed_at":"2026-08-14T11:08:49.262827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1810.09538","last_updated":"2018-10-18T19:28:32Z","snapshot_observed_at":"2026-08-14T18:12:27.625432Z","submitted_at":"2018-10-18T19:28:32Z","title":"Pyro: Deep Universal Probabilistic Programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.09538","snapshot_observed_at":"2026-08-14T11:08:45.991811Z","title":"Pyro: Deep universal probabilistic programming","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:45.991811Z"},"links":{"cited_paper":"/paper/1810.09538","citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:195f2ca374b9e5cbde55e39aee1621297a40501bc6e2412db62fa16219e36fe5","observation_id":"fc6baeb9-259a-4157-8c59-03788afe38f0","resolution":{"observed_at":"2026-08-14T11:08:45.991811Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6114","last_updated":"2022-12-10T21:04:00Z","snapshot_observed_at":"2026-08-14T23:50:45.029465Z","submitted_at":"2013-12-20T20:58:10Z","title":"Auto-Encoding Variational Bayes","version":11},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6114","snapshot_observed_at":"2026-08-14T11:08:45.999719Z","title":"Auto-encoding variational bayes","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:45.999719Z"},"links":{"cited_paper":"/paper/1312.6114","citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:ccebc8d517b6a0d436cbe365eabc3a481a6de1bca9e6b99fdd084af9d0eb513b","observation_id":"48560a30-b781-4e68-91ee-fa866effb621","resolution":{"observed_at":"2026-08-14T11:08:45.999719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:49.239847Z","title":"A tutorial on hidden markov models and selected applications in speech recognition","venue":null,"work_id":"b8c0e94c-23ca-42e5-b7a7-3b2bb79306c8","year":1989},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.006911Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:3e0543653b1ca45979d2600febf83071f773d8c916a0698a6ccf9594943b2c56","observation_id":"8b05bbac-5f9d-4b47-a8d7-dc783dbb7d5a","resolution":{"observed_at":"2026-08-14T11:08:49.245517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:49.219838Z","title":"Particle Markov chain monte carlo methods","venue":null,"work_id":"1d454d29-bfc1-4dfe-a4ad-b081b78c5ccf","year":2010},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.018052Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:c7ce29661f7e4cbee56f545d0ead8d0c03d0c54e543870f71f2e8fcbb5582231","observation_id":"83e33688-99b3-4f90-ad13-0309bc5c2f13","resolution":{"observed_at":"2026-08-14T11:08:49.226385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:49.201961Z","title":"Mcmc using hamiltonian dynamics","venue":null,"work_id":"4a63d476-e87a-468c-8da4-cb9b637e0abf","year":2011},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.080928Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:c3158dbcd3e52fd94a76ae56fe97ade8bf7b1cd928c7427965ed4eb782a09220","observation_id":"32fcabf8-3ed4-4081-9241-17c5d166a63f","resolution":{"observed_at":"2026-08-14T11:08:49.207283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:49.185581Z","title":"Automatic differentiation variational inference","venue":null,"work_id":"63173efa-d113-49d2-9c6b-044ce97f5c48","year":2017},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.140791Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:889bb3e57632ba9e231b6fff3952b9bfd0a6b2dc91c5837a3e12c3d4ff2765d1","observation_id":"91eeee61-7ba2-42f8-a4ca-8b476a9cd2c2","resolution":{"observed_at":"2026-08-14T11:08:49.190950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:49.169157Z","title":"Approx- imate inference for deep latent gaussian mixtures","venue":null,"work_id":"9f5d0141-bbe7-4bac-800d-4a0cf2ef0ffe","year":2016},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.209104Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:4aaa01d7b349a0c99df4d19466b33982397676017e2316d5586ee352ab4d0108","observation_id":"a7f4231e-2897-43e4-ac42-fe9912c49a34","resolution":{"observed_at":"2026-08-14T11:08:49.174324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:49.151946Z","title":"Markov chain monte carlo and variational inference: Bridging the gap","venue":null,"work_id":"49e44c59-5d25-4a27-80ee-e4a89dd8538d","year":2015},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.311519Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:7f37ad6406d7acc005d90aff63cb8b8c81795a10c4ac5ac802c9672bc79cf77a","observation_id":"e9025d5b-f417-40a3-a40b-3ba381ac82b8","resolution":{"observed_at":"2026-08-14T11:08:49.157589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1511.06499","last_updated":"2016-04-17T22:14:13Z","snapshot_observed_at":"2026-08-14T22:22:05.448800Z","submitted_at":"2015-11-20T06:01:23Z","title":"The Variational Gaussian Process","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.06499","snapshot_observed_at":"2026-08-14T11:08:46.330965Z","title":"The variational gaussian process","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.330965Z"},"links":{"cited_paper":"/paper/1511.06499","citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:e1f5aefb1a5b060f1f7906df6e1a012ad94bfbfd6a5dd4db0fb5bdbf73aae30d","observation_id":"2d1e2665-3c0a-47bd-b708-d43353bb07d5","resolution":{"observed_at":"2026-08-14T11:08:46.330965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:49.135847Z","title":"A new approach to probabilistic programming inference","venue":null,"work_id":"5740a024-0e64-4584-98a8-3958d3cb1d56","year":2014},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.337752Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:aed25d1ddc007382fe404567cba4a84b6f8afc3e044246b5b61d4c0de4d9dac1","observation_id":"97c2ee22-fe18-49ea-8c76-ae314921e545","resolution":{"observed_at":"2026-08-14T11:08:49.141109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:49.117426Z","title":"Turing: a language for flexible probabilistic inference","venue":null,"work_id":"148c52f7-b4e3-4cac-bd62-d93b3fbf7899","year":2018},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.344238Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:1fe9bd6cc05ed768af7b65450cddeda2c742c9736672ab365030b096ea2ba5fa","observation_id":"831cf315-ec2a-496b-8933-358f7c31ea36","resolution":{"observed_at":"2026-08-14T11:08:49.123463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:49.097631Z","title":"A general framework for the parametrization of hierarchical models","venue":null,"work_id":"198d739b-4474-46ec-80f2-b6434c9995ad","year":2007},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.366040Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:4f3f43e3b9825d8295ba8b2cd1cfdad8a33c73dfcb7e5084e085d113d285fab1","observation_id":"8fe748e9-1b7c-4179-9c99-ea1977dd65c0","resolution":{"observed_at":"2026-08-14T11:08:49.105092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:49.079070Z","title":"Neutra- lizing bad geometry in hamiltonian monte carlo using neural transport","venue":null,"work_id":"5f52bcbb-3d3e-4329-aba1-210466450e3b","year":2018},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.374720Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:8eb7a3a8268b1933766e275344f066f53b6ea0358fc91287ed84a0c1f469658b","observation_id":"8cbfc440-c1b3-4569-8486-da2bace97824","resolution":{"observed_at":"2026-08-14T11:08:49.085380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:49.061541Z","title":"Neural network renormaliza- tion group","venue":null,"work_id":"ddb4d276-7dab-4cdc-93a0-613904c94592","year":2018},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.425859Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:e12cfdf8fbe7b4208bb8b7539ee83001ad4f2c5ca55a28ce887a24a6c9c296fa","observation_id":"3feec916-d112-407a-bf65-87fe2990c195","resolution":{"observed_at":"2026-08-14T11:08:49.067977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1412.5492","last_updated":"2017-08-23T19:32:39Z","snapshot_observed_at":"2026-08-14T23:07:09.238751Z","submitted_at":"2014-12-17T17:30:05Z","title":"Transport map accelerated Markov chain Monte Carlo","version":4},"cited_work":{"arxiv_id":"1412.5492","doi":null,"metadata_source":"pith","pith_arxiv_id":"1412.5492","snapshot_observed_at":"2026-08-14T11:08:47.794758Z","title":"Transport map accelerated Markov chain Monte Carlo","venue":"stat.CO","work_id":"145be4b0-2228-4e2d-a24c-05d850dca04e","year":2014},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.528466Z"},"links":{"cited_paper":"/paper/1412.5492","citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:7cb8a7693a1200c2e40cb1e1563d47bb6337e47a93ad9ea4a6da8d40100f2322","observation_id":"94b46c9e-3fe8-45c5-bd3a-98c8e410dd67","resolution":{"observed_at":"2026-08-14T11:08:47.836367Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:49.043699Z","title":"Variational infer- ence with normalizing flows","venue":null,"work_id":"6c8becc0-da10-45dc-a6af-a2b7058aafd7","year":2015},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.619704Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:dde190aca5ce3ca780db9e88e4734d9f11f734188d4b895c82da85a609cd119c","observation_id":"9a32a376-1b84-4256-976b-4d5562f120e3","resolution":{"observed_at":"2026-08-14T11:08:49.049662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:49.025911Z","title":"Continuous-time flows for efficient inference and density estimation, 2018","venue":null,"work_id":"345852ef-75fc-4c41-afdb-cd1af8b4938a","year":2018},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.626143Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:566622ab5a9b23c4a57f04f2d136b3dfe9c3739232965fe427a8369603bd66c4","observation_id":"dcfde0aa-5265-4f0e-8f4f-2bc5a3fbe5eb","resolution":{"observed_at":"2026-08-14T11:08:49.032935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:49.007378Z","title":"Generative adversarial nets","venue":null,"work_id":"8a0471b3-4264-4a8c-8c1a-1f71eea429a2","year":2014},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.725938Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:448d6ae13b7f99ec7518e7e4bd326d3ca81b5707f003d80c60224d710b95c0e7","observation_id":"5ea69632-aa7d-47c6-bdab-8359e74d47d0","resolution":{"observed_at":"2026-08-14T11:08:49.014213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1702.08235","last_updated":"2017-02-27T11:16:54Z","snapshot_observed_at":"2026-08-14T21:14:37.266884Z","submitted_at":"2017-02-27T11:16:54Z","title":"Variational Inference using Implicit Distributions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.08235","snapshot_observed_at":"2026-08-14T11:08:46.735741Z","title":"Variational inference using implicit distri- butions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.735741Z"},"links":{"cited_paper":"/paper/1702.08235","citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:20f10ae42f9078e8a3dd60ab6891a3df6d5734c98bbd5b9c50d999db816c74a0","observation_id":"ad35fb0a-70f3-4c57-ba60-d94f264c7ec5","resolution":{"observed_at":"2026-08-14T11:08:46.735741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:48.987688Z","title":"Unbiased im- plicit variational inference","venue":null,"work_id":"97ee1343-702b-4782-9e9e-b738798d5afd","year":2019},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.744205Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:4072453502764f87f8709f2837228b08249864779a3c1669bb9900850a07a572","observation_id":"94326789-6efb-4d98-a11f-25316d5f6957","resolution":{"observed_at":"2026-08-14T11:08:48.994299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1805.11183","last_updated":"2018-05-28T21:55:02Z","snapshot_observed_at":"2026-08-14T19:10:10.295877Z","submitted_at":"2018-05-28T21:55:02Z","title":"Semi-Implicit Variational Inference","version":1},"cited_work":{"arxiv_id":"1805.11183","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.11183","snapshot_observed_at":"2026-08-14T11:08:47.723785Z","title":"Semi-Implicit Variational Inference","venue":"stat.ML","work_id":"578f3e51-5a2f-41a5-bd12-8e232e873687","year":2018},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.751209Z"},"links":{"cited_paper":"/paper/1805.11183","citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:ca4ec86cf9e779ab3e95e3d6a0a184119ce3aea29fb07650c2a792560d0f0f03","observation_id":"07c0d969-972b-40c8-a94e-b63a7c22852d","resolution":{"observed_at":"2026-08-14T11:08:47.741094Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:48.969367Z","title":"Learning deep latent gaussian mod- els with markov chain monte carlo","venue":null,"work_id":"fcda778e-d12c-40d4-8c2b-6ab78b55156f","year":2017},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.820900Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:e7f31c0861ab1056f282a5674bd26fdd5fddf7d1bbfbdb2d40bcba4ab4346f7d","observation_id":"1400b346-7f66-4133-b859-44bbfcb462c8","resolution":{"observed_at":"2026-08-14T11:08:48.976250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06626","last_updated":"2017-10-30T21:27:44Z","snapshot_observed_at":"2026-08-14T20:46:19.270716Z","submitted_at":"2017-07-20T17:35:52Z","title":"Learning to Draw Samples with Amortized Stein Variational Gradient Descent","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06626","snapshot_observed_at":"2026-08-14T11:08:46.829357Z","title":"Learning to draw samples with amortized stein variational gradient descent","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.829357Z"},"links":{"cited_paper":"/paper/1707.06626","citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:6fb9541bc5bf364e6d50372f13597cb313469956c0526802f361514478588257","observation_id":"b0ec4b98-bc82-470f-846d-957bd27ec226","resolution":{"observed_at":"2026-08-14T11:08:46.829357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.03558","last_updated":"2018-05-27T18:04:22Z","snapshot_observed_at":"2026-08-14T19:56:10.663793Z","submitted_at":"2018-01-10T21:24:59Z","title":"Inference Suboptimality in Variational Autoencoders","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.03558","snapshot_observed_at":"2026-08-14T11:08:46.839043Z","title":"In- ference suboptimality in variational autoencoders","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.839043Z"},"links":{"cited_paper":"/paper/1801.03558","citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:3f0275b6276aa27c10309e39c6b9e49cb6a8221a72555a7a6f3b3676c0af592b","observation_id":"1c6ddf12-6dcf-4a34-83b5-36d7da273e83","resolution":{"observed_at":"2026-08-14T11:08:46.839043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:48.950802Z","title":"A contrastive di- vergence for combining variational inference and mcmc","venue":null,"work_id":"bada1b57-09f6-477b-bccc-34ea40b0eef8","year":2019},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.889736Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:03997c8135b019894d1c9c2e1e2b95f1ae4edd08ba7d12130d5733b87c1eb6d3","observation_id":"7d1625a6-5e89-419d-9008-f13e71b199fe","resolution":{"observed_at":"2026-08-14T11:08:48.958005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:48.927805Z","title":"Bayesian learning via stochastic gradient langevin dynamics","venue":null,"work_id":"5de35ea7-7f07-4ef9-a9da-1446c7265fa8","year":2011},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.976430Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:f7cc6bb4bf5683efe4ae6e147fa624cd404b3a68a7d7209c2243e22744a07795","observation_id":"90539709-1111-4686-934e-4e2cb6cbba51","resolution":{"observed_at":"2026-08-14T11:08:48.935764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:48.892518Z","title":"Preconditioned stochastic gradient langevin dynamics for deep neural networks","venue":null,"work_id":"249c73ec-4710-4912-8884-d22ddfc031a3","year":2016},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:46.988233Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:530bbac5f51fb31b56be901d13449c63114ea091f0a522be7778152734f8da93","observation_id":"1021e34a-028b-426f-97e0-edadf6db407f","resolution":{"observed_at":"2026-08-14T11:08:48.916058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:48.874099Z","title":"High-order stochastic gradient thermostats for bayesian learning of deep models","venue":null,"work_id":"9b3ba875-0924-4f8b-8e56-ecac5d47fe51","year":2016},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:47.070012Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:65cd586529132ccc82aa00e6e31666ef84f62e70139e508e7065925d98e7d0df","observation_id":"7ddafd66-1ab6-42d7-a4e0-a95e45368338","resolution":{"observed_at":"2026-08-14T11:08:48.879670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:48.840078Z","title":"Adageo: Adaptive geometric learning for optimization and sampling","venue":null,"work_id":"2cbf8e75-e068-435a-93ec-12f46ad3c056","year":2018},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:47.076214Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:c3f8e9a99636b6cd1137932a3fa7d0762f3746b49e026c147d1bd64b15176055","observation_id":"52f8e861-4801-4bd1-80bc-dfaa9a0d88ef","resolution":{"observed_at":"2026-08-14T11:08:48.861284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1812.00071","last_updated":"2020-02-22T12:35:45Z","snapshot_observed_at":"2026-08-14T17:50:20.148851Z","submitted_at":"2018-11-30T22:06:15Z","title":"Stochastic Gradient MCMC with Repulsive Forces","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.00071","snapshot_observed_at":"2026-08-14T11:08:47.084130Z","title":"Stochastic gra- dient mcmc with repulsive forces","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:47.084130Z"},"links":{"cited_paper":"/paper/1812.00071","citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:a526a1402c000cf9009552b13d04915d239810b4b557b311602e513780c35fe4","observation_id":"a76ef65f-336b-4df0-81f3-cbe5f9479051","resolution":{"observed_at":"2026-08-14T11:08:47.084130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:48.818813Z","title":"Stochastic gradient descent as approximate bayesian in- ference","venue":null,"work_id":"419d89d3-29bc-4e45-9506-d4d8738a1ddb","year":2017},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:47.102640Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:d2640fadc73333f46d33fdfe654025fe3b9a816b2562979edb9b4e6e1ab56281","observation_id":"b1c45f6e-9c21-4a39-8300-769eb95d7279","resolution":{"observed_at":"2026-08-14T11:08:48.826435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:48.720884Z","title":"Stein variational gradient descent: A general purpose bayesian inference algorithm","venue":null,"work_id":"df28e717-3376-4d59-ba8f-b670c1cd0a3d","year":2016},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:47.132255Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:5764c26c81fc2d2c71337f0cf72cf186a176175caf6d75155f4d19be57c316a1","observation_id":"cb609506-a655-4a0a-9a28-d14e2f9acdc1","resolution":{"observed_at":"2026-08-14T11:08:48.802720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:48.597127Z","title":"Early stopping as nonparametric variational inference","venue":null,"work_id":"26dd0bef-5f1a-4c99-bf9f-7d45624539f9","year":2016},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:47.138417Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:2a07683f34c3a4ebe88ab3ed165c75ad0057194348dca19cb48b2da643ef766d","observation_id":"de642067-8cb9-46e5-a2a6-24d9dd5299ab","resolution":{"observed_at":"2026-08-14T11:08:48.624321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-14T18:51:16.666127Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-14T11:08:47.144132Z","title":"Adam: A method for stochastic optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:47.144132Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:cbd08f1fa32172c19549dd649abd95458106dcc5ede7f5ccbc1abc2ab7122ad7","observation_id":"51dc61f8-0f5c-458e-9b28-4db5da2645d7","resolution":{"observed_at":"2026-08-14T11:08:47.144132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:48.561400Z","title":"Forward and reverse gradient-based hyperparameter optimization","venue":null,"work_id":"f719f8b8-c86f-4fe5-8ccb-4a1e352c70d7","year":2017},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:47.149092Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:3e7fd563ef7a0db6a30b7299336f47d48885ef613829138fe5b46733115577e8","observation_id":"88859f73-21a9-49dd-8c19-8d055ca0d21e","resolution":{"observed_at":"2026-08-14T11:08:48.582929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:48.529833Z","title":"Coupled variational bayes via optimization embedding","venue":null,"work_id":"0357a20b-2311-4037-b548-476d315ecf25","year":2018},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:47.183946Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:0f9efef59bfa5e3018c94c52bef2131cc5e72f434d4851804495f569ef9b8c38","observation_id":"ef2d625c-35a4-487f-b542-9cdb030b628f","resolution":{"observed_at":"2026-08-14T11:08:48.535436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:48.370272Z","title":"Implicit deep latent variable models for text generation","venue":null,"work_id":"a5cfbbf8-1d4f-4110-a5d5-f7782f1075cc","year":2019},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:47.284580Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:1c15e7b1bb92cbbbd7b98c9f3fb6d9dc8ea30730c3a493ebd698ecceb59a9004","observation_id":"ae37e56c-ab6e-4c04-9441-712a68d7abd5","resolution":{"observed_at":"2026-08-14T11:08:48.440537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:47.291811Z","title":"Automatic differentiation in pytorch","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:47.291811Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:21a382f92626c14794478041a97404afd1f1aa41ce68b0e841a9eb8d2849a052","observation_id":"504308f2-1d04-448e-b8dd-eb72cc6c80b6","resolution":{"observed_at":"2026-08-14T11:08:47.291811Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:48.216303Z","title":"Fundamentals of Kalman filtering: a practical approach","venue":null,"work_id":"0f85d2fb-f53e-4efc-888e-9003a856346d","year":2013},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:47.306907Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:ea842101f785ac4ee6b07a08b7a4ef8f56c44000af5ee64ef24a16fd7074d62d","observation_id":"0f2d2358-e2d6-4b41-a6de-319c36af84a5","resolution":{"observed_at":"2026-08-14T11:08:48.286783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:47.393960Z","title":"Strictly proper scoring rules, prediction, and estimation","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:47.393960Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:593f4a3dc413af80305d83770e1e9dd67ba3454495c453ab866583e0efa066d6","observation_id":"f5ffec4b-da55-4876-ab73-9e5e123d8f46","resolution":{"observed_at":"2026-08-14T11:08:47.393960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:48.088336Z","title":"Atmospheric carbon dioxide record from mauna loa","venue":null,"work_id":"019d970e-c4d8-4bce-be9b-ed64407d2046","year":2005},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:47.416348Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:e438265a7d2ea6ac2f176c9c6681d1703d701cff12bc834517cd9c42bce5b1c8","observation_id":"f92cba4e-a9f2-49d8-a959-86b10931bc3e","resolution":{"observed_at":"2026-08-14T11:08:48.163974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:48.008532Z","title":"Influence dia- grams","venue":null,"work_id":"2ac3d43d-ff94-4ee8-832b-6d1d409b7edc","year":2005},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:47.423852Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:b90575945cc67fbf527cb53e75f6c2c65a45abad0c83b3e4204e9d7902cdb216","observation_id":"8e95a3f5-4c81-4eff-ba9c-73ce90ee8485","resolution":{"observed_at":"2026-08-14T11:08:48.057639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:47.989130Z","title":"Shachter","venue":null,"work_id":"1ffc4fc3-2189-4103-902f-1bafd3b592c4","year":1988},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:47.430061Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:220e400e351084bb0e79f7c18557b954e773437db661875935ae32610b5438cc","observation_id":"62b075fa-4038-4ba0-9ac4-c7eb2661c890","resolution":{"observed_at":"2026-08-14T11:08:47.995387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:47.916202Z","title":"A spectral ap- proach to gradient estimation for implicit distributions","venue":null,"work_id":"d2273228-2027-44bd-9c25-cd309674e553","year":2018},"citing_paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs","version":4},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T11:08:47.439543Z"},"links":{"citing_paper":"/paper/1908.09744"},"observation_digest":"sha256:c4707b4a107cd3d042dcf1836e2e66de25cee563e4bd86e917457b3a1faaf1a3","observation_id":"c94a7cd4-9542-4455-87f9-8b8cb854eb3d","resolution":{"observed_at":"2026-08-14T11:08:47.949084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"1908.09744","last_updated":"2020-02-22T13:26:21Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T07:37:35.220486Z","submitted_at":"2019-08-26T15:38:30Z","title":"Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":2,"verified_fuzzy":35},"total_outbound_references":47},"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 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:1908.09744."}