{"as_of":"2026-08-08T02:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:03c3ed05ea8e660041e586dd1390c79e997622c67ee69375a15f549a45bb07dd","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-07T06:34:17.273281+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-07T14:33:26.897044Z","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:c8663156829c2834ba0e21475389e9fa2d6c82f9a7af4afda719ab82d9d37219","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:06:18.533236Z","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-07T14:33:26.897044Z","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:33717b366c6cbeaf4c98a085b1b5ae5465b068036cf07f82a3e315c39ef6fdc2","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-03T12:13:49.320697Z","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-07T14:33:26.897044Z","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:9da59b2e5e4890fc4fbe8f2b2545314ddbffb56e25a116f2bd93f751a741ebb3","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-07T14:33:26.897044Z","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:482999511acd3724b4fb0eb339bb6ededd53b2791d4f17749ac75ba57f4a79e8","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:33:26.897044Z","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:ef771fa9894265be5539440b1abd9e2c0c4fdf7119c8fcb92c166bd8c482c981","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T03:54:59.078371Z","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-07T14:33:26.897044Z","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:20be030619cc06c792ea255382a6022c2f6eed7fd3e12af8c740f35d765cb25e","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-07T14:33:26.897044Z","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:927bc5ddbd910155d062a55f4ffa551679b114a899367a5493db8d4800e0971b","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:33:26.897044Z","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:8a8e72f46c2b003b553781a41a14f551d1c25e14ccd4ed464e010790c4e9282b","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-07T14:33:26.897044Z","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:a2a8ca5429f9552f46fa3ad4a9976cb18b019d892527bb1771dd9ec838064be5","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:33:26.897044Z","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:5040c7d980c6d4dc0719fa41405549a0deb25d77a4579fec995d364df4ae4e65","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-05T13:30:24.539784Z","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-07T14:33:26.897044Z","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:0d0fff6c97f47c583f0462e35ec80358fa8a2a273c76fefc8f4b85dfceb27916","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-07T14:33:26.897044Z","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:fdedb1c43f85ab3930cd6b21b3f57777b4c1e4d36d09786e613fbf611513d6e1","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:33:26.897044Z","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:8890208925cd12633c82461d435ac55ae8116c33669c6a9139f64f429b6cb84e","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:33:26.897044Z","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:8c37e23b538ef747840143daa72a5edbe40a8dc55ff4cad77d43cdd8a32d3ae8","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:33:26.897044Z","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:031986d017c97486579c3fe402c3abd06637a8faa94828304f84128affdcc5cf","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:33:26.897044Z","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:1124cc2cec988de47cf78a7e20d35c26b6968e5de46b3954bfbe66ae601f18bf","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-07T14:33:26.897044Z","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:493a29e1e1919c9ce325fbc9d7d6b602272ef65f0ab5fed7c4bcb8bc4a891d16","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-07T14:33:26.897044Z","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:01e64c7a44f2832908d81499118f6d7b9959fc5d186c61edebd6ec0eb8953e9c","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-07T14:33:26.897044Z","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:dadabde48c3cd8ec9f5c08eb927d4c02882b00e95346f7bc06b1d3240f7aa9bf","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:33:26.897044Z","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:05de61d591df4354b6a49951cc49acfed9d94004a79dd3c47b2a1e90dc484851","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:33:26.897044Z","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:442b3be5ae41dcfa6e3940cdccff1ca24567679ad61e1e60578bec0014f62338","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:33:26.897044Z","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:bde6c1d6a1b286fdf31b4a6c2ddc911ac1ff59c5f3541c42fe28d4ae24e2f2e7","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-07T14:33:26.897044Z","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:a13a0429140ab8c71b070711d67838efffd2e2e431fa8758fbf0e36316e25c1a","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T21:19:53.943778Z","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-07T14:33:26.897044Z","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:10ae2091e74f206f40f268b96e019d072eafcdcaf8aee589bea9a0a0b4912b43","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-07T14:33:26.897044Z","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:481a4f3743444e2176a43754306030f422c66e0fbe958e437d71d68427c62048","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:33:26.897044Z","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:c83ddd0352ccc7c48f02f3eeae99d64005f9abefa2e8f75ffa561637a2587534","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:33:26.897044Z","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:9bf274334001376ac902caa70e97ccffb952b8c3fe461cb39bedbe7393a73c4c","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:33:26.897044Z","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:309f856ec58555eb06d391fb6793477fe9e9eff86a440afaba0bc59fc9f78ea2","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-07T14:33:26.897044Z","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:0814c9b61d7319f344d8af3863c014def9839611cdf57ee47d64e0f20fafc764","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:33:26.897044Z","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:a75200151a4d279b74c7e0482009c36555fd71d6d76ce5c6aab698677750b10b","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:33:26.897044Z","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:7af2eb2dc331a7d1dcb68bab7386898d79945ff2939055632499c925f0a59927","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:33:26.897044Z","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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2505.18081."}