{"as_of":"2026-08-15T07:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:418fffe30e9c40636c53ec9ab0d1cef4f0ba5618b08bd60056edd9486723df02","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T06:26:36.109693Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2601.22911/citation-record","integrity":"/paper/2601.22911/integrity","json":"/paper/2601.22911/citation-record.json","paper":"/paper/2601.22911"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T06:26:32.288301Z","title":"Freer, Younesse Kaddar, Jacek Karwowski, Sean Moss, Daniel Roy, Sam Staton, and Hongseok Yang","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:32.288301Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:aaf130c0d7523e082f22dd5e959e0e38ea7915bf47444b26543b503c57ec6bf3","observation_id":"19679e7c-7357-42e8-b57b-efc8af56ca6c","resolution":{"observed_at":"2026-08-03T06:26:32.288301Z","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-03T06:26:32.378306Z","title":"A general perspective on the Metropolis-Hastings kernel","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:32.378306Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:5893b5cfe90e94308990a67323f40917e8e5d92dd0b573d1953ef44be1a96d13","observation_id":"ba2eae3a-d181-46a3-8fbd-c5a06cbcc2b4","resolution":{"observed_at":"2026-08-03T06:26:32.378306Z","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-03T06:26:32.466390Z","title":"Peskun-Tierney ordering for Markovian Monte Carlo: Beyond the reversible scenario.Ann","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:32.466390Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:486c9afcd9c51c97bd8a3751635d8c5c5449e9c34cd3cd407c4cc6d2bbd93294","observation_id":"067d101a-7d86-444a-9b72-6693ebcc581a","resolution":{"observed_at":"2026-08-03T06:26:32.466390Z","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-03T06:26:32.549635Z","title":"GIST: Gibbs self-tuning for locally adaptive Hamiltonian Monte Carlo","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:32.549635Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:fa66e3f37c6b161da1c81e4678de0a5a5f210ac58e98e620d5014a3fb44eb033","observation_id":"3ed3a9fe-96fd-4580-b4a9-699235397a95","resolution":{"observed_at":"2026-08-03T06:26:32.549635Z","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-03T06:26:32.633531Z","title":"Lifting Markov chains to speed up mixing","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:32.633531Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:749543fde721645622840b3da8437f67fe658254ae01fa4a1d54b9144a810697","observation_id":"de1f9246-d87d-4658-ad9a-38d454fcf409","resolution":{"observed_at":"2026-08-03T06:26:32.633531Z","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-03T06:26:32.704806Z","title":"Disintegration and Bayesian inversion via string diagrams.Mathematical Structures in Computer Science, 29(7):938–971, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:32.704806Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:915ea8fb10941818336f126029e53a63f08c6cdb33f13bcc0226bd6a27b0fe6d","observation_id":"8dac7cb6-c6f8-486f-924a-0c050d02dd1b","resolution":{"observed_at":"2026-08-03T06:26:32.704806Z","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-03T06:26:32.762358Z","title":"An intro- duction to effectus theory, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:32.762358Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:35d562e8014590b3521bdee3ee9e0f5011bdb9d56efaf634756aa1394c31880d","observation_id":"500298c2-83df-463b-bfeb-fe03270bb9b2","resolution":{"observed_at":"2026-08-03T06:26:32.762358Z","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-03T06:26:32.843568Z","title":"Lew, and Vikash K","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:32.843568Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:3dc90fb22e3b1cc62395037415dcad7b54cda9b1e3fbc11c0d1c5a8455d69a98","observation_id":"55d560b8-6d0a-45b2-a734-e3658c8bd701","resolution":{"observed_at":"2026-08-03T06:26:32.843568Z","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-03T06:26:32.934600Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:32.934600Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:f6c0925b586c3012f45d192727030fd2ae49cff12db5a3334fb3d08ad445f273","observation_id":"2934366c-051f-4571-8c82-966f62ecc62d","resolution":{"observed_at":"2026-08-03T06:26:32.934600Z","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-03T06:26:33.018415Z","title":"A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics.Advances in Mathematics, 370:107239, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:33.018415Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:c1bff0e6bc89c12143394231f39cc651b2f35b7c2aa130832fd8f9f7a62552c3","observation_id":"720d4486-cef3-46e1-a05d-5770645a920b","resolution":{"observed_at":"2026-08-03T06:26:33.018415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.14049","last_updated":"2023-08-25T11:22:48Z","snapshot_observed_at":"2026-08-15T05:08:39.593235Z","submitted_at":"2023-03-24T15:01:05Z","title":"Weakly Markov categories and weakly affine monads","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.14049","snapshot_observed_at":"2026-08-03T06:26:33.082440Z","title":"Weakly markov categories and weakly affine monads.arXiv preprint arXiv:2303.14049, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:33.082440Z"},"links":{"cited_paper":"/paper/2303.14049","citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:a5f4bd86713d2269018473bbee58ff43aded14aa8af3d3b8c725b7e08f77448b","observation_id":"fd032c1f-f68f-4e94-bc32-e3149e0f2e9b","resolution":{"observed_at":"2026-08-03T06:26:33.082440Z","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-03T06:26:33.163430Z","title":"Absolute continuity, supports and idempotent splitting in categorical probability","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:33.163430Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:c2fa3bac260a66a10c40139120f5552d78494bf71a980f84a3ab193c03509608","observation_id":"367098d7-466c-4217-8c77-3beb4953433c","resolution":{"observed_at":"2026-08-03T06:26:33.163430Z","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-03T06:26:33.189543Z","title":"De Finetti’s Theorem in Categor- ical Probability.Journal of Stochastic Analysis, 2(4), 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:33.189543Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:9dd6a6e1c9afe9e6bd87215aaca8e6be071a8eb01a79b55c9f1774f227b444b5","observation_id":"0351740e-53a3-46de-9b34-4007fa1ce806","resolution":{"observed_at":"2026-08-03T06:26:33.189543Z","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-03T06:26:33.292726Z","title":"When coproducts are biproducts.Mathe- matical Proceedings of the Cambridge Philosophical Society, 161(1):47–51, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:33.292726Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:160e6d440b2583690b135661238eb5672d6bf0958079593afe0f622712c68a2a","observation_id":"c96bbff4-35aa-4cde-b832-4a5901c88c69","resolution":{"observed_at":"2026-08-03T06:26:33.292726Z","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-03T06:26:33.408635Z","title":"Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images.IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-6(6):721–741, 1984","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:33.408635Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:6f8640834167f580fc006179739808e73102124bed7f48305f500fdde84ec4fe","observation_id":"732e58d6-e43e-4798-8ea9-766f5391a86e","resolution":{"observed_at":"2026-08-03T06:26:33.408635Z","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-03T06:26:33.524532Z","title":"On the accept-reject mechanism for Metropolis–Hastings algorithms.Annals of Applied Probability, 33(6B):5279–5333, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:33.524532Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:2625930e831ef05ce1e9b8c0dbe03a121446ab45786220601c6c454fecce357d","observation_id":"a3bfeab2-c7ef-4fb9-a5b3-7db235065617","resolution":{"observed_at":"2026-08-03T06:26:33.524532Z","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-03T06:26:33.662016Z","title":"Parallel MCMC algorithms: theoretical foundations, algorithm design, case studies.Transactions of Mathematics and Its Applications, 8(2), 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:33.662016Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:4e87492d124c1a900142070d5bded14079535109f6aa9854e48baf6ac85062a7","observation_id":"996809ca-5fc8-4a86-b181-9fb99fd9b2a7","resolution":{"observed_at":"2026-08-03T06:26:33.662016Z","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-03T06:26:33.797537Z","title":"Reversible Jump Markov Chain Monte Carlo Computation and Bayesian Model Determination.Biometrika, 82(4):711–732, 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:33.797537Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:60d61218d1c4de1684213dd2c4111f62556187fd2c70a44cad2543ca69e14b3e","observation_id":"81186cfe-aa49-4d74-80b4-ce5664f7cca5","resolution":{"observed_at":"2026-08-03T06:26:33.797537Z","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-03T06:26:33.902032Z","title":"Springer, 1974","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:33.902032Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:5ddb02beb2233e10e6b9a688f27fa6d3a10c1dc23b8b5e563a39fc4006b0059a","observation_id":"ff03dd27-4e00-4d7d-b877-7103eed5f04c","resolution":{"observed_at":"2026-08-03T06:26:33.902032Z","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-03T06:26:34.006389Z","title":null,"venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:34.006389Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:b90f2b9058507175d7d014402e4a196e385168c22299cbc747586f4a53f88722","observation_id":"7a4ab198-1968-46c7-aa84-75bf02a8c4a4","resolution":{"observed_at":"2026-08-03T06:26:34.006389Z","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-03T06:26:34.135432Z","title":"The geometry of tensor calculus, I.Advances in Mathematics, 88(1):55–112, 1991","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:34.135432Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:fcc0e4c45d267054d46cb0b85419a65fb90f071f89b30989c1dfc95b2916e7e9","observation_id":"35574778-1c04-4524-81d8-462d7fb76864","resolution":{"observed_at":"2026-08-03T06:26:34.135432Z","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-03T06:26:34.231443Z","title":"Springer, 3 edition, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:34.231443Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:8b585301640410ff953a1bf87ebc7098febb08f6484d48e11ff35115112e5ab0","observation_id":"f8871d15-6948-45d4-8795-a3067ebcafbc","resolution":{"observed_at":"2026-08-03T06:26:34.231443Z","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-03T06:26:34.351712Z","title":"CUP Archive, 1982","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:34.351712Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:2cf3c8b58d5cffbb289c9d2d9ba2fcbf83874e44295cc6acc3c7982fbe37793e","observation_id":"bd23318b-6de7-4587-bb40-d0b254631085","resolution":{"observed_at":"2026-08-03T06:26:34.351712Z","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-03T06:26:34.471506Z","title":"AutoStep: Locally adaptive involutive MCMC","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:34.471506Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:8bc4658d6bf9de3be74540723947cdcf6b45affb878d169f64c8e94b1702cad5","observation_id":"a79b7c39-1c04-42e6-ba47-dc890d98296a","resolution":{"observed_at":"2026-08-03T06:26:34.471506Z","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-03T06:26:34.600957Z","title":"Springer Science & Business Media, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:34.600957Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:cfc4da42f6c9a57d0be89b0cbafa1baa652f633b511ff9c72a9d7d1051025a51","observation_id":"5bda2a89-4d73-42ed-bc3e-3d8cd7cfbcb7","resolution":{"observed_at":"2026-08-03T06:26:34.600957Z","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-03T06:26:34.750066Z","title":"Rosenbluth, Marshall N","venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:34.750066Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:8710a518a8589d8c176de9457733617e4c73bde9d7b6fddd139caa527b153bf6","observation_id":"d13d9504-fcb7-41ae-8fb5-7dabc0b86a56","resolution":{"observed_at":"2026-08-03T06:26:34.750066Z","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-03T06:26:34.888678Z","title":"A category-theoretic proof of the ergodic de- composition theorem.Ergodic Theory and Dynamical Systems, 43(12):4166–4192, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:34.888678Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:1892785a3bd2d80a2354dcd9a1d78f68c50b3562849ccfbe8ca5a16c13b66e86","observation_id":"75ffd945-2bd1-4ebf-9ddd-ffe852095b0d","resolution":{"observed_at":"2026-08-03T06:26:34.888678Z","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-03T06:26:35.009763Z","title":"MCMC for doubly- intractable distributions","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:35.009763Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:0b2c0f0da7d780424b88e4c43a0315ac9cec703929363e26a44c3b2778f92398","observation_id":"fd6279c5-553a-4898-b0ac-91e1dbb0e16c","resolution":{"observed_at":"2026-08-03T06:26:35.009763Z","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-03T06:26:35.144651Z","title":"Involutive MCMC: a Unifying Framework","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:35.144651Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:85978b2c00ac88ecffdc88752f7e24e034597f9803351c50d4c154f6f95ae45e","observation_id":"c510b4f9-0264-455d-b2c4-c97a9b33a24c","resolution":{"observed_at":"2026-08-03T06:26:35.144651Z","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-03T06:26:35.261794Z","title":"WORLD SCIENTIFIC, October 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:35.261794Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:47afb013a6a28a801994b9fba192d28e40be304f4650b30ef8c4f9894e344be2","observation_id":"ff8d63a3-5665-42f3-8932-2e842cb60de9","resolution":{"observed_at":"2026-08-03T06:26:35.261794Z","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-03T06:26:35.393327Z","title":"Infinite products and zero-one laws in categorical probability.Compositionality, Volume 2 (2020)(3), 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:35.393327Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:3d5396b705fd75f1af86385587790a56b88d34a9bef88aa03cf2ddbbac1340de","observation_id":"bef1f0f6-6990-41d5-b863-2ecd89afcf90","resolution":{"observed_at":"2026-08-03T06:26:35.393327Z","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-03T06:26:35.457232Z","title":"Robert and George Casella.Monte Carlo Statistical Methods","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:35.457232Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:10a511af8bb4277e1970eb3bf75dd8054ac534b3e91f355be9b0f242fc9d8dc4","observation_id":"5df21e47-2c03-4a2c-889a-f2384d9eecee","resolution":{"observed_at":"2026-08-03T06:26:35.457232Z","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-03T06:26:35.579154Z","title":"Eigenvalue analysis of an irreversible random walk with skew detailed balance conditions.Physical Review E, 93(4):3–8, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:35.579154Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:6c782ab97690baa9f8e676b390c54a6b4cff9c50b7c06baa5adcdaf63e711a7b","observation_id":"f0d9fc63-e280-48ff-a9c2-2a5c6a55779e","resolution":{"observed_at":"2026-08-03T06:26:35.579154Z","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-03T06:26:35.739523Z","title":"A survey of graphical languages for monoidal categories","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:35.739523Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:b61fce91fc0b879c20de82f0c6d5f53e4d9b23f4269d14b2ec8493c0d68bdb01","observation_id":"c0346022-2cf5-4d43-a685-7cc16bd668ed","resolution":{"observed_at":"2026-08-03T06:26:35.739523Z","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-03T06:26:35.857686Z","title":"Commutative semantics for probabilistic programming","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:35.857686Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:52633e73aa245f00a8b10e1d8866ff6673c7738ecad6081c4fc67b470d699bf0","observation_id":"4b70144f-eb39-4d0c-adb5-ccc1532e4092","resolution":{"observed_at":"2026-08-03T06:26:35.857686Z","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-03T06:26:35.955648Z","title":"Nonreversible mcmc from conditional invertible transforms: a complete recipe with convergence guarantees, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:35.955648Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:aa4f3a5b62fa107f43aafa2c69ab94173820fec90aeb44ecfcae9228906fcb84","observation_id":"f607e9d3-d7f6-4327-9021-1009be7e9473","resolution":{"observed_at":"2026-08-03T06:26:35.955648Z","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-03T06:26:36.067774Z","title":"A note on Metropolis-Hastings kernels for general state spaces","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:36.067774Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:accac0fdd92bfae59a9d415ab05f436ac38a4c161c42ab97a02550a9f2224a7d","observation_id":"bf2e140f-8e9f-4ccb-b99c-ad8b56e5a367","resolution":{"observed_at":"2026-08-03T06:26:36.067774Z","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-03T06:26:36.106815Z","title":"Turitsyn, Michael Chertkov, and Marija Vucelja","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:36.106815Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:adac5f8bc575ea43292d92e32dad3ff98b8b1dfb3821ead8f947b2c567fd20f9","observation_id":"03771d12-0ebc-4135-b10f-fd761422cce2","resolution":{"observed_at":"2026-08-03T06:26:36.106815Z","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-03T06:26:36.109693Z","title":"infinitesimal","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T06:26:36.109693Z"},"links":{"citing_paper":"/paper/2601.22911"},"observation_digest":"sha256:dd6b71c4e110f734e4d0081a9e0d16c875def97dec9c5a7b241751c1e7c9b0b0","observation_id":"0767e445-e04f-4870-9d5b-e25921e25eef","resolution":{"observed_at":"2026-08-03T06:26:36.109693Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.22911","last_updated":"2026-07-12T15:56:07Z","latest_version":2,"primary_category":"stat.CO","snapshot_observed_at":"2026-08-11T16:39:02.694163Z","submitted_at":"2026-01-30T12:34:01Z","title":"A categorical account of the Metropolis-Hastings algorithm"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":38,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":39},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2601.22911."}