{"as_of":"2026-08-20T15:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e13078e5e402051486033933652de297febbc529d4d219e1a3c62595dd06a116","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:43:04.037366Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2505.18081/citation-record","integrity":"/paper/2505.18081/integrity","json":"/paper/2505.18081/citation-record.json","paper":"/paper/2505.18081"},"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-07T14:43:06.878790Z","title":"Methods of information geometry, volume 191","venue":null,"work_id":"78f5ebb0-9ff7-4ba3-84d1-2a95ffca0a40","year":2000},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:01.573270Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:e204bbaf75dbe9c8a9632c0cd7d724c2c00417725a99caa236cd5b8fc1313126","observation_id":"09b22cb3-240c-4485-a4d7-c5209de2917a","resolution":{"observed_at":"2026-08-07T14:43:06.963320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.08587","last_updated":"2022-02-17T11:07:55Z","snapshot_observed_at":"2026-08-19T00:45:13.062786Z","submitted_at":"2022-02-17T11:07:55Z","title":"Gradients without Backpropagation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.08587","snapshot_observed_at":"2026-08-07T14:43:01.608123Z","title":"Gradients without backpropagation","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:01.608123Z"},"links":{"cited_paper":"/paper/2202.08587","citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:a2e43585f04e6f7d30ed12d618099c6f83a0d0bf9347b60b60bc55d6c7121bee","observation_id":"9afa3096-b2ac-4ee3-af76-49d4c46a5072","resolution":{"observed_at":"2026-08-07T14:43:01.608123Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1502.04156","last_updated":"2016-08-09T01:57:09Z","snapshot_observed_at":"2026-08-14T23:00:03.765614Z","submitted_at":"2015-02-14T01:11:25Z","title":"Towards Biologically Plausible Deep Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1502.04156","snapshot_observed_at":"2026-08-07T14:43:01.686559Z","title":"Towards biologically plausible deep learning","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:01.686559Z"},"links":{"cited_paper":"/paper/1502.04156","citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:b299534ed363ee27fc18ec1dece2036849a6d4495e35ebcacd324927a78ca2b6","observation_id":"52f3dea8-a087-409e-9e11-1e292b6ca363","resolution":{"observed_at":"2026-08-07T14:43:01.686559Z","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-07T14:43:06.758403Z","title":"A general metric for Riemannian manifold Hamiltonian Monte Carlo","venue":null,"work_id":"ccd62e6a-3a1c-452b-8e2e-bd7050a6f695","year":2013},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:01.793273Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:79e1906a2e55e3c15fc77c0de68da837bdb9e25851c845c01246aaa5e00a43ca","observation_id":"f5f1efe2-382e-43f2-99a9-dd5996913f62","resolution":{"observed_at":"2026-08-07T14:43:06.806383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T14:43:06.586012Z","title":"JAX: composable transformations of Python+NumPy programs, 2018","venue":null,"work_id":"7eddda3b-ff50-4631-a9b9-9a4b50220887","year":2018},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:01.830825Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:1a290c16061a6aea253c8ae96b98088a77dc8a1ac297cd196029358990d89017","observation_id":"d62dc8c2-f72a-4ac2-a2b5-d76beaa44e48","resolution":{"observed_at":"2026-08-07T14:43:06.669991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.10419","last_updated":"2024-08-19T21:12:41Z","snapshot_observed_at":"2026-08-16T13:25:23.422998Z","submitted_at":"2024-08-19T21:12:41Z","title":"Second-Order Forward-Mode Automatic Differentiation for Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.10419","snapshot_observed_at":"2026-08-07T14:43:01.936033Z","title":"Second-order forward-mode automatic differentiation for optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:01.936033Z"},"links":{"cited_paper":"/paper/2408.10419","citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:7b76f624246e67abfd5812a34279ceca954905e6e49a6d65bf6b2ac5edc3e36e","observation_id":"3b815ff9-bcd2-48fd-a152-caaed62bf6c3","resolution":{"observed_at":"2026-08-07T14:43:01.936033Z","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-07T14:43:06.413243Z","title":"Hybrid Monte Carlo","venue":null,"work_id":"2297b88d-8891-4b2b-8b54-1a32b19eca52","year":1987},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:02.004369Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:79fac26872eb049e3421fe292ab0af0688c38fa5fce23738cfb76dcafbb1f516","observation_id":"1191c73f-ab7c-4a87-af1a-73d9bf74be91","resolution":{"observed_at":"2026-08-07T14:43:06.484614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T14:43:02.074308Z","title":"Can forward gradient match backpropagation? In International Conference on Machine Learning, pages 10249–10264","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:02.074308Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:00378644f18688cd01168a118ccad9cdc3f1c53dc5cda12b12244519bf6d96a3","observation_id":"6c87f6cc-a4d0-4f6f-8419-1e63353a9297","resolution":{"observed_at":"2026-08-07T14:43:02.074308Z","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-07T14:43:06.231993Z","title":"Riemann manifold Langevin and Hamiltonian Monte Carlo methods","venue":null,"work_id":"ae095d0e-3d8c-410c-acd3-abc575d13261","year":2011},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:02.173349Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:197803dceed254210afc37e8dcc99e5b42395e94a2fdbd4130c26c7c5a53cb97","observation_id":"e5779dbd-0b74-4b42-a178-7506b3f96d57","resolution":{"observed_at":"2026-08-07T14:43:06.286184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T14:43:02.284625Z","title":"Evaluating derivatives: principles and techniques of algorithmic differentiation","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:02.284625Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:ef94e3ac3781bef53568d93ba039c83f6f3d889379b29a573932b97c86c8c306","observation_id":"6b1ae520-6dbc-4880-92d2-82cef3491b86","resolution":{"observed_at":"2026-08-07T14:43:02.284625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.13345","last_updated":"2022-12-27T02:54:46Z","snapshot_observed_at":"2026-08-16T16:05:54.047188Z","submitted_at":"2022-12-27T02:54:46Z","title":"The Forward-Forward Algorithm: Some Preliminary Investigations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.13345","snapshot_observed_at":"2026-08-07T14:43:02.335806Z","title":"The forward-forward algorithm: Some preliminary investigations","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:02.335806Z"},"links":{"cited_paper":"/paper/2212.13345","citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:215168fed86fb31ff159f789609e6f4606b95727fc16981a07b9437b750c966c","observation_id":"796ad219-b864-415f-876d-99f2345e7a4b","resolution":{"observed_at":"2026-08-07T14:43:02.335806Z","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-07T14:43:06.103897Z","title":"The No-U-Turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo","venue":null,"work_id":"cd0c5705-c3c7-4d29-afa7-97e6ca37c2eb","year":2014},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:02.438190Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:f0c71d6c98ea908aefada8fa2a618dabaa9f4fcd845398f4192872cdc63a32e5","observation_id":"206e65e1-d231-44c2-9db7-3dc1ad3caf6a","resolution":{"observed_at":"2026-08-07T14:43:06.144558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T14:43:05.974543Z","title":"Subspace inference for Bayesian deep learning","venue":null,"work_id":"f30b78f2-b71e-4d40-abe1-2ab7af8e8732","year":2020},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:02.597273Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:4a983385c20b03beb0c14e5cb1089c5b5294ff4ced437aae7413a555ed777530","observation_id":"e104c3fe-1f8e-44e3-ac3a-bdc40e7ed967","resolution":{"observed_at":"2026-08-07T14:43:06.037686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T14:43:05.822907Z","title":"What are Bayesian neural network posteriors really like? In International conference on machine learning, pages 4629–4640","venue":null,"work_id":"7e6d4ee4-a17c-45cb-81cb-5ded6958af50","year":2021},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:02.672951Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:a17bcdc82b77f80aff762f7009170fb589622a09b5bbe35a0fac290463dfe9cb","observation_id":"6d5400d2-e0c0-4879-bf94-bedc14e25173","resolution":{"observed_at":"2026-08-07T14:43:05.896865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T14:43:05.690119Z","title":"Decoupled neural interfaces using synthetic gradients","venue":null,"work_id":"38f43593-23ab-40eb-add8-c166e2444bd5","year":2017},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:02.771607Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:c222b85eadc8657bb06aa5ca478bc2c697700c9de9afb20a141f52dd5e23d17b","observation_id":"7b6d1d45-8aa5-41a1-a58f-38fcfb6884ed","resolution":{"observed_at":"2026-08-07T14:43:05.729108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T14:43:02.848664Z","title":"Learning multiple layers of features from tiny images","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:02.848664Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:b53313c1b55f4122bd80564ec98ced95c2ab567605593017bb6fde249ce8e433","observation_id":"bb4fc4e4-9a82-41d9-a67c-f89eab5db4f7","resolution":{"observed_at":"2026-08-07T14:43:02.848664Z","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-07T14:43:02.899316Z","title":"ArviZ a unified library for exploratory analysis of Bayesian models in Python","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:02.899316Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:fb8fea514c8bc372b3d48308ce3ad7c64dd0e102b2926d3a33c7fea0f169c589","observation_id":"0c8ae86e-0461-46a0-8fee-6553ae39380b","resolution":{"observed_at":"2026-08-07T14:43:02.899316Z","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-07T14:43:02.974109Z","title":"Gradient-based learning applied to document recognition","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:02.974109Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:16b5bc74dba6ca65eb1bee70fd97cfc528a80cc1411fd31f72b975b5155cce36","observation_id":"e4a1b9df-aa29-4d64-abaf-2078f257d950","resolution":{"observed_at":"2026-08-07T14:43:02.974109Z","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-07T14:43:05.519674Z","title":"Bayesian Learning for Neural Networks","venue":null,"work_id":"c417adfd-af56-4d0b-a71d-16d7451ec31b","year":1995},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:03.043375Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:94a000174ece8ec8366567970b4a781754e8b5c34e87bc7b047313e001a4cd5c","observation_id":"a80720ba-7514-4b1c-89e9-55552c88ab82","resolution":{"observed_at":"2026-08-07T14:43:05.585086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T14:43:05.408674Z","title":"Slice sampling","venue":null,"work_id":"7c19ad42-e972-478e-be7f-2871f347aadd","year":2003},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:03.100488Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:706728a3d356c3fc35a82485e7a5bf4a11463a65250b808fbe1a7020b9fed89e","observation_id":"cc10b6c8-d6cf-43b4-9a71-420996a0e2e1","resolution":{"observed_at":"2026-08-07T14:43:05.463877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T14:43:05.287430Z","title":"MCMC Using Hamiltonian Dynamics","venue":null,"work_id":"959c0efd-cfef-472d-90d4-c452766a932a","year":2011},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:03.161744Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:0dbe1a9226b7bf14b075d00989b8cfb5724d1317f6b07bc12319cfd0cac4e83c","observation_id":"faa6d1cf-9883-4ff8-b884-bc3fba9cb774","resolution":{"observed_at":"2026-08-07T14:43:05.332444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T14:43:03.240393Z","title":"Pytorch: An imperative style, high-performance deep learning library","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:03.240393Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:ae915418e55658c92f2762698a7ed68a491eb4e0035aa87c53fc23634656912d","observation_id":"2851ed70-03bf-48eb-a7b0-28c04f9e52a4","resolution":{"observed_at":"2026-08-07T14:43:03.240393Z","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-07T14:43:05.143302Z","title":"Fast exact multiplication by the Hessian","venue":null,"work_id":"6fbd265a-b915-41aa-a534-6b60ff4db202","year":1994},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:03.330293Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:04075df9493e2a6fc316db2e8e0da3bc39b28d0da9adea91477e218af4807c65","observation_id":"f9ec2eb8-f533-4c09-a063-49246f4da911","resolution":{"observed_at":"2026-08-07T14:43:05.204941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.03310","last_updated":"2023-03-02T03:08:10Z","snapshot_observed_at":"2026-08-16T16:26:13.880878Z","submitted_at":"2022-10-07T03:52:27Z","title":"Scaling Forward Gradient With Local Losses","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.03310","snapshot_observed_at":"2026-08-07T14:43:03.420859Z","title":"Scaling forward gradient with local losses","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:03.420859Z"},"links":{"cited_paper":"/paper/2210.03310","citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:71fdfb3767458362355bf5d9c083fd916feb65405e7f439292a6843385cf73f8","observation_id":"383b0c88-32e2-4ef0-b21d-42ceb4ed4ceb","resolution":{"observed_at":"2026-08-07T14:43:03.420859Z","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-07T14:43:05.023751Z","title":"Langevin diffusions and metropolis-hastings algorithms","venue":null,"work_id":"f78b0a12-9a99-4148-8f59-9ee97312b8b0","year":2002},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:03.511402Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:c945f6c85e7891fc9e9f97ada0542a7ca7640ac9fa0e7ae621a62e7a3104ff78","observation_id":"0eabbe41-7e3a-41f0-be09-5486b17ba121","resolution":{"observed_at":"2026-08-07T14:43:05.077071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T14:43:04.887504Z","title":"Rosenbrock","venue":null,"work_id":"97e7774c-d50d-4380-9970-ada435c97b2f","year":1960},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:03.585339Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:03a21a3f9c6da3b66bf7b9f3acf1c60e7b0e3c6812e206f645abdafe776c522a","observation_id":"394dd6a3-4693-45fb-99dd-4eace8b8b0aa","resolution":{"observed_at":"2026-08-07T14:43:04.954019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T14:43:04.759840Z","title":"Brownian dynamics as smart Monte Carlo simulation","venue":null,"work_id":"5cbf6bcf-cca9-4793-9727-0aeba78ccd68","year":1978},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:03.659675Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:a2dd4bca57b2c50c5ec9f4be33f7420c79483b5ce58627bc520bc5e729ffc504","observation_id":"8be649af-c3f2-4dd0-b1df-092e5da68f1e","resolution":{"observed_at":"2026-08-07T14:43:04.826861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T14:43:03.743419Z","title":"Learning by directional gradient descent","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:03.743419Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:b73ea3d95813f3747c2861b9acdf2b9f52f7e64800d8f10561ff5b329e7a0856","observation_id":"884a4ff2-591d-4e62-be44-9b9a1a0ec444","resolution":{"observed_at":"2026-08-07T14:43:03.743419Z","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-07T14:43:04.607812Z","title":"A simple automatic derivative evaluation program","venue":null,"work_id":"65fa8128-6baf-4705-8cb0-2477299402b2","year":1964},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:03.827984Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:4c0fc032f5421deda17079d4ac91821ff774d8864546d476731e10154deeea67","observation_id":"094d18e9-2718-4793-ae39-29509c2b07fb","resolution":{"observed_at":"2026-08-07T14:43:04.679144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T14:43:04.475772Z","title":"Langevin diffusions and the Metropolis-adjusted Langevin algorithm","venue":null,"work_id":"9e62b53b-7048-4a8c-832b-e78d3b96b8f9","year":2014},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:03.928414Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:c06f1b751105c7a0df27aeaafb02d553417096e7cfdc8502234ee8a56cb761e7","observation_id":"fd48314c-6ffb-4dad-aecf-a59086c433c5","resolution":{"observed_at":"2026-08-07T14:43:04.534254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T14:43:04.339651Z","title":"/homes/usr/lib/scripts/Sampling/cifar10_cnn/cifar10_time.py","venue":null,"work_id":"b3a92b35-e1c2-44e2-9960-c24ab4902b42","year":null},"citing_paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:04.037366Z"},"links":{"citing_paper":"/paper/2505.18081"},"observation_digest":"sha256:265c8bdd248e87764bef5195345d5b5f50b91bd1a0c094aadb768515c8dbbc06","observation_id":"55d0c065-752c-4e67-b1bf-e6ed0ee1d6c9","resolution":{"observed_at":"2026-08-07T14:43:04.417188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.18081","last_updated":"2025-05-23T16:39:21Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T14:24:10.586618Z","submitted_at":"2025-05-23T16:39:21Z","title":"Backpropagation-Free Metropolis-Adjusted Langevin Algorithm"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":0,"verified_fuzzy":19},"total_outbound_references":31},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2505.18081."}