{"as_of":"2026-08-16T18:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8cd67e21cf4c8fc1eb85e458e59d11c93a46e08e3a502aaf4f7cded06eb50422","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T18:11:00.835812Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"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/2411.11983/citation-record","integrity":"/paper/2411.11983/integrity","json":"/paper/2411.11983/citation-record.json","paper":"/paper/2411.11983"},"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-12T18:11:01.335111Z","title":null,"venue":null,"work_id":"61095027-b756-463e-906a-1c56b0da48ff","year":1977},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.693838Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:fe1af85ced3f134dbd7fd26372dd9e7248576f11b4977b953d69d94132db0482","observation_id":"98e60ff8-1768-487c-9097-b41d9bf2ead2","resolution":{"observed_at":"2026-08-12T18:11:01.340436Z","resolver_source":"raw_fallback","status":"unresolved"},"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-12T18:11:00.699615Z","title":"Blei, Alp Kucukelbir, and Jon D","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.699615Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:03c6435e8b4726c8f029beceabac50615e547eeb87e32e8f60e41bbf605735d2","observation_id":"e2a8e300-a126-4ac2-9b1e-9da31cfcc97e","resolution":{"observed_at":"2026-08-12T18:11:00.699615Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:11:00.704905Z","title":"Parno and Youssef M","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.704905Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:dbfcaa8dafee79f37f9213cd589eaa730e466c80e3d0a5127be4d907c526ee38","observation_id":"01f974a8-4220-4911-87a9-17f2428b36a7","resolution":{"observed_at":"2026-08-12T18:11:00.704905Z","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-12T18:11:01.307045Z","title":"Brubaker, and Roy R","venue":null,"work_id":"de3f32da-61cf-4587-8d69-1ce0b8ffbdc8","year":2022},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.710179Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:bdedbcc1a6d4b01012c9af56f96c8c10760e89aa2e0a2997ae8ecb0f3d52d66b","observation_id":"406a19d4-7114-4f41-8d1c-56e1cc6533bf","resolution":{"observed_at":"2026-08-12T18:11:01.312220Z","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":"2308.09769","last_updated":"2023-08-18T18:47:17Z","snapshot_observed_at":"2026-08-16T15:07:27.160813Z","submitted_at":"2023-08-18T18:47:17Z","title":"Pigeons.jl: Distributed Sampling From Intractable Distributions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09769","snapshot_observed_at":"2026-08-12T18:11:00.716037Z","title":"Pigeons.jl: Distributed sampling from intractable distributions, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.716037Z"},"links":{"cited_paper":"/paper/2308.09769","citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:206250a9a451d61137b5f9592c9d1d77b4d31b421ca2821030a4b29316670828","observation_id":"a91b246a-b5ee-4768-9afe-f62636b35806","resolution":{"observed_at":"2026-08-12T18:11:00.716037Z","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-12T18:11:01.288348Z","title":"An adaptive-mcmc scheme for setting trajectory lengths in hamiltonian monte carlo","venue":null,"work_id":"83a81385-52ee-4c32-b687-b987ebbcee55","year":2021},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.721931Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:dfb2be247c58460cd67e1d185699e61656eeae841d7dd600221fc69fdf063844","observation_id":"71e171ac-7aa9-451c-930d-04dd70a9602a","resolution":{"observed_at":"2026-08-12T18:11:01.294305Z","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":"2201.05002","last_updated":"2023-05-13T18:43:06Z","snapshot_observed_at":"2026-08-16T17:28:33.406186Z","submitted_at":"2022-01-13T14:33:57Z","title":"Boost your favorite Markov Chain Monte Carlo sampler using Kac's theorem: the Kick-Kac teleportation algorithm","version":2},"cited_work":{"arxiv_id":"2201.05002","doi":null,"metadata_source":"pith","pith_arxiv_id":"2201.05002","snapshot_observed_at":"2026-08-12T18:11:00.931543Z","title":"Boost your favorite Markov Chain Monte Carlo sampler using Kac's theorem: the Kick-Kac teleportation algorithm","venue":"stat.CO","work_id":"eb6063e8-82b5-4fdc-9bb9-33c44b583c5d","year":2022},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.729259Z"},"links":{"cited_paper":"/paper/2201.05002","citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:b01ffbc5261ce1b5fb35eba48db60c3c856944f53f141db850e403dfa748d46e","observation_id":"abc29de8-a660-435f-8de6-7f01ddc5fb4f","resolution":{"observed_at":"2026-08-12T18:11:00.937923Z","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-12T18:11:01.271524Z","title":"On the notion of recurrence in discrete stochastic processes","venue":null,"work_id":"2c232417-e926-4312-94a1-d8ab2e8db73c","year":1947},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.734324Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:564f6f9b7942af8964c5f4c2917e6497e85f47101993e8f059a2b4789fa4de84","observation_id":"15442971-1846-47b9-a4e3-1e6320ddda1f","resolution":{"observed_at":"2026-08-12T18:11:01.276931Z","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-12T18:11:00.739648Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.739648Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:d5ee8dc53c173ace96697c6bce12243072e0ff7319217f1663028bf7ea982cd0","observation_id":"6b4d3b47-8561-4eaf-8e56-932eb4c858fb","resolution":{"observed_at":"2026-08-12T18:11:00.739648Z","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-12T18:11:01.243998Z","title":"On the Two Different Aspects of the Representative Method : The Method of Stratified Sampling and the Method of Purposive Selection","venue":null,"work_id":"242bf8c7-f95c-4cbc-9cb8-18600a7819e3","year":1934},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.744510Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:e270e266483362aa30b05a5e92524c489153b46ed0d2fe0d5a56e1de3d4a5e0c","observation_id":"0489190b-650a-4444-986b-8f066e9316c8","resolution":{"observed_at":"2026-08-12T18:11:01.249384Z","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":"2305.18268","last_updated":"2024-03-28T00:57:58Z","snapshot_observed_at":"2026-08-16T15:28:35.501239Z","submitted_at":"2023-05-29T17:41:15Z","title":"Efficiency of reversible MCMC methods: elementary derivations and applications to composite methods","version":2},"cited_work":{"arxiv_id":"2305.18268","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.18268","snapshot_observed_at":"2026-08-12T18:11:00.909107Z","title":"Efficiency of reversible MCMC methods: elementary derivations and applications to composite methods","venue":"math.PR","work_id":"50fd68e3-08c5-4c95-9044-4f7ff7388f5a","year":2023},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.749308Z"},"links":{"cited_paper":"/paper/2305.18268","citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:bd2627a4942babd86d068e8b9e627009417b784ac358f9ddc55bcb4ba069d3f1","observation_id":"bd3eb011-0327-48bf-a433-b84aab2194e0","resolution":{"observed_at":"2026-08-12T18:11:00.914434Z","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":{"arxiv_id":"2406.17699","last_updated":"2024-10-15T22:05:38Z","snapshot_observed_at":"2026-08-16T13:39:42.389386Z","submitted_at":"2024-06-25T16:38:53Z","title":"Variance Reduction for the Independent Metropolis Sampler","version":2},"cited_work":{"arxiv_id":"2406.17699","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.17699","snapshot_observed_at":"2026-08-12T18:11:00.884103Z","title":"Variance Reduction for the Independent Metropolis Sampler","venue":"math.ST","work_id":"0854aa96-5575-44ba-bf7e-50eb1cf3117b","year":2024},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.755137Z"},"links":{"cited_paper":"/paper/2406.17699","citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:ab41aa1c514bd6499702a66c2f90d67d882af7a37088eb50d050e852e771e02b","observation_id":"53532304-661f-4ab2-b1de-e4f467a2f5e8","resolution":{"observed_at":"2026-08-12T18:11:00.891098Z","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-12T18:11:01.227686Z","title":null,"venue":null,"work_id":"0658ec9b-2b61-4c97-b367-9fc9ae57cd7e","year":1994},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.760474Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:09bb7410b4803b7d0aeab819acceb0f96605f80684d7611940a400aab20506b7","observation_id":"8eebf65b-2a65-48a1-b053-ef4a1301bb8e","resolution":{"observed_at":"2026-08-12T18:11:01.233184Z","resolver_source":"raw_fallback","status":"unresolved"},"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-12T18:11:01.211862Z","title":"Geometric Ergodicity and Hybrid Markov Chains","venue":null,"work_id":"b0b53745-73ee-4094-b528-859cbd821ef3","year":1997},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.764986Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:a36dfe62bf8e31273c28fbef3d3bafe869e0efee16559bf53da8051ba6e184c7","observation_id":"e357d132-166d-4b37-b577-e27b485f742b","resolution":{"observed_at":"2026-08-12T18:11:01.217102Z","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-12T18:11:01.196263Z","title":"Markov chains for exploring posterior distributions","venue":null,"work_id":"2008fbb0-5585-4443-8e5f-e95d38fd8d0f","year":1994},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.770222Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:c8967fb0514fff59aca2df1fb594c2a2803364da201152b2531223bd51eddb4d","observation_id":"312c304e-b648-424e-aa80-3682dc2dc2ed","resolution":{"observed_at":"2026-08-12T18:11:01.201106Z","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-12T18:11:01.179218Z","title":"Estimating epidemic exponential growth rate and basic reproduction number","venue":null,"work_id":"319a826d-d2ed-4278-bb29-e7be93f26fa2","year":2020},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.775115Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:3e73c47f9e07e7169f6ac282b8fc22e80d1f0af514cd8dee6aca83a17eb9c7d3","observation_id":"b3c9adea-e280-45b3-8184-a061e17a19e5","resolution":{"observed_at":"2026-08-12T18:11:01.184672Z","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-12T18:11:01.162545Z","title":"Roberts and Jeffrey S","venue":null,"work_id":"af22a298-58e1-47aa-9cd2-f1ef24f04365","year":2001},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.780041Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:57fd742bd12caf031cf346765837ed5e4aeda71e292d3638d154dc3c6c041d42","observation_id":"1207be8b-2e6e-4b6f-84d6-cf6fe7439c92","resolution":{"observed_at":"2026-08-12T18:11:01.167914Z","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-12T18:11:01.145013Z","title":"Algebraic and group structure for bipartite anisotropic ising model on a non-local basis","venue":null,"work_id":"b90fc11e-e917-41a7-9a95-7b099f72e3ce","year":2015},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.784591Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:514fed52fab519ba6052cefb803ba25744764eeffc5bbf798260c006acf3ade1","observation_id":"90f30545-c054-48f8-b6ab-54675b52f517","resolution":{"observed_at":"2026-08-12T18:11:01.150583Z","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-12T18:11:01.128483Z","title":"Efficiently learning ising models on arbitrary graphs","venue":null,"work_id":"a6dd4c40-e899-4397-aa92-e28a68f97b62","year":2015},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.789495Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:1f4e66ea8b6c351dcbc929e74e22fa903bd5da9114fdbe0e3850b224bc07f284","observation_id":"e725677a-0026-473c-86fd-aa81b9147c5f","resolution":{"observed_at":"2026-08-12T18:11:01.134111Z","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-12T18:11:01.111726Z","title":"Ising-like models on arbitrary graphs: The hadamard way","venue":null,"work_id":"baf492ef-e274-44e9-ae5a-47b2cd869b47","year":2015},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.794877Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:a418720e1bef9bfab4e08186e2403e64666170861d800acaf9e8bdffea63e442","observation_id":"046bd4fe-80f4-4ed1-bc36-76df3f8179ca","resolution":{"observed_at":"2026-08-12T18:11:01.117746Z","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-12T18:11:01.091568Z","title":"Metropolis, Arianna W","venue":null,"work_id":"0d5abdac-5929-4d56-9cfe-c9dda5afa90f","year":1953},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.800599Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:7fabfc9a232c715fc4845c7beb3ebc15c9bd21c06bf534117698a9b49e00db78","observation_id":"819d229f-866f-4ecd-aa37-f7e066a66fe3","resolution":{"observed_at":"2026-08-12T18:11:01.096597Z","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-12T18:11:01.073799Z","title":"Collective monte carlo updating for spin systems","venue":null,"work_id":"12f7235b-baaf-492d-81ea-dd22db830706","year":1989},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.805665Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:0bfdb8ba6fb77dfaa9143a1c906a821b8814745ed9e10f11d648c7c4795b9c25","observation_id":"b2cc82ea-4c6f-4b8e-b4d2-8045cbabf005","resolution":{"observed_at":"2026-08-12T18:11:01.079078Z","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-12T18:11:01.056430Z","title":"A review of stochastic block models and extensions for graph clustering","venue":null,"work_id":"f8e5e5fb-5ff3-4533-9906-20b01a21f4fe","year":2019},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.810487Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:c579bf50fe8e1bf09ac3d8fc3f54eb9ae66359b6d81c091e1b716949a72b39a8","observation_id":"fd647776-942d-412e-b7d9-4b84aeeb6d8c","resolution":{"observed_at":"2026-08-12T18:11:01.062124Z","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-12T18:11:01.039142Z","title":"Efficient exact sampling from the ising model using swendsen-wang","venue":null,"work_id":"c70807de-2018-4eda-aa47-f4e3062cb00a","year":1999},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.815430Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:0ffe4cc2dc2b9f7e5bac8fefa10c36ed6119fa5d126debaf056cea1dd28f8dbb","observation_id":"819ced10-2f16-44b9-9bc3-3c6bd22039c3","resolution":{"observed_at":"2026-08-12T18:11:01.044292Z","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-12T18:11:01.022522Z","title":null,"venue":null,"work_id":"a81fee04-0b2c-44e0-bc38-ed96209add27","year":2006},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.820702Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:9153cc4f743bea6369ea12b0da720af763e4ee3b85847e2a01107427990ea702","observation_id":"d5c60b9d-3ae1-4c35-850a-fa6dbbab912e","resolution":{"observed_at":"2026-08-12T18:11:01.027927Z","resolver_source":"raw_fallback","status":"unresolved"},"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-12T18:11:01.004114Z","title":"The squeeze method for generating gamma variates","venue":null,"work_id":"1c549d62-510e-4686-a158-a605631704b2","year":1977},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.826058Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:b1b24cf482d2bca14697cfdda78532914cf26862a6000d88170ba1aeb013283e","observation_id":"c23c0c19-8f8c-44ec-9e2f-32f1831b4155","resolution":{"observed_at":"2026-08-12T18:11:01.010492Z","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-12T18:11:00.987056Z","title":"Gallegos-Herrada, David Ledvinka, and Jeffrey S","venue":null,"work_id":"5213c767-ceb6-4247-8292-1ef1803e2f95","year":2024},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.830975Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:0909d78b729a88fb433ad18586def92b7c7278ddb9cc10df1afd0057229292df","observation_id":"2be270d9-e332-4d8a-aed5-776add480f26","resolution":{"observed_at":"2026-08-12T18:11:00.992408Z","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-12T18:11:00.970476Z","title":"Riesz's lemma and orthogonality in normed spaces","venue":null,"work_id":"ed01916d-fc69-4605-9e13-c72fe73efead","year":1986},"citing_paper":{"arxiv_id":"2411.11983","last_updated":"2024-11-18T19:13:59Z","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:00.835812Z"},"links":{"citing_paper":"/paper/2411.11983"},"observation_digest":"sha256:6f5841137bff444cb154255dcc9edcff7fac62cc11dd94f4eaa4a0afa921592c","observation_id":"3e624e91-5f2d-4d7b-864f-3da0dc2026ee","resolution":{"observed_at":"2026-08-12T18:11:00.975825Z","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":"2411.11983","last_updated":"2024-11-18T19:13:59Z","latest_version":1,"primary_category":"stat.CO","snapshot_observed_at":"2026-08-16T16:16:56.151035Z","submitted_at":"2024-11-18T19:13:59Z","title":"The occlusion process: improving sampler performance with parallel computation and variational approximation"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":3,"verified_fuzzy":18},"total_outbound_references":28},"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 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2411.11983."}