{"as_of":"2026-08-10T12:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fc3cf7808db67a64a7ce0f82883374b5a53f02d1c4d1b5ec59e9245bb06c7f24","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":16,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T14:08:37.916987Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T15:41:45.294064Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.12768","last_updated":"2024-10-14T16:55:22Z","snapshot_observed_at":"2026-07-06T18:47:56.109836Z","submitted_at":"2024-07-17T17:48:39Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12768","snapshot_observed_at":"2026-08-09T14:08:37.916987Z","title":"A polynomial-time classical algorithm for noisy quantum circuits,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01897","last_updated":"2025-02-04T00:03:07Z","snapshot_observed_at":"2026-08-09T20:07:50.477620Z","submitted_at":"2025-02-04T00:03:07Z","title":"Improved Quantum Computation using Operator Backpropagation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T14:08:37.916987Z"},"links":{"cited_paper":"/paper/2407.12768","citing_paper":"/paper/2502.01897"},"observation_digest":"sha256:ff1dfeeb15abb9a5f75d95fc90a76f8692a2bfdadcf38a077c73ad775fceb9a7","observation_id":"2818c3f2-5d7c-421d-9161-0231a3ec94ba","resolution":{"observed_at":"2026-08-09T14:08:37.916987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12768","last_updated":"2024-10-14T16:55:22Z","snapshot_observed_at":"2026-07-06T18:47:56.109836Z","submitted_at":"2024-07-17T17:48:39Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12768","snapshot_observed_at":"2026-08-08T12:08:05.741824Z","title":"Schuster, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.07670","last_updated":"2025-02-11T16:15:11Z","snapshot_observed_at":"2026-08-09T23:08:43.111691Z","submitted_at":"2025-02-11T16:15:11Z","title":"Interplay of resources for universal continuous-variable quantum computing","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-08T12:08:05.741824Z"},"links":{"cited_paper":"/paper/2407.12768","citing_paper":"/paper/2502.07670"},"observation_digest":"sha256:6d0f410be31bf6206c18b8e91ce2426e31121f8eb1029cd574ededceaf5e724d","observation_id":"0a4b063e-889c-41a1-9597-0964009baf82","resolution":{"observed_at":"2026-08-08T12:08:05.741824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12768","last_updated":"2024-10-14T16:55:22Z","snapshot_observed_at":"2026-07-06T18:47:56.109836Z","submitted_at":"2024-07-17T17:48:39Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","version":2},"cited_work":{"arxiv_id":"2407.12768","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.12768","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","venue":null,"work_id":"4e55afdd-5b17-487d-afd8-04a7cf1a1315","year":2024},"citing_paper":{"arxiv_id":"2505.09512","last_updated":"2026-04-08T15:29:39Z","snapshot_observed_at":"2026-07-06T21:23:51.965886Z","submitted_at":"2025-05-14T16:03:18Z","title":"Bra-ket entanglement, an indicator bridging entanglement, magic, and coherence","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-22T15:40:30.537829Z"},"links":{"cited_paper":"/paper/2407.12768","citing_paper":"/paper/2505.09512"},"observation_digest":"sha256:48beda66c313215514dd8ceb09a2e541c0e1273da0e6c4fc2a8d9a15d1073987","observation_id":"96778559-f0e0-4bc9-a09b-db1bf80ca44e","resolution":{"observed_at":"2026-05-22T15:41:45.297051Z","resolver_source":"arxiv_id","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":"2407.12768","last_updated":"2024-10-14T16:55:22Z","snapshot_observed_at":"2026-07-06T18:47:56.109836Z","submitted_at":"2024-07-17T17:48:39Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12768","snapshot_observed_at":"2026-08-07T13:35:50.117444Z","title":"Schuster, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21606","last_updated":"2026-05-30T19:34:36Z","snapshot_observed_at":"2026-08-07T13:24:38.192756Z","submitted_at":"2025-05-27T17:52:57Z","title":"Pauli Propagation: A Computational Framework for Simulating Quantum Systems","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:50.117444Z"},"links":{"cited_paper":"/paper/2407.12768","citing_paper":"/paper/2505.21606"},"observation_digest":"sha256:939cf2766d61f5e6d2196a0dd8b11402b334765d44945f4093dd26865acb0994","observation_id":"07b1d8b9-5fe8-46d6-b4e7-a1e61c7691ba","resolution":{"observed_at":"2026-08-07T13:35:50.117444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12768","last_updated":"2024-10-14T16:55:22Z","snapshot_observed_at":"2026-07-06T18:47:56.109836Z","submitted_at":"2024-07-17T17:48:39Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12768","snapshot_observed_at":"2026-08-07T11:18:07.223978Z","title":"A polynomial-time classical algorithm for noisy quantum circuits,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02970","last_updated":"2025-08-26T01:36:46Z","snapshot_observed_at":"2026-08-09T06:07:34.393921Z","submitted_at":"2025-06-03T15:06:01Z","title":"Integrals of motion as slow modes in dissipative many-body operator dynamics","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:07.223978Z"},"links":{"cited_paper":"/paper/2407.12768","citing_paper":"/paper/2506.02970"},"observation_digest":"sha256:e3eadf479fae2da044bb6fe0a61552d22139045e1ca451aaebb77c23e63f7cfa","observation_id":"c63939fa-a8aa-42d5-bccc-3a93f8847e2f","resolution":{"observed_at":"2026-08-07T11:18:07.223978Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12768","last_updated":"2024-10-14T16:55:22Z","snapshot_observed_at":"2026-07-06T18:47:56.109836Z","submitted_at":"2024-07-17T17:48:39Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12768","snapshot_observed_at":"2026-08-06T22:48:48.375084Z","title":"Schuster, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20658","last_updated":"2025-07-14T18:34:04Z","snapshot_observed_at":"2026-08-09T19:36:33.919415Z","submitted_at":"2025-06-25T17:53:35Z","title":"A Framework for Quantum Advantage","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-06T22:48:48.375084Z"},"links":{"cited_paper":"/paper/2407.12768","citing_paper":"/paper/2506.20658"},"observation_digest":"sha256:7157f28b89ec19752903df76a0cb517b7ce158e461fec16aa8e9b8f27b89a49a","observation_id":"3ae8ada1-b64b-473d-91ef-879115ddb919","resolution":{"observed_at":"2026-08-06T22:48:48.375084Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12768","last_updated":"2024-10-14T16:55:22Z","snapshot_observed_at":"2026-07-06T18:47:56.109836Z","submitted_at":"2024-07-17T17:48:39Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","version":2},"cited_work":{"arxiv_id":"2407.12768","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.12768","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","venue":null,"work_id":"4e55afdd-5b17-487d-afd8-04a7cf1a1315","year":2024},"citing_paper":{"arxiv_id":"2507.21883","last_updated":"2026-04-13T07:41:24Z","snapshot_observed_at":"2026-08-03T03:45:11.679264Z","submitted_at":"2025-07-29T14:56:17Z","title":"Sampling (noisy) quantum circuits through randomized rounding","version":3},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-05-19T02:38:52.049264Z"},"links":{"cited_paper":"/paper/2407.12768","citing_paper":"/paper/2507.21883"},"observation_digest":"sha256:41545134ee6a912298cefa09a319cd040764de4d1ea2ffe4c4e211fe4e71b8d2","observation_id":"a67731f9-b40d-4c56-b77a-1917484a26d2","resolution":{"observed_at":"2026-05-19T02:41:59.871430Z","resolver_source":"arxiv_id","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":"2407.12768","last_updated":"2024-10-14T16:55:22Z","snapshot_observed_at":"2026-07-06T18:47:56.109836Z","submitted_at":"2024-07-17T17:48:39Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12768","snapshot_observed_at":"2026-08-06T12:11:56.805641Z","title":"Schuster, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.22054","last_updated":"2026-06-04T14:44:11Z","snapshot_observed_at":"2026-08-06T12:11:54.626455Z","submitted_at":"2025-07-29T17:57:04Z","title":"Pitfalls when tackling the exponential concentration of parameterized quantum models","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T12:11:56.805641Z"},"links":{"cited_paper":"/paper/2407.12768","citing_paper":"/paper/2507.22054"},"observation_digest":"sha256:dcc8abf93e0f7df6f0fe9ecf490d5cfa6051ebfd6cd5b79c252b6899fcf36a8c","observation_id":"b205ca7c-7269-41fb-8bc2-11e6a05e150f","resolution":{"observed_at":"2026-08-06T12:11:56.805641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12768","last_updated":"2024-10-14T16:55:22Z","snapshot_observed_at":"2026-07-06T18:47:56.109836Z","submitted_at":"2024-07-17T17:48:39Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12768","snapshot_observed_at":"2026-08-04T11:01:09.281284Z","title":"Schuster, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.07396","last_updated":"2026-05-28T21:14:00Z","snapshot_observed_at":"2026-08-08T11:49:39.116792Z","submitted_at":"2025-10-08T18:00:13Z","title":"Spectral properties and coding transitions of Haar-random quantum codes","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T11:01:09.281284Z"},"links":{"cited_paper":"/paper/2407.12768","citing_paper":"/paper/2510.07396"},"observation_digest":"sha256:4a9a2479adcd1791551d5bf9a19d1d5c7f026a7909d57cc439a3fc8163e3c6a6","observation_id":"dbacc578-6f09-454e-9990-bf43fd1cf32f","resolution":{"observed_at":"2026-08-04T11:01:09.281284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12768","last_updated":"2024-10-14T16:55:22Z","snapshot_observed_at":"2026-07-06T18:47:56.109836Z","submitted_at":"2024-07-17T17:48:39Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","version":2},"cited_work":{"arxiv_id":"2407.12768","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.12768","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","venue":null,"work_id":"4e55afdd-5b17-487d-afd8-04a7cf1a1315","year":2024},"citing_paper":{"arxiv_id":"2510.19928","last_updated":"2026-05-21T06:22:22Z","snapshot_observed_at":"2026-07-06T22:33:48.680749Z","submitted_at":"2025-10-22T18:00:19Z","title":"Mind the gaps: The fraught road to quantum advantage","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-18T01:51:39.522057Z"},"links":{"cited_paper":"/paper/2407.12768","citing_paper":"/paper/2510.19928"},"observation_digest":"sha256:1a6b611ed6900737949ae5d671822745f32bba68c703a136baeffa82d49efa11","observation_id":"918352b4-4b70-4d3c-815d-c76bd9481a19","resolution":{"observed_at":"2026-05-18T01:51:39.671410Z","resolver_source":"arxiv_id","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":"2407.12768","last_updated":"2024-10-14T16:55:22Z","snapshot_observed_at":"2026-07-06T18:47:56.109836Z","submitted_at":"2024-07-17T17:48:39Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","version":2},"cited_work":{"arxiv_id":"2407.12768","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.12768","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","venue":null,"work_id":"4e55afdd-5b17-487d-afd8-04a7cf1a1315","year":2024},"citing_paper":{"arxiv_id":"2510.19928","last_updated":"2026-05-21T06:22:22Z","snapshot_observed_at":"2026-07-06T22:33:48.680749Z","submitted_at":"2025-10-22T18:00:19Z","title":"Mind the gaps: The fraught road to quantum advantage","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-22T13:08:57.425184Z"},"links":{"cited_paper":"/paper/2407.12768","citing_paper":"/paper/2510.19928"},"observation_digest":"sha256:9e471497b11232ac7dff41b3ebd417f7fd0ba3f5bfdaea52eb6e7f2527af4cbe","observation_id":"38c7e31d-bca9-4493-82a9-de8f62314101","resolution":{"observed_at":"2026-05-22T13:11:34.832640Z","resolver_source":"arxiv_id","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":"2407.12768","last_updated":"2024-10-14T16:55:22Z","snapshot_observed_at":"2026-07-06T18:47:56.109836Z","submitted_at":"2024-07-17T17:48:39Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12768","snapshot_observed_at":"2026-08-04T08:14:57.241317Z","title":"Schuster, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.22311","last_updated":"2026-06-02T07:11:23Z","snapshot_observed_at":"2026-08-05T09:15:30.422078Z","submitted_at":"2025-10-25T14:24:12Z","title":"Characterizing Pauli Propagation via Operator Complexity","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T08:14:57.241317Z"},"links":{"cited_paper":"/paper/2407.12768","citing_paper":"/paper/2510.22311"},"observation_digest":"sha256:e810127aba9779bd34898689216c2b2992672b204276168f90afd9d69aeb5f3d","observation_id":"8472e74d-153c-4ef1-acb7-af2a5e6f9f44","resolution":{"observed_at":"2026-08-04T08:14:57.241317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12768","last_updated":"2024-10-14T16:55:22Z","snapshot_observed_at":"2026-07-06T18:47:56.109836Z","submitted_at":"2024-07-17T17:48:39Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12768","snapshot_observed_at":"2026-08-03T13:37:56.872581Z","title":"Schuster, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.23810","last_updated":"2026-06-22T18:00:08Z","snapshot_observed_at":"2026-08-09T03:35:53.044396Z","submitted_at":"2025-12-29T19:10:11Z","title":"Syndrome aware mitigation of logical errors","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-03T13:37:56.872581Z"},"links":{"cited_paper":"/paper/2407.12768","citing_paper":"/paper/2512.23810"},"observation_digest":"sha256:916e949529e342ee5ae0f474e474033cce7f4fe319f121f4eec3be5034adee3a","observation_id":"f6dcb41f-283e-4a45-af1d-90b8b461d2b1","resolution":{"observed_at":"2026-08-03T13:37:56.872581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12768","last_updated":"2024-10-14T16:55:22Z","snapshot_observed_at":"2026-07-06T18:47:56.109836Z","submitted_at":"2024-07-17T17:48:39Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","version":2},"cited_work":{"arxiv_id":"2407.12768","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.12768","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","venue":null,"work_id":"4e55afdd-5b17-487d-afd8-04a7cf1a1315","year":2024},"citing_paper":{"arxiv_id":"2604.19889","last_updated":"2026-04-21T18:11:19Z","snapshot_observed_at":"2026-08-07T23:02:30.728311Z","submitted_at":"2026-04-21T18:11:19Z","title":"Quantum-to-Classical Computability Transition via Negative Markov Chains","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-10T02:30:01.593171Z"},"links":{"cited_paper":"/paper/2407.12768","citing_paper":"/paper/2604.19889"},"observation_digest":"sha256:acb5bc91c678cf9fb55de6f6d0604d49d1a6396b5c1fb7960f1dcd7accf3a372","observation_id":"85f2ad64-70ac-4b8a-b01a-735fc26b11ff","resolution":{"observed_at":"2026-05-11T13:01:04.594670Z","resolver_source":"arxiv_id","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":"2407.12768","last_updated":"2024-10-14T16:55:22Z","snapshot_observed_at":"2026-07-06T18:47:56.109836Z","submitted_at":"2024-07-17T17:48:39Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","version":2},"cited_work":{"arxiv_id":"2407.12768","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.12768","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","venue":null,"work_id":"4e55afdd-5b17-487d-afd8-04a7cf1a1315","year":2024},"citing_paper":{"arxiv_id":"2604.27074","last_updated":"2026-04-29T18:06:34Z","snapshot_observed_at":"2026-08-04T00:21:22.045695Z","submitted_at":"2026-04-29T18:06:34Z","title":"Long-lived local quantum coherences from hydrodynamic large deviations","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-07T09:22:34.041537Z"},"links":{"cited_paper":"/paper/2407.12768","citing_paper":"/paper/2604.27074"},"observation_digest":"sha256:d4948e4929b2c80a3a89502325b829e7acdbd3fe240f15529997d6e600375d6b","observation_id":"8e5465d2-9088-4f53-b714-4582d5d40a07","resolution":{"observed_at":"2026-05-12T09:46:26.808876Z","resolver_source":"arxiv_id","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":"2407.12768","last_updated":"2024-10-14T16:55:22Z","snapshot_observed_at":"2026-07-06T18:47:56.109836Z","submitted_at":"2024-07-17T17:48:39Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12768","snapshot_observed_at":"2026-07-14T12:20:29.380042Z","title":"Yao , title =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10360","last_updated":"2026-07-11T15:38:24Z","snapshot_observed_at":"2026-08-07T14:58:55.544692Z","submitted_at":"2026-07-11T15:38:24Z","title":"Gram-Certified Resource Continuation for Structured Quantum Representation Audits","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-14T12:20:29.380042Z"},"links":{"cited_paper":"/paper/2407.12768","citing_paper":"/paper/2607.10360"},"observation_digest":"sha256:daf6741b04777868bacb73c1100107c53d3f19883db60ec82791a3c0b469d676","observation_id":"575f0ede-b030-463b-ae4a-ccffb24390e5","resolution":{"observed_at":"2026-07-14T12:20:29.380042Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2407.12768/citation-record","integrity":"/paper/2407.12768/integrity","json":"/paper/2407.12768/citation-record.json","paper":"/paper/2407.12768"},"outbound":[],"paper":{"arxiv_id":"2407.12768","last_updated":"2024-10-14T16:55:22Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T18:47:56.109836Z","submitted_at":"2024-07-17T17:48:39Z","title":"A polynomial-time classical algorithm for noisy quantum circuits"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 16 inbound Pith citation observations for arXiv:2407.12768."}