{"as_of":"2026-08-14T07:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:14f712dbb61b59569cfa05b1d4b31509a3e068daacd4307aeff1d6d11617d05f","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:42:12.093662Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T04:15:59.630119Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-11T04:16:02.869014Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"cited_work":{"arxiv_id":"2507.12935","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.12935","snapshot_observed_at":"2026-08-11T04:16:02.869014Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","venue":"cs.LG","work_id":"50edd0e8-6775-4404-aa44-b72193d1df02","year":2025},"citing_paper":{"arxiv_id":"2608.04443","last_updated":"2026-08-09T12:45:10Z","snapshot_observed_at":"2026-08-13T23:29:41.844683Z","submitted_at":"2026-08-05T04:41:06Z","title":"MCHA: A Memory-Centric Hierarchical Architecture for Parallel-Sequential Computing","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-11T04:15:59.630119Z"},"links":{"cited_paper":"/paper/2507.12935","citing_paper":"/paper/2608.04443"},"observation_digest":"sha256:873749b1376672406a12efe77b2a2173e0b30b4acfdbc4a216471b56900ce74d","observation_id":"290cda98-3282-44ce-8236-f3e77c5516df","resolution":{"observed_at":"2026-08-11T04:16:02.879983Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.12935/citation-record","integrity":"/paper/2507.12935/integrity","json":"/paper/2507.12935/citation-record.json","paper":"/paper/2507.12935"},"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-06T16:42:12.759856Z","title":"LIGO Algorithm Library - LALSuite,","venue":null,"work_id":"838b8cab-b0a8-401a-be1d-f9b4abd3694d","year":2018},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:11.861023Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:6e8ba33336ecacf47345dd7e5af71c8e7de323ab6e2f51d26457814d63c7376f","observation_id":"5315cc6c-d6b8-4bc9-859b-be7d4ddd4aff","resolution":{"observed_at":"2026-08-06T16:42:12.762326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.752270Z","title":"Near-optimal mimo detection using gradient-based mcmc in discrete spaces,","venue":null,"work_id":"dc0fc9dd-fe39-4ad4-b530-f2ebb7de4561","year":2024},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:11.931656Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:1ff60ef1c963d42e306b68aa1f90588840308c836614a85d440890f4eabe4ad4","observation_id":"5877f23a-e5ef-4c80-8930-9441033e55a3","resolution":{"observed_at":"2026-08-06T16:42:12.754930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.744200Z","title":"Revisiting sampling for combinatorial optimization,","venue":null,"work_id":"09c13bb5-e9d7-4fb8-84f7-05639c6fad30","year":2023},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:11.955998Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:7709da2b660d34d62cd0761903cc956c82494642d6ba9a38586b32a70e51ca5f","observation_id":"6b7b6475-13b7-4d89-b74e-2edf4b837c11","resolution":{"observed_at":"2026-08-06T16:42:12.746900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:11.969303Z","title":"Gurobi Optimizer Reference Manual,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:11.969303Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:fa69736057046942ce791246ceb8f12d17c2a35fa1e2db53445b76c224534d2b","observation_id":"377f0df7-5c67-4890-ad73-2e418f3a1476","resolution":{"observed_at":"2026-08-06T16:42:11.969303Z","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-06T16:42:12.726984Z","title":"Dimes: A differentiable meta solver for combinatorial optimization problems,","venue":null,"work_id":"f8e7f7e2-e25e-4696-9d49-a4af4c3a8a50","year":2022},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:11.975176Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:5e6f0aae8087c991a6aaea3ed507464bbd5cc93bc95e137d110fa1bdfabee618","observation_id":"d349adb9-6b5c-4a8a-8d80-949a9984b3ea","resolution":{"observed_at":"2026-08-06T16:42:12.729637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.718444Z","title":"Combinatorial optimization with graph convolutional networks and guided tree search,","venue":null,"work_id":"f05a269c-9479-49ea-887f-64951947bfc8","year":2018},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:11.977649Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:cc7c76100b5cf4d19067dbed2be3b31d0a40b91659e8dd2dcacc487734cd54b6","observation_id":"80925904-1674-4d7d-9d0d-6957b3db8980","resolution":{"observed_at":"2026-08-06T16:42:12.721019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.711008Z","title":"Difusco: Graph-based diffusion solvers for combinatorial optimization,","venue":null,"work_id":"acc44e1d-a3c3-4d9a-9637-572c9e98c878","year":2023},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:11.979978Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:119f317ec804a83b87e4ea04003e73902e7ca39ebb7edb7150022bd352286b0f","observation_id":"d29bf329-d897-4cd4-8f61-22dd941bd27c","resolution":{"observed_at":"2026-08-06T16:42:12.713588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2000.81465","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:42:12.387287Z","title":"Guest Editors Introduction to the top 10 algorithms ,","venue":null,"work_id":"fbab5e85-e1b6-4573-8d05-0f68669d7963","year":2000},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:11.982390Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:5dda24a90231e8f4806285e05eb6fff1da466be3902b66546956b33d70f2ce18","observation_id":"715bf63f-bc52-4c64-877c-b15d54be97d0","resolution":{"observed_at":"2026-08-06T16:42:12.392415Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.703514Z","title":null,"venue":null,"work_id":"505cebf0-2195-4196-b7e6-ea4a0085661d","year":2011},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:11.984590Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:81666c8541a09e114f77775c55d18321a3cd4936ed0a5d36bde57f6515a3a81e","observation_id":"a5193d3e-6036-4297-b97a-2cc6f12658dd","resolution":{"observed_at":"2026-08-06T16:42:12.705933Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.695981Z","title":"Probabilistic machine learning and artificial intelli- gence,","venue":null,"work_id":"5e8e5559-37ed-4603-9cb4-c7aca7a330a2","year":2015},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:11.987295Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:97441260ebfd48ee2ae2d2e9b2794b88b2a123b44019d9bcadfd16eb2c21256d","observation_id":"fd7ff94c-1c2a-4666-ba4d-24caee1f4fa1","resolution":{"observed_at":"2026-08-06T16:42:12.698564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.687006Z","title":"An introduction to mcmc for machine learning,","venue":null,"work_id":"e12e0f4b-bd85-47d8-bed4-4a8f7db23abf","year":2003},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:11.990032Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:276699b1237ee8da6403f967b9903062a0cf4c0acc4e6ff78e1dba0c7a69ef8c","observation_id":"a4befb5b-f272-4950-abee-30a54db06a14","resolution":{"observed_at":"2026-08-06T16:42:12.690637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:11.992638Z","title":"Koller and N","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:11.992638Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:fca5953ccfa7e2622c164214526894bfb297b765dd0d09b7ef21a018ee6e9003","observation_id":"4de33712-3ccf-43e9-a907-354ea2203d9c","resolution":{"observed_at":"2026-08-06T16:42:11.992638Z","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-06T16:42:12.674442Z","title":null,"venue":null,"work_id":"47e42648-497a-45fb-846d-6e41690a6319","year":2001},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:11.995392Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:a5913d6193426236ee0b6ee4f020c78725192857dba5b391412d79e3412af362","observation_id":"10cecdc0-232e-4dd5-a9a4-5bc700e290b7","resolution":{"observed_at":"2026-08-06T16:42:12.676939Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.666216Z","title":"DISCS: A Benchmark for Discrete Sampling,","venue":null,"work_id":"57d9994a-3c98-44f8-a0ca-8addb09739c5","year":2023},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:11.998183Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:7b61f83a43aefc1951a2971aa99d3044483038dfc738935be3a9808a9c1d6d59","observation_id":"5e6e7e53-d1b0-4346-a27c-520d3f56a47f","resolution":{"observed_at":"2026-08-06T16:42:12.669080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.658352Z","title":"A tutorial on energy-based learning,","venue":null,"work_id":"10fcdca5-cefd-42e3-9f8a-8c41725035ea","year":2006},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.000704Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:e5fa7e23415272637a49226047ae6ba03f076c4998a9507e1c5c8cc9e41ff891","observation_id":"71417e3f-43cf-4c62-99eb-91e824e9a6ed","resolution":{"observed_at":"2026-08-06T16:42:12.661093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.002797Z","title":"Fast, accurate training and sampling of restricted boltzmann machines,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.002797Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:ecf9fd08f9a3f9bc2f540922f546c0e639890c542357413213d59744de116e28","observation_id":"6fcb20b4-0881-427e-a710-39a20f2363b9","resolution":{"observed_at":"2026-08-06T16:42:12.002797Z","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-06T16:42:12.651339Z","title":"Parameter estimation with gravitational waves,","venue":null,"work_id":"4b7f706a-6a95-4993-a5af-91171f16d51e","year":2022},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.005320Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:6c6173e539a10984b48c10323a96ea87a01941c0bb632e51b030410d6a2bd786","observation_id":"c176bd12-891c-4321-b247-231fdfd67807","resolution":{"observed_at":"2026-08-06T16:42:12.653595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.643568Z","title":"A novel monte-carlo-sampling-based receiver for large-scale uplink multiuser mimo systems,","venue":null,"work_id":"d11383d5-0fa0-4a80-96bf-dc13f111444d","year":2013},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.007528Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:955052a0058f51975c891a9286f7c618a4f801f813382d15951b2934831112b2","observation_id":"d492483e-868d-4929-9adb-5cb9277f81e8","resolution":{"observed_at":"2026-08-06T16:42:12.646029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.635718Z","title":"Large-scale mimo detection using mcmc approach with blockwise sampling,","venue":null,"work_id":"ba63c54f-79b7-43dd-bbda-75f974bae4ce","year":2016},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.009967Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:3b75d612ffa23f28cc2e907b4f80be0aec8809aad00798ff03dbc22b0833ad96","observation_id":"54ca3514-5f5f-4514-a843-cf2e34473241","resolution":{"observed_at":"2026-08-06T16:42:12.638352Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.012114Z","title":"Imagenet classification with deep convolutional neural networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.012114Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:60daca967423dcc01efaa36539004516690b2ea17cd7eff288042d27556a0fda","observation_id":"75a4c3a6-2660-47c2-9ec3-ad2cb926cdee","resolution":{"observed_at":"2026-08-06T16:42:12.012114Z","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-06T16:42:12.014802Z","title":"Natural language processing,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.014802Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:2150404bfa7b3e707fe80574c5377faa34cec75f92ac4b4a518f558fb71b665c","observation_id":"2e5c8d52-9170-472b-9f0d-c6c96c4c2baf","resolution":{"observed_at":"2026-08-06T16:42:12.014802Z","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-06T16:42:12.017037Z","title":"Monte carlo sampling methods using markov chains and their applications,","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.017037Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:4bb45eeeef83e20421044fa174f970a1677d408e687dde33a89945911304e513","observation_id":"69229bee-2d13-4730-9382-e7bf4ce66b3e","resolution":{"observed_at":"2026-08-06T16:42:12.017037Z","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-06T16:42:12.613491Z","title":"Illustration of bayesian inference in normal data models using gibbs sampling,","venue":null,"work_id":"3ba38fd1-a35b-4ba3-81bc-52994676a3e6","year":1990},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.019252Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:e69dc4dd54b3e89fddee95ece58462a6a9dbfb409d26969b53b6847dd29a603e","observation_id":"0603e7f2-4f0a-442a-bce6-f97a6b2df144","resolution":{"observed_at":"2026-08-06T16:42:12.616464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.606168Z","title":"Blocking gibbs sampling in very large probabilistic expert systems,","venue":null,"work_id":"7a057144-6489-4820-b647-d9f590a26a54","year":1995},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.021817Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:798a41d2e93c46557bc39c795052536ada3fe2f38202edf4b4b877f3691e7543","observation_id":"e07d74e8-61b9-46b3-867c-db4873b678e2","resolution":{"observed_at":"2026-08-06T16:42:12.608742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.598429Z","title":"Asynchronous gibbs sampling,","venue":null,"work_id":"ef8d60e6-68ed-48dc-a4bc-b42d1485f478","year":2020},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.024060Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:b608c3a6afaed562ef509d4491e5a211cd4c462492d398081e082d07890830d0","observation_id":"8e4e7f4c-99ba-4f66-95ba-51d024ea20d5","resolution":{"observed_at":"2026-08-06T16:42:12.600709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.589878Z","title":"Path auxiliary proposal for mcmc in discrete space,","venue":null,"work_id":"da69cf5f-f7cf-4d0f-889c-96a226dfbb7b","year":2021},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.026314Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:153d31382ab02a8abce1192f5cead8258a5fca6756852d1f5a6f47c4ba34cb84","observation_id":"6b1b9e4c-8ada-4c2c-a122-9d77229c3625","resolution":{"observed_at":"2026-08-06T16:42:12.592658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.581160Z","title":"A langevin-like sampler for discrete dis- tributions,","venue":null,"work_id":"57aab071-70ce-41d0-a543-88b53269a01f","year":2022},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.029359Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:24a166fcb90f4fbc4cc289059d98b1ae2bf6234de659fd3ca6af8b03177c1748","observation_id":"ce03d28b-5e15-4779-abb5-0e0617b9f056","resolution":{"observed_at":"2026-08-06T16:42:12.584295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.572765Z","title":"A 3mm 2 programmable bayesian inference accelerator for unsupervised machine perception using parallel gibbs sampling in 16nm,","venue":null,"work_id":"2625e8ff-0b4f-4379-b6af-18c03c666fe2","year":2020},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.031905Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:1c785a7582e45604ae81ce73462c9d9c7f57dc6d2b8dcdd1a1748b8df453d48b","observation_id":"301fad30-3b64-4bc2-a945-0ee036fe0f51","resolution":{"observed_at":"2026-08-06T16:42:12.575716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.564576Z","title":"Coopmc: Algorithm-architecture co-optimization for markov chain monte carlo accelerators,","venue":null,"work_id":"747303ea-84c8-4426-9124-c95056ad0314","year":2022},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.034791Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:1ef0b99a8e6c4c05d71b18ec9120b1c4dde407008b82a011be32a4570ade3648","observation_id":"ceff54b9-44ee-4892-a959-4118e7926179","resolution":{"observed_at":"2026-08-06T16:42:12.567479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.555188Z","title":"Proca: Programmable probabilistic processing unit archi- tecture with accept/reject prediction & multicore pipelining for causal inference,","venue":null,"work_id":"74ce1fd2-688f-4067-87ef-221a1153f31d","year":2025},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.037356Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:0a5cc4380d7a5c0a9e132e1edd39aa8d565d09deb7d39fe7ec738d12f863e6a6","observation_id":"4f050e86-6610-4117-90d3-b6c4c49973d9","resolution":{"observed_at":"2026-08-06T16:42:12.558595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.040299Z","title":"Statistical robustness of markov chain monte carlo accelerators,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.040299Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:2366df9636bc32fdb1a041bc433a3a7036f1eeef784906615acb0c22fe7fdd7b","observation_id":"d8dcf8b8-5367-4b37-8e1b-72da57024d7e","resolution":{"observed_at":"2026-08-06T16:42:12.040299Z","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-06T16:42:12.545696Z","title":"Massively parallel probabilistic computing with sparse ising machines,","venue":null,"work_id":"2992a88c-128f-4ad4-803c-883c9d0fa53f","year":2022},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.043931Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:4768dbb8736ad9c1e321390ae747a3e85099a7b65fce072df42437dc395aa16d","observation_id":"1dbf912d-34d4-4a08-83ce-f4939a6f04fb","resolution":{"observed_at":"2026-08-06T16:42:12.548575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.536864Z","title":"Towards 3d cmos+x ising machines: Addressing the connectivity prob- lem with back-end-of-line fefets,","venue":null,"work_id":"5505acdc-cd7f-489d-a223-9a4c5e63e6b8","year":2024},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.046661Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:d3bff8bd3b7839086abb5f96a9481a240de6cc25eb58e7aef100f63670f62c31","observation_id":"300d2c1c-c64f-4668-a332-40af6cd85676","resolution":{"observed_at":"2026-08-06T16:42:12.539981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.528045Z","title":"Ising machines as hard- ware solvers of combinatorial optimization problems,","venue":null,"work_id":"dfbddc7c-eece-4096-9a01-f72868f7367d","year":2022},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.049687Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:da1f0440d7440b5ae97e992d03246e85bb40b9f107e0457f19f3c24d208b6196","observation_id":"3a105427-2f7f-4753-82c4-b7f571cc1f6e","resolution":{"observed_at":"2026-08-06T16:42:12.531245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.518639Z","title":"A full-stack view of probabilistic computing with p-bits: Devices, architectures, and algorithms,","venue":null,"work_id":"e7f44360-2d43-43dd-909c-b8af144f6104","year":2023},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.053148Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:b290f81839d71bc040bf2ce149c8ee97034ae4db2b536af6d26f535c4eca022e","observation_id":"e23aae1f-326f-4ec9-8fd2-12f0998bad80","resolution":{"observed_at":"2026-08-06T16:42:12.521554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.055777Z","title":"Acmc 2: Accelerating markov chain monte carlo algorithms for probabilistic models,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.055777Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:7abd931d48de03b306dde1ad62a059b30663cf35ac7ab5d5a9d169e2da61607a","observation_id":"1d151277-9618-44cc-91db-1727420e233a","resolution":{"observed_at":"2026-08-06T16:42:12.055777Z","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-06T16:42:12.509750Z","title":"12.2 p-circuits: Neither digital nor analog,","venue":null,"work_id":"b10d7edf-d7c2-42e2-a6dc-26c9d8c002bf","year":2025},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.058161Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:b588aed395372cc91cb69341eefecab9111344ecf8368c082d90e9affee099f9","observation_id":"11545ee4-1bed-42f2-92d7-60fc3eb64637","resolution":{"observed_at":"2026-08-06T16:42:12.512831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.060326Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.060326Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:74faa69b2177299f01f8f9f9cf1dff6eb5a8c5c97d4b3f9091119b57c4e829c8","observation_id":"54384f85-dc61-4fed-b694-3c5dbaaadc7a","resolution":{"observed_at":"2026-08-06T16:42:12.060326Z","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-06T16:42:12.495085Z","title":"PASS: An Asynchronous Probabilistic Processor for Next Generation Intelligence,","venue":null,"work_id":"29c60084-252d-466c-a393-781eb3178537","year":2024},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.062620Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:a5ef4531a8668d8aa3940fdb43eef7efd4ee5454b5283f337935d0dc9bdbbacb","observation_id":"7a60a25b-dc5b-495f-abc7-3761d585b2b7","resolution":{"observed_at":"2026-08-06T16:42:12.498176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.487357Z","title":"Discrete langevin samplers via wasserstein gradient flow,","venue":null,"work_id":"b580c96c-6874-4b93-a979-9f9df7bf0615","year":2023},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.065475Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:dc47a03894253b7155dfdaaa3aa588b1fe751e887ef994fed30099a79ee0c06b","observation_id":"4611aed2-6dc9-48ac-b5aa-ea6ec32946ab","resolution":{"observed_at":"2026-08-06T16:42:12.489715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.478299Z","title":"No free lunch theorems for optimization,","venue":null,"work_id":"122a8d38-b594-419b-a571-354f2ef2a785","year":1997},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.068269Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:95ce3c8c916675277895af127ea2c559673fdffab7fa288c22cfccd63e460b95","observation_id":"1a3d5a88-c80a-40aa-9f78-e21d31e97aff","resolution":{"observed_at":"2026-08-06T16:42:12.480686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.469836Z","title":"CausaLearn: Automated Framework for Scalable Streaming-based Causal Bayesian Learning using FPGAs,","venue":null,"work_id":"2a64c466-a5e3-437d-913c-c6167674b4af","year":2018},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.070470Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:c35a89bb5a10a92780a6ecea54f86925a83c4d152a030f9ff098f04869a08377","observation_id":"38b9dfc5-cb56-41b0-84ba-6096551fbbaa","resolution":{"observed_at":"2026-08-06T16:42:12.473060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.460898Z","title":"PMBA: A Parallel MCMC Bayesian Computing Accelerator,","venue":null,"work_id":"f0a23726-b085-4a80-8471-153f697b6607","year":2021},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.072940Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:8e15744fe2baf2bc1e78a2494da6209bd000e9b84d169c3f0e99c4b6f3eb783f","observation_id":"39419294-d442-4fb6-b000-06310e940cbc","resolution":{"observed_at":"2026-08-06T16:42:12.463775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.04260","last_updated":"2024-11-06T21:07:52Z","snapshot_observed_at":"2026-08-12T22:06:09.739953Z","submitted_at":"2024-11-06T21:07:52Z","title":"Running Markov Chain Monte Carlo on Modern Hardware and Software","version":1},"cited_work":{"arxiv_id":"2411.04260","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.04260","snapshot_observed_at":"2026-08-06T16:42:12.115863Z","title":"Running Markov Chain Monte Carlo on Modern Hardware and Software","venue":"stat.CO","work_id":"a3665a14-f40f-4ad9-87a0-37206262bfae","year":2024},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.075380Z"},"links":{"cited_paper":"/paper/2411.04260","citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:57326dcf6c55566c0b59caf970f779a61e85fc06ee03fb0d7659dc40baa9d988","observation_id":"99a2a821-40b2-403e-8be4-a89b697c3d8b","resolution":{"observed_at":"2026-08-06T16:42:12.120689Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.451521Z","title":"Simple, distributed, and accelerated probabilistic program- ming,","venue":null,"work_id":"a8a1f048-56f0-4799-a890-17301a0db3db","year":2018},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.078030Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:45593e5134a06ce70785251b6835be9152c498ba4b11fed58a6f7e06a14650c9","observation_id":"476456b4-db13-4461-a0fd-78b55d423102","resolution":{"observed_at":"2026-08-06T16:42:12.454657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.442533Z","title":"Pyro: Deep universal probabilistic programming,","venue":null,"work_id":"5c0f1333-8700-4c50-9a2e-6c240fd070e1","year":2019},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.080590Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:12b6991697702d28dca9eecc03569938399f307264b2dce50f5c795c25f5b506","observation_id":"55450845-f8ba-44b2-aaff-85613eca232e","resolution":{"observed_at":"2026-08-06T16:42:12.445369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.433823Z","title":"AIA: A 16nm Multicore SoC for Approximate Inference Acceleration Exploiting Non-normalized Knuth-Yao Sampling and Inter-Core Register Sharing,","venue":null,"work_id":"8c4b0f08-f82c-4152-aa51-7298da50fd8a","year":2024},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.082913Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:9f87906daacaba73ecfebd0781896e9e76849487537fc20e30bcd10b415dd43a","observation_id":"4814fb98-501e-46f8-87c2-b17ef698aada","resolution":{"observed_at":"2026-08-06T16:42:12.436960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.425413Z","title":"High performance monte carlo simulation of ising model on tpu clusters,","venue":null,"work_id":"45b7ce61-6db7-40dd-92a9-2658fbda51f5","year":2019},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.085334Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:55d2781aae856fefc45bad66a0afe4814403389e601b51559a065a66d3238403","observation_id":"0419bd0d-7dbf-4b15-91ee-cbd51df71782","resolution":{"observed_at":"2026-08-06T16:42:12.428032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.417067Z","title":"Bayes net repository,","venue":null,"work_id":"bda92b75-e5b8-4a49-8714-195a2781f2b2","year":2025},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.088347Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:50909fd140ef3ea8aee54bcab36d9c621f65c580e81ba86aa3fa70265f15d2ab","observation_id":"3629539d-aa6d-4b1e-9007-7d5aa0e1ffef","resolution":{"observed_at":"2026-08-06T16:42:12.419746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.407243Z","title":"agrum/pyagrum: a tool- box to build models and algorithms for probabilistic graphical models in python,","venue":null,"work_id":"89558957-34ba-4f0b-b44a-66323c709383","year":2020},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.091148Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:05d5c2e7f8a8febbce8ed4c5eb672402c76dabacb9198e1e18ce363e558ff135","observation_id":"3ab749db-a085-4fb1-8072-f2875e8a6abf","resolution":{"observed_at":"2026-08-06T16:42:12.410387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:12.398590Z","title":"Bayeslib,","venue":null,"work_id":"4b90567a-56e2-43dd-8b6b-b8482f1d61b1","year":2025},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:12.093662Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:a1c0c72a2acd720e0bf4115e21c9a234e9da5f7a8977b6f20632c98ec7607c9f","observation_id":"1e5f5816-fd60-45e8-89ff-ad0479b3db41","resolution":{"observed_at":"2026-08-06T16:42:12.401314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:42:11.972046Z","title":"Available: https://www.gurobi.com","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T16:42:11.972046Z"},"links":{"citing_paper":"/paper/2507.12935"},"observation_digest":"sha256:ae78b597756dfcf3abeaaa627648bfc2a825bd7f7d6031d00a7a21dd4dca4c8a","observation_id":"5fa72222-cf81-448e-8db9-8b43f4724083","resolution":{"observed_at":"2026-08-06T16:42:11.972046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.12935","last_updated":"2025-07-17T09:20:51Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T04:18:25.618900Z","submitted_at":"2025-07-17T09:20:51Z","title":"MC$^2$A: Enabling Algorithm-Hardware Co-Design for Efficient Markov Chain Monte Carlo Acceleration"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":12,"verified_exact":1,"verified_fuzzy":38},"total_outbound_references":52},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 1 inbound Pith citation observation for arXiv:2507.12935."}