{"as_of":"2026-08-06T20:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0299ff2078ec1ec56e54fb6a77466760c7e67bc12c1b9bf42b0578e96843b053","coverage":[{"denominator":80,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":80,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-25T20:44:30.520336Z","state":"measured"},{"denominator":80,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":80,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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/2606.25313/citation-record","integrity":"/paper/2606.25313/integrity","json":"/paper/2606.25313/citation-record.json","paper":"/paper/2606.25313"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T20:44:30.520336Z","title":"Efficient processing of deep neural networks: A tutorial and survey.Proceedings of the IEEE, 105(12):2295–2329, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:69a8983ad35cf385731ba4e9654107f21cbdc54f1da7785ce81aad496ceb83ee","observation_id":"b390fa8b-dab0-44be-b909-4c6fd8e22ea2","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Google workloads for consumer devices: Mitigating data movement bottlenecks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:ad221910500edc373d9a4eaadca99dd2c56b1cf1f006a3433af1465411e1b8a6","observation_id":"dff6457f-dee9-48e8-bdfc-3488d0e8b97a","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"King, Jack Raymond, Trevor Lanting, Richard Harris, Alex Zucca, Fabio Altomare, Andrew J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:83d785b65256b0244c0e1bb98208e94d7549c5e967712991c8d2adad6ed99067","observation_id":"ffdb2438-fd1f-42cc-bab3-bf942e8670cd","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Beyond-classical computation in quantum simulation.Science, 388 (6743):199–204, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:1fd9d84d5f15635adf54af627649d6f633cb40321e3b2c462b6e638df4b53ea3","observation_id":"69e4e458-8ef3-4bcf-b9a8-e8a492f3f994","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.10406","last_updated":"2026-03-13T03:26:12Z","snapshot_observed_at":"2026-07-06T19:51:05.604758Z","submitted_at":"2024-11-15T18:22:46Z","title":"How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits","version":3},"cited_work":{"arxiv_id":"2411.10406","doi":"10.48550/arxiv.2411.10406","metadata_source":"pith","pith_arxiv_id":"2411.10406","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits","venue":"quant-ph","work_id":"f5f10ae3-7e56-41d4-8840-12a41698041f","year":2024},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"cited_paper":"/paper/2411.10406","citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:7fb2eb20244c6e04406bf6fde25c83a6221c63aa925a9145922bd4326a8c0209","observation_id":"b4ff23a8-90bd-40b1-8feb-ff70df3f6f97","resolution":{"observed_at":"2026-07-04T20:10:07.204964Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-25T20:44:30.520336Z","title":"100,000-spin coherent Ising machine.Science advances, 7(40): eabh0952, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:18a07a14a7ba8ca1d6d0aa8a77d78c20e24b12bedafc3a1e68a001313e384092","observation_id":"7662dc96-c8da-4b82-b702-087a791dbf37","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"4.6 A 144Kb annealing system composed of 9×16Kb annealing processor chips with scalable chip-to-chip connections for large-scale combinatorial optimization problems","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:7d97139805b75164af23d9afbaf3c2d265ffc6a20c87f9e250f636d90bda1d8a","observation_id":"7313956e-d056-4857-80c4-33abed713970","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"1.1 computing’s energy problem (and what we can do about it)","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:d3d030a8cc87f5c6f17609f6e5d928e20b746561d3b7a4e76db1c7bcf88eb76e","observation_id":"02965e25-e818-47a5-b3bd-ccde2a641e36","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Illusion of large on-chip memory by networked computing chips for neural network inference","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:8635c6b3a67ff7fd8ad7cf44bece1fd71786b6ec689c630fd757cc71e6fd95c5","observation_id":"08ed80f1-dff4-4cc7-b0e3-c35361745ef5","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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":"2508.20425","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T20:10:07.197607Z","title":"The Future of Memory: Limits and Opportunities.arXiv preprint arXiv:2508.20425, 2025","venue":null,"work_id":"55486c6e-e1a1-4336-ac3f-f661b11dcd3c","year":2025},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:657c2f518a023a2a873572c9d682cdfa2e669dbe7c122d0a4dc263afee933480","observation_id":"a7ef91f3-cf90-4c28-a236-ec996267c459","resolution":{"observed_at":"2026-07-04T20:10:07.199159Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-25T20:44:30.520336Z","title":"AI and memory wall","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:5e5b59477a88998f1950c41f6010a6362490fa16ac523d85823bd97c9140d761","observation_id":"cb986233-efba-458d-8276-10b673846f5b","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Optimization by simulated annealing.Science, 220(4598):671–680, 1983","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:9e25546ca23ca320c050bbb0b30b15ddb7ca0545a102a84fe7f5831ce6c2fd56","observation_id":"359f9a19-8407-4714-90fb-d36435238f50","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Ising formulations of many NP problems.Frontiers in Physics, 2:5, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:93404a89d3c9cc123f1977d5d78cc5c6f03078e99a2decfeeb6633762fdd3cbe","observation_id":"84b9d676-8339-4ff3-a0af-0f6df047e1dd","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Ising machines as hardware solvers of combinatorial optimization problems.Nature Reviews Physics, 4(6):363–379, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:e2ba4716afc758454f0f9ea26d3a3e9c6b3aaa13745bff1f91ef606fc7575866","observation_id":"e5eb75c8-f5e9-4666-9b20-29d04a4b59d0","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Roadmap for unconventional computing with nanotechnology","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:31330abf173af71e7a77771adb286191b33ffe724b2fafc82146b01243698987","observation_id":"49dda86e-f3cd-4f36-aa9b-228d4a3b161e","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"CMOS plus stochastic nanomagnets enabling heterogeneous computers for probabilistic inference and learning.Nature Communications, 15(1):2685, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:cc2727bbe7aa292a36a9a189aab2579e5cbd4c0c9b767bdac8a104adce6903ac","observation_id":"32337ad3-f137-44c8-81b3-35b10778b794","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Theory of spin glasses.Journal of Physics F: Metal Physics, 5(5):965, 1975","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:82cfcf2c7cca73e9b65fe2fff818b97703fca434f80643baf0c6e034638f0779","observation_id":"66e81d88-1bfc-4b46-bb59-5353f1bca6c3","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"On the computational complexity of Ising spin glass models.Journal of Physics A: Mathematical and General, 15(10):3241, 1982","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:3cdfc852384fb4d6deeec051cffc77b9360d149a7e7b674127a1c59f3b601291","observation_id":"c64ec32e-5510-488d-9fbc-982f6f0d0436","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Infinite number of order parameters for spin-glasses.Physical Review Letters, 43(23):1754, 1979","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:5b6d09575e845f087414f16aa336afc20382efef85046389b9a3a336f6a3fc11","observation_id":"21f453a0-10b4-42d7-bd4b-324c23d492d2","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"World Scientific Publishing Company, 1987","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:0c726ee6ea91beb40d84dca17c754dfe98b4473a4674ad62f0b28f66ba3ee5b2","observation_id":"88a42936-2915-46ee-9679-f6769f07b194","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Ordered phase of short-range Ising spin-glasses.Physical review letters, 56(15):1601, 1986","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:38204d2500e6ae11d170fde0ce88439fa8f25ed961966c2fe9b2260148d32f53","observation_id":"421debf9-6eeb-43f1-bb1e-c65c6bf459be","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Solvable model of a spin-glass.Physical review letters, 35(26):1792, 1975","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:cec2a27485094912581fee5f7841eec03160dfc6d2ce6b41ee30b0c2a102ee58","observation_id":"611562f4-9088-470f-b3a8-6a133daa7f0e","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Pushing the boundary of quantum advantage in hard combinatorial optimization with probabilistic computers.Nature Communications, 16(1):9193, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:7a28c1d694ee349b26e9df5151eedfa37d748d813f0f94432b30e4352cfd30a6","observation_id":"c5d5851a-d696-4092-988c-773a452660a1","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Janus: An FPGA-based system for high- performance scientific computing.Computing in Science & Engineering, 11(1):48–58, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:a7b4ea162f8d65ecf9f6d8ee7310d0bb3b1d86725dae79895d00cee1d7830392","observation_id":"b20c9a8c-6adc-4fd4-8387-10a77e5bbaa3","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Janus II: A new generation application- driven computer for spin-system simulations.Computer Physics Communications, 185(2):550–559, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:cb78cf3ecbca4fbc651bec05920ad213f84bf14552ae95b1c55de41eaad3de2a","observation_id":"3e481a6c-12e5-45df-9789-53c639c81c9a","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Highly optimized simulations on single- and multi-GPU systems of the 3D Ising spin glass model.Computer Physics Communications, 196:290–303, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:5e47bb2073ba3afc8c18902e30cae78ca0518f474ea34e4fde243238a91ec71d","observation_id":"aa2dee4f-0992-4ade-9f72-d96d2fa25554","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"The QISG suite: High- performance codes for studying quantum Ising spin glasses.Computer Physics Communications, 298:109101, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:000157e67fd271292dd7d0bbea1ca7bf7a7c232702a2108ad1b8eaa889ec1ca8","observation_id":"57346d2d-6335-4072-8232-1a7008108dd7","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems.Science advances, 5(4):eaav2372, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:4d7308419e5ce1a7e35043eec563fd76c0e86b944e54316cbe901d438a87bebe","observation_id":"cf3f326a-0e08-4fad-ba89-9d51f4bd1183","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"High-performance combinatorial optimization based on classical mechanics.Science Advances, 7(6): eabe7953, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:3f52d0c8192844f0dd53a115ab6bd0d675a19b41c14ae56e61304972acbccc93","observation_id":"22ab202b-33f9-4ce0-a76f-316fe08252c4","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Scaling out Ising machines using a multi-chip architecture for simulated bifurcation.Nature Electronics, 4(3):208–217, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:052be03a0ef782bf7adef8370f8db53791e047c49176bfffdac86997eefc185f","observation_id":"5f1b1eba-7fa6-4cfe-a163-edae6d71d352","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Efficient and scalable architecture for multiple- chip implementation of simulated bifurcation machines.IEEE Access, 12:36606–36621, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:8c0727aafc6dff19e5b57e677cea91ba4fe7431ab8a54cf59098b5aceb10faec","observation_id":"81a52d07-1ce0-4ec7-8e7e-17a9a4c2ddf2","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Increasing ising machine capacity with multi-chip architectures","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:9723057a869099da364d281967215faa20b17b968a0184a0caf83d3efd603bde","observation_id":"e3aa4271-adca-4e7a-9d1c-5ea5ff1b2917","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.11422","last_updated":"2024-09-11T14:58:39Z","snapshot_observed_at":"2026-07-06T19:17:02.745056Z","submitted_at":"2024-09-11T14:58:39Z","title":"Next-generation Probabilistic Computing Hardware with 3D MOSAICs, Illusion Scale-up, and Co-design","version":1},"cited_work":{"arxiv_id":"2409.11422","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.11422","snapshot_observed_at":"2026-07-04T20:10:07.193708Z","title":"Next-generation probabilistic computing hardware with 3D MOSAICs, Illusion scale-up, and co-design.arXiv preprint arXiv:2409.11422, 2024","venue":null,"work_id":"64b72504-4edc-4cd3-988e-759b3f8fd3e7","year":2024},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"cited_paper":"/paper/2409.11422","citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:b34eeb2964f97215dfe9b5d273270096f8fb7c024b7a38fa97b0faeaaa96427c","observation_id":"391758fb-f9e4-4efa-936e-e9654492d58b","resolution":{"observed_at":"2026-07-04T20:10:07.196319Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-25T20:44:30.520336Z","title":"P-bits for probabilistic spin logic.Applied Physics Reviews, 6(1): 011305, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:634d40464b955ac8f5bf31dadf982e1baa8e380973d12e4c82b10f0e896be237","observation_id":"2d49ff18-94de-4f3d-b4bd-4fe00a85f1c1","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Stochastic p-bits for invertible logic.Physical Review X, 7(3):031014, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:0607a92e6c4a615184926107659e2e1aa5164b4664959b4dec8cf1af227ff27f","observation_id":"6844be99-8d7d-4860-b4ea-ba6d6a6f2bec","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Probabilistic computing with p-bits.Applied Physics Letters, 119(15):150503, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:559ac9842bbf1f6519ea6ded3e1ae0f0c746f679ca6d1a46d1249b90d952278e","observation_id":"976ae2dc-e5a6-490f-be4d-535abe6b51b8","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Modular approach to spintronics.Scientific reports, 5:10571, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:3773aa9cc766534705c0c04858c456e12d10b4d78ca959f95900a0f1517828d5","observation_id":"a5798c2d-6be0-480f-9ef7-145fb685a65e","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Implementing p-bits with embedded MTJ.IEEE Electron Device Letters, 38(12):1767–1770, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:27dff439d1c67650e865d7ab703bee5259a60c1e9c63f133117e91cafe4eca9c","observation_id":"516b9742-bf5a-4bc7-a1ae-a59380315dee","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Integer factorization using stochastic magnetic tunnel junctions.Nature, 573(7774):390–393, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:198174e26619e8037f656e89283818b5e4cb88f27870481cc1c45bd41c705702","observation_id":"088d51ac-fbca-4b5b-9072-998f661c6b01","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Subnanosecond fluctuations in low-barrier nanomagnets.Physical Review Applied, 12(5):054056, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:ffb19d0389e4f0151817ed810bba97f87b037d207338ec49117363c47e2f54b7","observation_id":"3de2acea-d0ab-4104-99fc-e8d8251d7402","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Massively parallel probabilistic computing with sparse Ising machines.Nature Electronics, 5(7):460–468, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:8841f4c885f9a7fbc7f6a57cc0a09987a5beb85a6d6819ceb2f017eeac8cd852","observation_id":"80082d3c-56cb-4c11-a7ef-575f4557aae8","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"All-to-all reconfigurability with sparse and higher-order Ising machines.Nature Communications, 15(1):8977, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:9e12f98fee97c27196cf17c7304b651eacd52dfdc249ac1358a407ceb92a34b2","observation_id":"2f7ca9c8-54aa-4851-94c9-828ae1ebe3a1","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Statistics of the Three-Dimensional Ferromagnet (III).Journal of the Physical Society of Japan, 6(1): 31–35, 1951","venue":null,"work_id":null,"year":1951},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:fb7599be539620bddf735d3d0b94f8548847aa49ea9130e61465f084fa805010","observation_id":"2559efce-4614-450e-bee1-275d8f3e5fbe","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Statistical theory of superlattices.Proceedings of the Royal Society of London","venue":null,"work_id":null,"year":1935},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:d891fe7ba94ede59da091810df9d2be873bc648a3d496b74ee9a7098cd725930","observation_id":"1f4d8ca2-186c-4ac3-b2d5-36f2896654ca","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Cluster variation method in statistical physics and probabilistic graphical models.Journal of Physics A: Mathematical and General, 38(33):R309–R339, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:2314824277d4c36bc0e39bf664e19f0f49440caedd5512422fd3af3c7abe0fdd","observation_id":"3b2c887e-e6d6-4548-afa4-7db3595b3068","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Correlated cluster mean-field theory for spin systems.Physical Review B, 79(14):144427, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:9c43370280d1b0ee8e19171b4738665ab5ba786c044e8c9985c1358dbe21f01b","observation_id":"cda229ce-c311-48ff-a325-f18f84a5617e","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1212.2512","last_updated":"2012-10-19T15:08:33Z","snapshot_observed_at":"2026-07-06T03:01:45.479586Z","submitted_at":"2012-10-19T15:08:33Z","title":"A Generalized Mean Field Algorithm for Variational Inference in Exponential Families","version":1},"cited_work":{"arxiv_id":"1212.2512","doi":null,"metadata_source":"pith","pith_arxiv_id":"1212.2512","snapshot_observed_at":"2026-07-04T20:10:07.200481Z","title":"A Generalized Mean Field Algorithm for Variational Inference in Exponential Families","venue":"cs.LG","work_id":"f2565181-9377-4768-85ef-6e4bb126c7b0","year":2012},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"cited_paper":"/paper/1212.2512","citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:8e326a403a2bf69a4ea0e043dd377a727f7d4f24b0541f6692e95935d87f3472","observation_id":"e1089ae3-c04b-4b86-b25f-d3a5dfb2e222","resolution":{"observed_at":"2026-07-04T20:10:07.202040Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-25T20:44:30.520336Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:2c7c8cad0032b9ad38e04249cd5239f2a424958323baf61938285c82d7a58731","observation_id":"e1b25060-dbe5-4d47-8025-4943a99c56f1","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1311.1714","last_updated":"2020-08-05T08:01:08Z","snapshot_observed_at":"2026-07-06T03:27:38.351508Z","submitted_at":"2013-11-07T15:38:09Z","title":"KaHIP v3.00 -- Karlsruhe High Quality Partitioning -- User Guide","version":9},"cited_work":{"arxiv_id":"1311.1714","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1311.1714","snapshot_observed_at":"2026-07-04T20:10:07.184427Z","title":"Sanders and C","venue":null,"work_id":"054d306b-b4a6-4a8d-b06e-eba8b8c66f05","year":2013},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"cited_paper":"/paper/1311.1714","citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:b8c4ddd4bb4606f2887840a1318b6d292e62d5e1e01fa7195d42299cfbbd2828","observation_id":"4077170a-89ea-4403-913b-c1e4d9b149b7","resolution":{"observed_at":"2026-07-04T20:10:07.186379Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-25T20:44:30.520336Z","title":"AMD Versal Premium VP1902 Adaptive SoC, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:dccf42a427627d8c0be65b76ad90174a2607dcbefcf6b5cdb7c8864c3916eec4","observation_id":"b5151cbd-ba39-439f-9723-3821f874b0e1","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Parallel random numbers: as easy as 1, 2, 3","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:e9bdcf982c7899e65a3ca737827ccc0b86a4551ab5b75cb3147f41667140db0d","observation_id":"43704649-613c-4b75-b8ed-21d549a1f4c7","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Gset: A benchmark library for graph partitioning and Max-Cut, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:38b796df149255987ac766b3681e3aea3ef114a9fa0db8c4d22203bf77eb3173","observation_id":"fc63aac1-409c-4b2d-b2a9-515b04e39e28","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-05T05:49:44.984059Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"cited_work":{"arxiv_id":"2505.18508","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.18508","snapshot_observed_at":"2026-07-04T20:10:07.190531Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut = 14060)","venue":null,"work_id":"2fe06dd9-0c87-4132-a18c-f68abbdcdfa3","year":2025},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"cited_paper":"/paper/2505.18508","citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:5132188c135ddb821db7c0ba7a933029d8b3826d3ca599818add2287fe14174d","observation_id":"ef7962d5-a408-408a-8fd7-bf7ff1cf79da","resolution":{"observed_at":"2026-07-04T20:10:07.192133Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.30355","last_updated":"2026-06-01T03:59:44Z","snapshot_observed_at":"2026-07-12T19:44:00.422537Z","submitted_at":"2026-04-16T17:42:58Z","title":"Cosm: Collective Switched Motion for Fast and Accurate Sparse Ising Optimization","version":2},"cited_work":{"arxiv_id":"2605.30355","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.30355","snapshot_observed_at":"2026-07-04T20:10:07.187548Z","title":"Cosm: Collective Switched Motion for Fast and Accurate Sparse Ising Optimization","venue":"cs.CE","work_id":"aeca20b6-a05d-4458-a582-fc7563900cab","year":2026},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"cited_paper":"/paper/2605.30355","citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:4b94401f85e931696f3157888e495e08a94adf10932eb5ab0804234df5ad50d1","observation_id":"9ed20fbf-b5b1-4966-a44d-dccec2eb047b","resolution":{"observed_at":"2026-07-04T20:10:07.189215Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-25T20:44:30.520336Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:0552fd65b2d60a9e73cf53080a8d2ffdb5c2e117ce165ea27c74b876fa729c78","observation_id":"66de0f46-35f0-41da-bca9-e3b67a6309b6","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Equation planting: a tool for benchmarking Ising machines.Physical Review Applied, 12(1):011003, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:53856269c49da904af6a36865e6af8769fdcb9bba1d9aa5d67ebe93890a61fa2","observation_id":"fc9b927a-44dc-405d-96ad-d15731cdde8a","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Analytic and algorithmic solution of random satisfiability problems","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:026f636e7842fa040d640bae1dcf384ef5913d1c3cd1ff06e40f307a495b78ce","observation_id":"cd4c931d-f6bf-470f-bf30-a2a8b0cb2634","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"3SAT on an all-to-all-connected CMOS Ising solver chip.Scientific reports, 14(1):10757, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:c21c6ee58e0d4b83c5b79d8306955a1f56db9499a1423de00343458f4fde9ffd","observation_id":"fa5a87c7-0174-4e53-bfae-aeb139b8a361","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"An 8K-Spin Ising Machine IC with Reconfigurable Many-Body Spin Interactions and Limitless Multichip Extension","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:5344e07e661701c1c6e68066bd5cf2722b2ff4990c8e87448b166fa2976b80eb","observation_id":"59d3eb47-9521-42c7-ae14-c423e1f3cba1","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Analyzing Hogwild parallel Gaussian Gibbs sampling.Advances in neural information processing systems, 26:2715–2723, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:84db7c4f68bd00b63763684de9ea2bfe605061dae7e9be18e4cebbab00dbd827","observation_id":"66d3350c-fa92-40b5-a29b-c6079838a602","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"ASAP7: A 7-nm finFET predictive process design kit.Microelectronics Journal, 53:105– 115, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:9cecca2b670d536eeee98a2c2a11f60b90cc955db2d34efa4efe9dd36e351db7","observation_id":"fbe5a17b-7306-4ce3-9e3e-95473e5ae3b5","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Universal Chiplet Interconnect Express (UCIe) Specification.UCIe Consortium, Technical Specification","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:a4508e1ea9363f070820ca3bb46d4c54d3d7feb8a6fed30d90165f593a30e224","observation_id":"bdda35ef-4289-4270-8aaf-b5cf47209017","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Bunch of wires: An open die-to-die interface","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:1befb0ca0ecf4a5f0bc8a90119a4165655af454ea9f4c7b32613d22855749cfb","observation_id":"f3cf0b20-2220-43cf-933c-6ed35000831e","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Foundry Monolithic 3D Unlocks Large Throughput Benefits: 3D Memory with Tucked Sense Amplifiers + Logic using Heterogeneous Silicon CMOS + Resistive RAM + Carbon Nanotube FETs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:e0e52e6ad995fbab08303a0d8897c97608479c04f305437ece2bdf3e723468b2","observation_id":"f1603734-4d21-4ada-ab81-e305e83cdc3e","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"NVIDIA Blackwell Platform: Advancing Generative AI and Accelerated Computing","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:8c572b8feae5ae6ca89c02b05933a4c382e2b0728c4ffcc12db10e499417e957","observation_id":"f789e9b4-042a-4b84-9de1-afd448a269f2","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"DAC-Free p-bits: Asynchronous Self-Coloring and On-Chip Annealing","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:d2a77ce063e43c8cf25ddb35bfd35ba45e69dd9184daa73f492f7d4627a1d412","observation_id":"c9d0c842-87a2-462b-9b43-38118f8c5a6f","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"An integrated-circuit-based probabilistic computer that uses voltage- controlled magnetic tunnel junctions as its entropy source.Nature Electronics, 8(9):784–793, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:2fe0b8c435dd82cbfd0beade4690c153884028333015ce510bf9c2dc861cbd3a","observation_id":"00f2c516-b160-45fb-b234-868068655162","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Experimental demonstration of an on-chip p-bit core based on stochastic magnetic tunnel junctions and 2D MoS2 transistors.Nature Communications, 15(1):4098, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:486d847697557ead7235332647f886e2accadbf030ecccd38d4df2813dc88d6a","observation_id":"35593735-0b6d-4155-81b0-a8b8552332f3","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:79e07d52cee608b8464a7fc4c37fb942a2ebc2d22f9a01c98c2d868438df3dd1","observation_id":"7b8b579e-23e0-48c4-838a-674c77a58847","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"L’hypoth`ese du champ mol´eculaire et la propri´et´e ferromagn´etique.Journal de Physique Th´eorique et Appliqu´ee, 6(1):661–690, 1907","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:89f53b0cb600eef345521e585a46bd5414b68cd1d48436f920e88e54c79c4635","observation_id":"0bce027a-9af7-4352-a3cc-e2f3c0494bcd","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Quantum correlated cluster mean-field theory applied to the transverse Ising model.Physical Review E, 93(6):062116, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:2fa46ec462ef0073f82ff7bf1ba3e1e68191031aa156f1564244bc3ed49c9d0b","observation_id":"0b5bd6e5-0070-407b-b7e4-5bd6dbc71e4d","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Accelerating Adaptive Parallel Tempering with FPGA-based p-bits","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:90eebe75ce5f46a18f65d865c5c328130b09d0c739cb4f8cf6372028bd2a7557","observation_id":"c575e439-1fcf-46cd-8f38-cae394f0c57e","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Algorithm portfolios and teams in parallel optimization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:e114d29cc72214d95afadd6f1ad3aea3a46ebc0fd209769c33448821be3cf097","observation_id":"44dc48c4-1424-449b-b61d-5909ae3e84c6","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel.Cybernetics and Systems Analysis, 51(1):16–24, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:ba5617526d971596ce9a8f1899535f40a90e838486a9fd399003de99156bf5cd","observation_id":"9e5a3081-0fc1-4b7e-bfc2-0714364a1b07","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"CNFgen: A generator of crafted benchmarks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:b6b2a03d288df8babdf7a05583f0922dec79980df62b085998061908fbf95688","observation_id":"e38450ba-f4b8-45bc-837d-ad386814c10c","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"In-datacenter performance analysis of a tensor processing unit","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:85620e38277d271b5f9446f7ead4bbde9b139ba0ba283e133ddf63250fab6fd8","observation_id":"c6625eec-29d3-469c-9cc9-16f52c68f058","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"NVIDIA Tesla P100: The Most Advanced Datacenter Accelerator Ever Built","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:2a87fe85213097243139e7bffad511cb9202141c0eb605369241be540398b820","observation_id":"3af462fd-5b3f-4171-9ddc-09f812d621e0","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Cerebras architecture deep dive: First look inside the hardware/software co-design for deep learning.IEEE Micro, 43(3):18–30, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:73f6ffeebdf44e0eeed1302ca7cd4b0e9e497e0ba4c4c67543f0ffce745f66a0","observation_id":"6864fe06-9661-4444-b255-b51758d22d1a","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":"Simba: Scaling deep-learning inference with multi-chip-module-based architecture","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:ee4f574f044e80a6edf34ddd772f39e8cd429e36e8f93172b52bbdf236f86244","observation_id":"14e9d76c-c9e7-487b-9d61-e2e09fa713d7","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","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-06-25T20:44:30.520336Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:69be3774e98ba9b4d42b6f2ec491f6976cb2117ea457a6005e9df5e89989e4b2","observation_id":"a2821d4d-1ca3-4e3e-acab-94c86f477687","resolution":{"observed_at":"2026-06-25T20:44:30.520336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits"},"reference_resolution":{"displayed":80,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":73,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":80},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 80 of 80 outbound references and 0 inbound Pith citation observations for arXiv:2606.25313."}