{"as_of":"2026-08-11T05:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:78aecf71fad46726899c24023b8a7324e51739179262aab64e72ed03d2dca430","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T19:57:57.946455Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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-03T22:06:47.938669Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.09622","snapshot_observed_at":"2026-08-03T22:06:47.938669Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.12482","last_updated":"2026-06-02T03:23:05Z","snapshot_observed_at":"2026-08-10T13:27:22.774122Z","submitted_at":"2025-11-16T07:31:50Z","title":"Discovering autonomous quantum error correction via deep reinforcement learning","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T22:06:47.938669Z"},"links":{"cited_paper":"/paper/2501.09622","citing_paper":"/paper/2511.12482"},"observation_digest":"sha256:8d68ecb3ae21cc51a4683c480b99af6fa165223413f3e1e4e292eee1448eb048","observation_id":"735e0adf-bc56-4cf8-a220-53f2e2b25d0b","resolution":{"observed_at":"2026-08-03T22:06:47.938669Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.09622/citation-record","integrity":"/paper/2501.09622/integrity","json":"/paper/2501.09622/citation-record.json","paper":"/paper/2501.09622"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:57:57.691155Z","title":"Quantum low-density parity-check codes,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.691155Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:c44dc4c3903132ac5d6a6cc95550c447458e65cdde8245db925c94d9437a64c8","observation_id":"b829776f-92f1-4f82-b92f-35236d7f4e7c","resolution":{"observed_at":"2026-08-10T19:57:57.691155Z","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-10T19:57:58.846278Z","title":"Fault-tolerant quantum computation with constant over- head,","venue":null,"work_id":"8cf52531-9515-482f-8f0c-5d8ccede557b","year":2014},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.696928Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:49faac0120fb6a1d2e0d475fc9847f7f0dbd99bb844c09069bf094b51fc68468","observation_id":"9e438791-aa04-47e3-80fc-da848f063d23","resolution":{"observed_at":"2026-08-10T19:57:58.850265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:57.702014Z","title":"Constant overhead quantum fault-tolerance with quantum expander codes,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.702014Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:7e0030bca2f047b66e02d89dbeae3d653743ee4ea939ee5239aca407b4d84386","observation_id":"cf5539d2-2b09-468a-a306-d9f20fdb530b","resolution":{"observed_at":"2026-08-10T19:57:57.702014Z","resolver_source":null,"status":"malformed_identifier"},"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-10T19:57:58.834428Z","title":"Constant-overhead quantum error correction with thin planar connectivity,","venue":null,"work_id":"90bddef9-26f9-4cf6-b866-aea97a62910d","year":2022},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.706456Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:68dc6d7c2d2492ace42d006075336e7ca077aa89a2f22d7d1c6c99da3d127c0a","observation_id":"cb133bcd-597c-4251-b476-eece9fe51d80","resolution":{"observed_at":"2026-08-10T19:57:58.838755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:57.710783Z","title":"Quantum computing with neutral atoms,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.710783Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:f99ecf2aaf5441e9cecc92c42a9ad971b1bbe4a53abf1a22aab32ed99ef471f8","observation_id":"9761e6ba-8b70-42ab-8357-9de16359d722","resolution":{"observed_at":"2026-08-10T19:57:57.710783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.08648","last_updated":"2023-08-16T19:47:17Z","snapshot_observed_at":"2026-07-06T16:07:02.983419Z","submitted_at":"2023-08-16T19:47:17Z","title":"Constant-Overhead Fault-Tolerant Quantum Computation with Reconfigurable Atom Arrays","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.08648","snapshot_observed_at":"2026-08-10T19:57:57.716003Z","title":"Constant- overhead fault-tolerant quantum computation with reconfigurable atom arrays,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.716003Z"},"links":{"cited_paper":"/paper/2308.08648","citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:363670c633d97ee94fe0d69a38117ed91feb6c7ff403455b8e07883236e82f6c","observation_id":"9b13298e-72df-4b93-81e7-bfc52f01c25e","resolution":{"observed_at":"2026-08-10T19:57:57.716003Z","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-10T19:57:58.822248Z","title":"Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects,","venue":null,"work_id":"23304525-9364-4b56-a973-d2c1e53ea7ba","year":2014},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.721435Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:ba2b9baa21257c3c380414ca0d1d3422067b75f9cdc52c8f4b1c778f5daab816","observation_id":"9fdb9c70-24ee-482b-9267-f94b5b5dbb1e","resolution":{"observed_at":"2026-08-10T19:57:58.826746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:58.811318Z","title":"A race-track trapped-ion quantum processor,","venue":null,"work_id":"f84b1f18-4330-4d50-a3ab-51ad097a0912","year":2023},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.726246Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:5c3c45241835a58d463f0bb79a9412501b1d690cfcc2d962252c8c9536bcadc9","observation_id":"282d5295-5a79-4d5b-8e46-685c95152239","resolution":{"observed_at":"2026-08-10T19:57:58.815266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:58.799934Z","title":"Benchmarking a trapped-ion quantum computer with 30 qubits,","venue":null,"work_id":"7a09927d-a665-415c-bc1a-7b80e8330ce5","year":2024},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.731518Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:3de1998f7a12748488cc7e598908a2a3e6fb5546f6d61b9408433b567fcb1162","observation_id":"9e16cf7e-9c4c-46c5-b1c4-822088ad1707","resolution":{"observed_at":"2026-08-10T19:57:58.803688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:57.737030Z","title":"Entangling four logical qubits beyond break-even in a nonlocal code,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.737030Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:c011e144e22715f073cdcfd5e827379661e176a50cbea35300e1be29e64272da","observation_id":"b5f1efe6-66a2-46f9-9349-56f7fbb24c6d","resolution":{"observed_at":"2026-08-10T19:57:57.737030Z","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-10T19:57:57.741860Z","title":"High-threshold and low-overhead fault-tolerant quantum memory,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.741860Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:70ac0d0de51bb244bdbd11b3175a0c1983c3c7c48fcdadca3240103bd02a120c","observation_id":"9530fbd2-7135-430c-8cc3-d6a01340c49e","resolution":{"observed_at":"2026-08-10T19:57:57.741860Z","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-10T19:57:57.746132Z","title":"Quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.746132Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:54b7d79d1f5e2d1f6fb4e866a49df4f4765a238cf712f0cb99d2afae12a8e6d8","observation_id":"00399034-a947-408e-80ac-96447c35c633","resolution":{"observed_at":"2026-08-10T19:57:57.746132Z","resolver_source":null,"status":"malformed_identifier"},"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-10T19:57:58.782601Z","title":"Asymptotically good quantum and locally testable classical LDPC codes,","venue":null,"work_id":"6d048f92-38c4-490f-a1da-07138842728a","year":2022},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.750689Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:8cd251319392222d1265ee061f15b6cbaa4fa8565eac4924dd2717951ba8c9b5","observation_id":"385ae21c-3602-4152-95fe-3e3fd1ca176d","resolution":{"observed_at":"2026-08-10T19:57:58.786306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:58.773076Z","title":"Quantum Tanner codes,","venue":null,"work_id":"3cba4d2a-7a04-4057-84de-9bf80f7587a8","year":2022},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.755326Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:5b3a7a37e1918193cae405458bb8a0ea8ee466af620dc3d7ce20b603a5e07c2f","observation_id":"c57c2d06-1d34-4e5c-8da3-9a1595ccbfc0","resolution":{"observed_at":"2026-08-10T19:57:58.776187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:57.765646Z","title":"Good Quantum LDPC Codes with Linear Time Decoders,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.765646Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:2ac997acf01fe70dd054b9ab1d5dafdffe64b6f6f95ce7685547f801f4c8d73e","observation_id":"b3e71112-960d-4593-bb19-e2fbdae6a4c3","resolution":{"observed_at":"2026-08-10T19:57:57.765646Z","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-10T19:57:58.762303Z","title":"On the iterative decoding of sparse quantum codes,","venue":null,"work_id":"873bf637-83e9-4434-ab1d-844f1956115a","year":2008},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.771897Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:7d23ac711c5db453445d17f6939f31a3e418bf727c4d3ee6c41611af574128fe","observation_id":"4ee80084-fff5-48e4-81df-5fced033a371","resolution":{"observed_at":"2026-08-10T19:57:58.766099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:57.776949Z","title":"Degenerate quantum ldpc codes with good finite length performance,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.776949Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:72b709e24ffcdc279c6a9b67d56ae8db6da9613f8a0a496215146ddcaecbb6d1","observation_id":"e7018d51-6c3b-4f19-87f8-ebf143798c15","resolution":{"observed_at":"2026-08-10T19:57:57.776949Z","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-10T19:57:57.782689Z","title":"Decoding across the quantum low-density parity-check code landscape,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.782689Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:375a03061cfd1e2bda9affa47fe078eea0734804f67251e05997a334e746d3a1","observation_id":"5675e4e6-1625-46a0-9238-dadfcea2a836","resolution":{"observed_at":"2026-08-10T19:57:57.782689Z","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-10T19:57:58.744159Z","title":"Progressive edge-growth tanner graphs,","venue":null,"work_id":"83a9f481-4e8b-4899-a192-f2dc9ff07581","year":2001},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.786183Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:60a31f19b07aace4074c79b858876354a9fff7cd47586ce69fa8c66d650983c3","observation_id":"a7d0d43e-191f-44d6-9626-3e2b81ff79da","resolution":{"observed_at":"2026-08-10T19:57:58.747701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:57.789946Z","title":"Erasure conversion for fault-tolerant quantum computing in alkaline earth rydberg atom arrays,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.789946Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:ce0e787bca6814c05beca816de32147def07cf0479b8af760c03b94f69913a1b","observation_id":"eda047ba-402a-4440-bc93-ba0fa624092f","resolution":{"observed_at":"2026-08-10T19:57:57.789946Z","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-10T19:57:57.793181Z","title":"Erasure conversion in a high-fidelity rydberg quantum simulator,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.793181Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:402818caa2ec40d00551f3c57ae5fe4201707ee2991e5fd626f68f47af31575b","observation_id":"3dd21d6d-2a9e-4c21-8045-31a1c2ac304c","resolution":{"observed_at":"2026-08-10T19:57:57.793181Z","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-10T19:57:57.796385Z","title":"Quantum error correction with metastable states of trapped ions using erasure conversion,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.796385Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:d5905460b9c0c5777ad9f90627d509b5082b15dc2e0a617be55acca6c5f57c6d","observation_id":"d57b83bf-d00f-4a72-ba9e-17944079ee56","resolution":{"observed_at":"2026-08-10T19:57:57.796385Z","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-10T19:57:57.799454Z","title":"Erasure qubits: Overcoming the t1 limit in superconducting circuits,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.799454Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:781592f148f64aaf4b175329cff6c7000cc49e5fb08a3169c5c8b47e04d3b068","observation_id":"ffa0c930-f73f-42b9-88a5-2a96beb157a6","resolution":{"observed_at":"2026-08-10T19:57:57.799454Z","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-10T19:57:58.732106Z","title":"Fast erasure decoder for hypergraph product codes,","venue":null,"work_id":"e1435b8a-e73c-4c0e-86c7-4338ef3c2372","year":2024},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.802706Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:a3c4e7580ffb568f246a9ffb70716b646b2d884e8e225f0fd0139a3f9f5b91c3","observation_id":"fcc93f03-365c-45c8-a3bc-1c15f536d5eb","resolution":{"observed_at":"2026-08-10T19:57:58.736847Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:58.720234Z","title":"Erasure decoding for quantum ldpc codes via belief propagation with guided decimation,","venue":null,"work_id":"e9880b97-f7bd-41a5-b511-be4d9f851295","year":2024},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.806015Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:859e0ae47bed24d9870be97882f547705e3f9723cd245d15446447c699155c90","observation_id":"3a2b190e-2ce3-4ac9-bf85-804079a1e46f","resolution":{"observed_at":"2026-08-10T19:57:58.724342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.08817","last_updated":"2024-12-11T23:14:23Z","snapshot_observed_at":"2026-07-06T20:05:36.919481Z","submitted_at":"2024-12-11T23:14:23Z","title":"Cluster Decomposition for Improved Erasure Decoding of Quantum LDPC Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.08817","snapshot_observed_at":"2026-08-10T19:57:57.810346Z","title":"Cluster decomposition for improved erasure decoding of quantum ldpc codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.810346Z"},"links":{"cited_paper":"/paper/2412.08817","citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:3bcaf029ce8e97c9042fff23077460674eec5846c23f57b5179fa96bc68f5f79","observation_id":"b091ab9f-ac58-4b5c-ba24-6f519a333dd3","resolution":{"observed_at":"2026-08-10T19:57:57.810346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.06378","last_updated":"2023-06-12T18:51:09Z","snapshot_observed_at":"2026-08-10T13:48:41.779752Z","submitted_at":"2023-05-10T18:00:03Z","title":"Discovery of Optimal Quantum Error Correcting Codes via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06378","snapshot_observed_at":"2026-08-10T19:57:57.814812Z","title":"Discovery of optimal quantum error correcting codes via reinforcement learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.814812Z"},"links":{"cited_paper":"/paper/2305.06378","citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:c700763abeac9909060ae4e0087e72f6e2e8815ca0733ecef63df0a42181157c","observation_id":"7c69aca1-4eac-45d0-82cf-6128cbf588a8","resolution":{"observed_at":"2026-08-10T19:57:57.814812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.11470","last_updated":"2023-05-19T06:44:59Z","snapshot_observed_at":"2026-07-06T15:29:35.640358Z","submitted_at":"2023-05-19T06:44:59Z","title":"Optimization of Tensor Network Codes with Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2305.11470","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.11470","snapshot_observed_at":"2026-08-10T19:57:58.260516Z","title":"Optimization of Tensor Network Codes with Reinforcement Learning","venue":"quant-ph","work_id":"c6085724-4572-4af3-84ef-10c31b39c616","year":2023},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.821923Z"},"links":{"cited_paper":"/paper/2305.11470","citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:9009436b2789d4404d999208e4e8141144db98ba7de29a7e3e61b4048f1ce94d","observation_id":"9d006b45-8714-4779-8c66-6886f4b69827","resolution":{"observed_at":"2026-08-10T19:57:58.265443Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1104.3787","last_updated":"2013-02-08T06:03:03Z","snapshot_observed_at":"2026-07-06T02:26:35.425770Z","submitted_at":"2011-04-19T16:02:44Z","title":"Projective simulation for artificial intelligence","version":3},"cited_work":{"arxiv_id":"1104.3787","doi":null,"metadata_source":"pith","pith_arxiv_id":"1104.3787","snapshot_observed_at":"2026-08-10T19:57:58.238298Z","title":"Projective simulation for artificial intelligence","venue":"nlin.AO","work_id":"112e8a97-2a7d-490a-9065-7f188a26d410","year":2011},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.826812Z"},"links":{"cited_paper":"/paper/1104.3787","citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:a722571527341e7f9b489aa9b0409d0b4ca4eec87397f5cc477f46313cbf5a99","observation_id":"1b799a51-af9c-4c5d-87ea-0727c12b2f3b","resolution":{"observed_at":"2026-08-10T19:57:58.243010Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:58.706915Z","title":"Projective simulation with generalization,","venue":null,"work_id":"74ac4223-c6b9-4fcb-b903-bac4544c31cb","year":2017},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.833980Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:bedb538d7d4eccd99a1cbc11477d95f1a5c018737e4e11ec14fdbc5a83facfb1","observation_id":"a8e47310-8f66-4aaf-9dab-37b1f9f8a2e9","resolution":{"observed_at":"2026-08-10T19:57:58.711457Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:57.839720Z","title":"Surface codes: Towards practical large-scale quantum computation,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.839720Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:a71832b4141cbb53158434238b96d82a01ab38b40827587a689f60436d416163","observation_id":"47807e66-526a-4549-b776-d0be231ce226","resolution":{"observed_at":"2026-08-10T19:57:57.839720Z","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":"10.22331/q-2019-12-16-215","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:57:58.003220Z","title":"Optimizing Quantum Error Correction Codes with Reinforcement Learning,","venue":null,"work_id":"c687ddc5-0354-472c-ad2c-a0dd88ea1230","year":2019},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.843973Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:fc0a68b6b47bab3e630580ccee0ba0bcda8d070dba283cd38a3b281293c3aac2","observation_id":"20b70289-5122-4986-9fb0-c11c667a3a93","resolution":{"observed_at":"2026-08-10T19:57:58.013737Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:58.694794Z","title":"A linear-time benchmarking tool for generalized surface codes,","venue":null,"work_id":"a7e1ab38-4e0b-4bc7-8c7f-d3a075126ad6","year":2016},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.848191Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:ac6bfea3d793e2667dacadfbbe67f29b3babf9cf2a6ac0831339b47c71f23a29","observation_id":"867cc981-f1f7-424d-8acb-44f7587293d0","resolution":{"observed_at":"2026-08-10T19:57:58.699094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.13017","last_updated":"2024-09-19T18:00:02Z","snapshot_observed_at":"2026-08-03T13:36:33.217327Z","submitted_at":"2024-09-19T18:00:02Z","title":"Engineering Quantum Error Correction Codes Using Evolutionary Algorithms","version":1},"cited_work":{"arxiv_id":"2409.13017","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.13017","snapshot_observed_at":"2026-08-10T19:57:58.216131Z","title":"Engineering Quantum Error Correction Codes Using Evolutionary Algorithms","venue":"quant-ph","work_id":"a6de5b97-0372-4018-a0c7-d0e4ec93c8cb","year":2024},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.852777Z"},"links":{"cited_paper":"/paper/2409.13017","citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:81cf673b36a184c8b4b8295cbab4793239c7bde4107571ac8bf6a14bed988150","observation_id":"0d5ecd4d-586d-477b-859f-1e551e81670b","resolution":{"observed_at":"2026-08-10T19:57:58.222001Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:58.683279Z","title":"Simultaneous discovery of quantum error correction codes and encoders with a noise-aware reinforcement learning agent,","venue":null,"work_id":"4ab9a1d7-105a-4a5d-bc95-a9f60acc2f36","year":2024},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.857512Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:e521e4b3626ae1c09935754be90114cf012c7dc9f10d055fcb8bdcc9a95d9ecf","observation_id":"357bb60d-a218-4f4b-9b21-609021913612","resolution":{"observed_at":"2026-08-10T19:57:58.687414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:58.671517Z","title":"Ps hgp qec,","venue":null,"work_id":"e01965d0-b8ee-4730-a984-aabb64eea978","year":2024},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.861607Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:e1696f20b6e8055b2fb815505a667e874183c0327bad4f958546e3da275617b6","observation_id":"4ad68767-e0c9-433d-8ff1-58ec29458e65","resolution":{"observed_at":"2026-08-10T19:57:58.675340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:57.867182Z","title":"Good quantum error-correcting codes exist,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.867182Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:a99ec08b987fd5798244043b8712db8295a8b4c5e50014e6b5e4fb6da30fad27","observation_id":"44ab5c80-7bc6-40ff-9dfb-4d27675737d5","resolution":{"observed_at":"2026-08-10T19:57:57.867182Z","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-10T19:57:57.873433Z","title":"Multiple-particle interference and quantum error correction,","venue":null,"work_id":null,"year":1954},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.873433Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:af70d4573e0a8485cc39b3d88ae0565123172a235427f5eb8643cd9a3548b789","observation_id":"4527c58c-f18a-4b74-bbc2-a725d97f1ec8","resolution":{"observed_at":"2026-08-10T19:57:57.873433Z","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-10T19:57:57.878111Z","title":"Localized statistics decoding: A parallel decoding algo- rithm for quantum low-density parity-check codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.878111Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:732087b8ca188e17685e4162821b9c52b9d10a94dcb99ace72b14186d928bc2b","observation_id":"5f02e85c-cb88-436b-a3b7-bf8c64a78203","resolution":{"observed_at":"2026-08-10T19:57:57.878111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14527","last_updated":"2025-01-03T16:40:42Z","snapshot_observed_at":"2026-08-05T00:02:31.204110Z","submitted_at":"2024-06-20T17:39:31Z","title":"Ambiguity Clustering: an accurate and efficient decoder for qLDPC codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.14527","snapshot_observed_at":"2026-08-10T19:57:57.882739Z","title":"Ambiguity clustering: an accurate and efficient decoder for qldpc codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.882739Z"},"links":{"cited_paper":"/paper/2406.14527","citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:78af9a55c3f69ccadb859919d54abf833bc72de48e72325e07b18ad038a0b544","observation_id":"b64131d4-3d1b-4e64-8ef1-c5b91f3c402d","resolution":{"observed_at":"2026-08-10T19:57:57.882739Z","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-10T19:57:58.653700Z","title":"Upper bounds on the rate of low density stabilizer codes for the quantum erasure channel,","venue":null,"work_id":"90c6e962-23a3-4c07-a31d-d05184998ab2","year":2013},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.887482Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:a2997722c92a6b730031ec8951cad3df7fb471f2a8d7625c9c72374f1ba6aede","observation_id":"a769c199-79ba-4665-8603-d28bb64e2074","resolution":{"observed_at":"2026-08-10T19:57:58.657871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:58.641564Z","title":"Simulated annealing,","venue":null,"work_id":"844759f9-7317-4834-bc3f-d4a6dd9cc406","year":1993},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.896590Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:3538c9bda393f5dd27d01f05fcfb48a943fb64b48fc06eee803f2305d4fa236b","observation_id":"f2598aeb-9915-4de9-af81-82e5c60295df","resolution":{"observed_at":"2026-08-10T19:57:58.646063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:58.628455Z","title":"Albrecht and G","venue":null,"work_id":"f3214f90-00ca-4ed7-a8a7-9f3f8c3df0eb","year":null},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.901354Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:0269c2b54eb9cc7b34fcd5d47bd849e7d022e1f7b67b9c8aca4f32b164458a73","observation_id":"8feb97c9-305b-459b-baa8-a8056e6fc88e","resolution":{"observed_at":"2026-08-10T19:57:58.632461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:58.614447Z","title":null,"venue":null,"work_id":"2dd72e75-86e5-49a6-bf66-fba93e7af3ec","year":null},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.905769Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:59271c7caa67ffd78558786eb986768d55a8d7eda65386e5bfdac00ea63ac05f","observation_id":"a499de24-f073-4c37-b946-b13b2678cae3","resolution":{"observed_at":"2026-08-10T19:57:58.619933Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:57.910701Z","title":"Exploring network struc- ture, dynamics, and function using networkx,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.910701Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:d22c50ac4896d1935ac7f4533977af2e64ba4753529dfffe2685ff948f1a31b7","observation_id":"c929cfe3-4b79-47f8-a125-32c436151a86","resolution":{"observed_at":"2026-08-10T19:57:57.910701Z","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-10T19:57:57.917662Z","title":"Array programming with NumPy,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.917662Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:ad7716abe861ecbfa2f9682966e720a87a28ed6bbe52e29b3a2d6909d9eea67e","observation_id":"73283ad4-ef92-4501-b922-6424773884d7","resolution":{"observed_at":"2026-08-10T19:57:57.917662Z","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-10T19:57:57.922721Z","title":"SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.922721Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:13f538c742c987bcad2bfda648d0f524c9de1c8615623118caa4c5e66e4e74e7","observation_id":"e32f6235-9db6-46c8-879a-db0a59a07b9a","resolution":{"observed_at":"2026-08-10T19:57:57.922721Z","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-10T19:57:57.926386Z","title":"LDPC: Python tools for low density parity check codes,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.926386Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:5549f3190daea99c4fece7863da2143b6a41470c242f182362d830811dd553dd","observation_id":"d9b6c049-2971-479f-be9d-182ab84dac89","resolution":{"observed_at":"2026-08-10T19:57:57.926386Z","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-10T19:57:58.571729Z","title":"A survey of actor-critic reinforcement learning: Standard and natural policy gradients,","venue":null,"work_id":"86548f93-ead7-4dfe-971b-42a86c8ddadc","year":2012},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.935043Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:ceaa9a37daf9638d24afcaa77c0bded57bac9c7fe56a7a7fcbcc48ba3568c5b4","observation_id":"5019e838-bed7-4e61-8458-1dbff12355b7","resolution":{"observed_at":"2026-08-10T19:57:58.575591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:58.561725Z","title":"Re- inforcement learning decoders for fault-tolerant quantum computation,","venue":null,"work_id":"f62f4fa2-2029-4bb8-9363-d953067a0e5b","year":2020},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.938252Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:30ad0901eea6929e6962e3748dd613ebc1649dfc02e710d026bf9e0f1e922147","observation_id":"fadc95f0-89e4-4ffe-83eb-b9a2c0488df3","resolution":{"observed_at":"2026-08-10T19:57:58.565196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T19:57:58.547294Z","title":"Optimization of decoder priors for accurate quantum error correction,","venue":null,"work_id":"af45fad1-5313-40ca-9a76-bdc85a965b9a","year":2024},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.943149Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:b5518be595aadb5282210768d759f8c77447a316861efbf806ef3c3619f0a412","observation_id":"a845a8ae-c74f-41a5-8a29-e8bd902524db","resolution":{"observed_at":"2026-08-10T19:57:58.551360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.07038","last_updated":"2024-08-26T15:39:03Z","snapshot_observed_at":"2026-07-06T19:00:17.992934Z","submitted_at":"2024-08-13T17:05:45Z","title":"Machine Learning Message-Passing for the Scalable Decoding of QLDPC Codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.07038","snapshot_observed_at":"2026-08-10T19:57:57.946455Z","title":"Machine Learning Message-Passing for the Scalable Decoding of QLDPC Codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.946455Z"},"links":{"cited_paper":"/paper/2408.07038","citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:b977d2f742cb95b6f65caf97446d3ee947678aeec12ae68d1833166a3fbed44c","observation_id":"a1210cc8-9b8d-46b6-a68c-1f4288e43722","resolution":{"observed_at":"2026-08-10T19:57:57.946455Z","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-10T19:57:57.931255Z","title":"Available: https://pypi.org/project/ldpc/","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.931255Z"},"links":{"citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:3a8f92bbbf931e3df1b9e2e32f016e7f933ec5abd4f479cbc295ed4365505873","observation_id":"6a3ccd7b-302e-4783-afaa-4a2e95a2840e","resolution":{"observed_at":"2026-08-10T19:57:57.931255Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-10T20:08:19.646091Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":4,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":4,"verified_fuzzy":19},"total_outbound_references":53},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 1 inbound Pith citation observation for arXiv:2501.09622."}