{"as_of":"2026-08-13T18:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:db57fe7b68edcc5a147f7a17169e13e7e260070ad7215c06ff24054a4faab8af","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T15:51:50.255598Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2608.02075/citation-record","integrity":"/paper/2608.02075/integrity","json":"/paper/2608.02075/citation-record.json","paper":"/paper/2608.02075"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:50:30.877262Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T15:50:30.877262Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:05de34aca300d78079e870aaf5d5b50b2707de38f3e184f0fba56da1208aa015","observation_id":"32a39b41-f880-4c5e-9596-a065ae7f6eb3","resolution":{"observed_at":"2026-08-04T15:50:30.877262Z","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-04T15:50:50.650336Z","title":"Programmable simulations of molecules and materials with reconfigurable quantum processors,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T15:50:50.650336Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:ca4b0cf75d1a26e46eed8b9857a07c165101320e37d7706f305ba2ef1a32d2a7","observation_id":"6949f55b-bb1e-4e1f-91aa-686a9270e1bf","resolution":{"observed_at":"2026-08-04T15:50:50.650336Z","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-04T15:50:50.698451Z","title":"Nonadiabatic molecular quantum dynamics with quantum computers,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T15:50:50.698451Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:1d9626a3110596425c8f282b0e88be92adbdd6e8d3b8884b21041f8f3cb89f3a","observation_id":"6ee0ee2b-ebc2-4d54-9a06-0c9a0b6a5e82","resolution":{"observed_at":"2026-08-04T15:50:50.698451Z","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-04T15:51:15.940968Z","title":"Universal quantum simulators,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:15.940968Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:2507636deab8107ff7e7b31c6c1e2321dd39868f0df4f16f88b6d05fb59f8ee3","observation_id":"ad3428cc-6d12-4715-87db-4fbe86a4e317","resolution":{"observed_at":"2026-08-04T15:51:15.940968Z","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-04T15:51:38.135956Z","title":"Quantum algorithms for electronic structure calculations: Particle–hole Hamiltonian and optimized wave-function expansions,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:38.135956Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:d8ac750703ca4f85d9dc873747550be78eefd6665642240bbf45286dd0389572","observation_id":"2b18ca96-b509-4d3c-aa0b-5dc20fe10519","resolution":{"observed_at":"2026-08-04T15:51:38.135956Z","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-04T15:51:44.608416Z","title":"A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:44.608416Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:a9b67259671e3bfd60f7e01d35b0396b5c3783fd1dcd5f859d30c33eb77cf5cc","observation_id":"d3d0a5c1-cc4f-49cc-b131-fa6c8dff724c","resolution":{"observed_at":"2026-08-04T15:51:44.608416Z","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-04T15:51:46.357947Z","title":"Quantum approximate optimization algorithm: Performance, mechanism, and im- plementation on near-term devices,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:46.357947Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:1c92a12a30d3632fb4234a7eaac765e5f6615d44730784736515154108252f23","observation_id":"48037f34-0fd4-46d9-920c-d85eef43fc2e","resolution":{"observed_at":"2026-08-04T15:51:46.357947Z","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-04T15:51:48.941239Z","title":"Quantum approximate optimization of non-planar graph problems on a planar superconducting processor,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:48.941239Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:409ea23918d5e942a4de7d08a200612f17ff1383de00a1e6cb75421539ba1826","observation_id":"69aea41d-a9b8-4da1-a27c-09e2e64caa35","resolution":{"observed_at":"2026-08-04T15:51:48.941239Z","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-04T15:51:50.054038Z","title":"Optimization by decoded quantum interferometry,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.054038Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:f860ebe6e159fdf8eba2b0c2ffe7842562c96f10612710b7e8db72aef1d32968","observation_id":"a2746b83-2f04-4145-beb0-a61beb4906f5","resolution":{"observed_at":"2026-08-04T15:51:50.054038Z","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-04T15:51:50.060869Z","title":"A quantum processor based on coherent transport of entangled atom arrays,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.060869Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:2479b4a3eebc9fad3ba73d3dce8fc1fb4ad7c99c548df1f2e291aa1379019ae6","observation_id":"4ded7473-e1ff-442d-a7e8-79506a039110","resolution":{"observed_at":"2026-08-04T15:51:50.060869Z","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-04T15:51:50.067799Z","title":"Logical quantum processor based on reconfigurable atom arrays,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.067799Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:1ac4e0b5d3af5266193b21bb9c68fe712366ae07d44063f3709fee9e5ce0c328","observation_id":"34c2025c-8f61-49e6-93be-495bd64ebe5b","resolution":{"observed_at":"2026-08-04T15:51:50.067799Z","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-04T15:51:50.073695Z","title":"Universal control of a six-qubit quantum processor in silicon,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.073695Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:be94f0ece35b90696bc4074d632a32f7da6ca4eec6aa408ef8752b05b786d19c","observation_id":"f4085254-85e7-489b-94a8-d06eda6d58c6","resolution":{"observed_at":"2026-08-04T15:51:50.073695Z","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-04T15:51:50.089678Z","title":"Generation of genuine entanglement up to 51 superconducting qubits,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.089678Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:2490b39a4d67a6ac720f565069121686646de91744ea41ea0be1ce7331a0f178","observation_id":"0aef877c-5013-44bb-bbd1-257b62168608","resolution":{"observed_at":"2026-08-04T15:51:50.089678Z","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-04T15:51:50.095797Z","title":"Advanced CMOS manufacturing of superconducting qubits on 300 mm wafers,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.095797Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:975a8ab9684f3f9f9a183aa4feb9f0eb1c5381ad4dd6a09f58f63d4367cbb188","observation_id":"8672f7db-e1de-4c94-acd4-6c4360659dbf","resolution":{"observed_at":"2026-08-04T15:51:50.095797Z","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-04T15:51:50.101021Z","title":"Demonstration of the trapped-ion quantum-ccd computer architecture,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.101021Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:1b82f82727f9d5b876a7a51315d9e1a1c2ba55362ecc11398fc2b6a1828df982","observation_id":"9821d5e9-80c1-4f41-8c29-741cf5d0c7b6","resolution":{"observed_at":"2026-08-04T15:51:50.101021Z","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-04T15:51:50.107722Z","title":"Experimental entanglement of four particles,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.107722Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:19beb554afbd4c5c05c942d42645d8d4e4917e0cdefec3ec788465a0c7c45720","observation_id":"7b5d3b84-5577-4a0d-a95a-d77b84dcd93b","resolution":{"observed_at":"2026-08-04T15:51:50.107722Z","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-04T15:51:50.113896Z","title":"Realization of the Cirac–Zoller controlled-NOT quantum gate,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.113896Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:43a4f9160c739268b1930e78c22d1908c86a9d10a441d3403ed0b10069d697c3","observation_id":"5964b35d-cb25-43bc-85ca-85903280aa62","resolution":{"observed_at":"2026-08-04T15:51:50.113896Z","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-04T15:51:50.121434Z","title":"Implementation of the Deutsch–Jozsa algorithm on an ion-trap quantum computer,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.121434Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:0ccc7216462bd09abe3c733456cb5f367498b6a6b94447a0173d424f0dbe1c52","observation_id":"ba3b7244-4b4e-4114-88f2-fb9d8c7bc0dd","resolution":{"observed_at":"2026-08-04T15:51:50.121434Z","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-04T15:51:50.127422Z","title":"Scaling the ion trap quantum processor,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.127422Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:5f3a4febbb0e9762daeb566a25fc5cb7a38de28a3067700586cc83824d9c1755","observation_id":"daa2dd05-79af-451a-8bc8-8d57d9929253","resolution":{"observed_at":"2026-08-04T15:51:50.127422Z","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-04T15:51:50.131778Z","title":"Quantum supremacy using a programmable superconducting processor,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.131778Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:ced888b766d3cef1b9c6c5cc745796544da1cab927023d92896a6d6476c42f2c","observation_id":"bdc11159-26b4-4c64-af07-ea8d8f7fac80","resolution":{"observed_at":"2026-08-04T15:51:50.131778Z","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-04T15:51:50.137692Z","title":"Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.137692Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:d89c03c44c63b3e410528c05d5bfbe791a889a8bae8018623eb2f5195d173a00","observation_id":"e42f4560-fc62-45ae-bb83-2aa4fe43b296","resolution":{"observed_at":"2026-08-04T15:51:50.137692Z","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-04T15:51:50.144125Z","title":"Constructing a virtual two-qubit gate by sampling single-qubit operations,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.144125Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:24b192b8433e7f0c19f9476d7a2b5713592976d9b945297d1ef2d7867fbd300a","observation_id":"66bd4d93-e7dc-4d6f-a85a-8bdf4d81a0e5","resolution":{"observed_at":"2026-08-04T15:51:50.144125Z","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-04T15:51:50.150671Z","title":"Circuit knitting with classical commu- nication,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.150671Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:75cc5d8a41fa5b80d12a352c0cabc48a679475d4b86b3cb22390b680217f1434","observation_id":"e61d1415-4263-4ce1-90aa-6ba792cda5de","resolution":{"observed_at":"2026-08-04T15:51:50.150671Z","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-04T15:51:50.155924Z","title":"Error mitigation for short- depth quantum circuits,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.155924Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:01bf6c5c939d0831d7e1cb3cc792c33c58801c26046b217c7b1cf437ba7e849b","observation_id":"ef3159be-506a-4cd1-8541-de3e123aa76c","resolution":{"observed_at":"2026-08-04T15:51:50.155924Z","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-04T15:51:50.160914Z","title":"Quasiprobability decomposi- tions with reduced sampling overhead,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.160914Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:8fd46d2ed29f66bcd4798f7e73d8864afa18d9181f140c72e09130097e5e4e1b","observation_id":"d399d26e-8886-4356-b8a9-27f7f99571a8","resolution":{"observed_at":"2026-08-04T15:51:50.160914Z","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-04T15:51:50.166504Z","title":"Combining quantum processors with real-time classical communication,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.166504Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:ba7d4d14dd1410c28e2e54f0c5329501519c9f8ac7bd8f2559a36ec6ef43176b","observation_id":"cecce325-8602-4d4b-88a1-712107083061","resolution":{"observed_at":"2026-08-04T15:51:50.166504Z","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-04T15:51:50.173178Z","title":"Theory of variational quantum simulation,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.173178Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:d8d9d92a70a4ed84d1c3232f9d7fb6554ccf67ef761ab1f9eb122cfa08e89c12","observation_id":"7c66644d-dfd3-45fe-98f3-fef13308f243","resolution":{"observed_at":"2026-08-04T15:51:50.173178Z","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-04T15:51:50.178037Z","title":"Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.178037Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:9c418f633cc0360ff97f18eb188d0970ab54006aaf96617c58698524ed425949","observation_id":"71add0e4-af27-4add-ad41-fd59881ff7f2","resolution":{"observed_at":"2026-08-04T15:51:50.178037Z","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-04T15:51:50.183170Z","title":"Variational quantum simulation of general processes,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.183170Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:d3e1fb845a8209582d19897e49e95fb262d58e1f7a18cc6d1168d92571425b18","observation_id":"4dc3bfe5-5a77-485c-8edc-31394aafd1de","resolution":{"observed_at":"2026-08-04T15:51:50.183170Z","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-04T15:51:50.189510Z","title":"Real- and imaginary-time evolution with compressed quantum circuits,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.189510Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:69209632473dc635f079d3407df0ccf76ca363e116093f8c37bdd5adae81d242","observation_id":"d14a62ee-6531-4fbc-996f-b16f98615fbe","resolution":{"observed_at":"2026-08-04T15:51:50.189510Z","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-04T15:51:50.195357Z","title":"An efficient quantum algorithm for the time evolution of parameterized circuits,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.195357Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:60dbd6a2e7379b5ec086083b4d92b22e9e63b3f8cef52e20239617fbe66b8ee4","observation_id":"b2e8118f-56db-4e8d-98f6-1cd08db53dbd","resolution":{"observed_at":"2026-08-04T15:51:50.195357Z","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-04T15:51:50.199863Z","title":"Stochastic approxima- tion of variational quantum imaginary time evolution,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.199863Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:82b3403e9c73436ca335a3a67e750a240004b8991221ed70aae7d13dde8123aa","observation_id":"bc11e670-82a6-4be1-8833-659961c72caa","resolution":{"observed_at":"2026-08-04T15:51:50.199863Z","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-04T15:51:50.205009Z","title":"Variational quantum time evolution without the quantum geometric tensor,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.205009Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:94df5c660aba2c2edb4551eb28304746c51a94c0943c8f78b7dbe902f570c161","observation_id":"4f2d9e17-ec67-420e-aa9f-dbca31eab700","resolution":{"observed_at":"2026-08-04T15:51:50.205009Z","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-04T15:51:50.210941Z","title":"Quantum natural gradient,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.210941Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:84b18f353021f3daf11c2991abb5d6c07428c6a02861dbdf103366c50a4484fd","observation_id":"1e8a9f51-e03b-4428-8a85-a057c1cda7a2","resolution":{"observed_at":"2026-08-04T15:51:50.210941Z","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-04T15:51:50.216327Z","title":"Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.216327Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:d7e0f5e1c2b2a97dc6c988896b8549682e5a76767b2417fc5c70eb2a030794c3","observation_id":"a9f3613d-ad76-46fb-b0a9-8530861a639a","resolution":{"observed_at":"2026-08-04T15:51:50.216327Z","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-04T15:51:50.222589Z","title":"Simultaneous Pertur- bation Stochastic Approximation of the Quantum Fisher Information,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.222589Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:aad53bc5c3e7bbfc881194deeb2f1444fb872c746b91c564595e0c731d16f9fb","observation_id":"43720e78-3c71-46c6-9fb6-b9adb106b10e","resolution":{"observed_at":"2026-08-04T15:51:50.222589Z","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-04T15:51:50.227706Z","title":"Quantum measurements and the abelian stabilizer prob- lem,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.227706Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:9288dd80558bd19379547092f264354b617d887260d26aaa8f46c9a35e99cca6","observation_id":"9f5530f8-1c00-47f0-86c7-344a043219ef","resolution":{"observed_at":"2026-08-04T15:51:50.227706Z","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-04T15:51:50.233218Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.233218Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:71cc5fc402530ff861b93a7161e5c52a42f84277e946e27211e719b4962c0167","observation_id":"ebe4d7c1-f700-45af-8928-d6f66f821ab0","resolution":{"observed_at":"2026-08-04T15:51:50.233218Z","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-04T15:51:50.239670Z","title":"Predicting many properties of a quantum system from very few measurements,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.239670Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:80edefb1d72b8ef53279d3bd8932e8de2cd0772c6f942a1a9fb1108a0b682704","observation_id":"e6c5258e-0e28-49bc-a333-a2ce872ee37a","resolution":{"observed_at":"2026-08-04T15:51:50.239670Z","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-04T15:51:50.244998Z","title":"Evans, N","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.244998Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:96e1e7d2728b75518e4a89635671a69996c295ed598666c34022e2abdc90a30e","observation_id":"566f18ce-022e-4eb0-a6ae-9a33e48efe6b","resolution":{"observed_at":"2026-08-04T15:51:50.244998Z","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-04T15:51:50.250332Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.250332Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:238e3048e73143b49d04ed70e8fcc238a388c47689ee71bb7fd3eca348b90473","observation_id":"094ee13c-8657-4df6-8b12-f3a4d7d16acf","resolution":{"observed_at":"2026-08-04T15:51:50.250332Z","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-04T15:51:50.255598Z","title":"Qiskit: An open-source framework for quantum computing,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.255598Z"},"links":{"citing_paper":"/paper/2608.02075"},"observation_digest":"sha256:ab993b68b1d960e9e3d80181f64c4ad022c22d2af2d3008e4344e3f2c4cb482b","observation_id":"94b1cfa1-9432-42eb-9e47-b1725663ff4e","resolution":{"observed_at":"2026-08-04T15:51:50.255598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.02075","last_updated":"2026-08-03T11:24:32Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-06T23:36:51.634100Z","submitted_at":"2026-08-03T11:24:32Z","title":"Efficient re-sampling in quasi-probability decompositions"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":42,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":42},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2608.02075."}