{"as_of":"2026-08-04T02:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a29e145ce04e1cf48276daae0489ddd10c52f8a475415373532d7a9ad3f685ac","coverage":[{"denominator":87,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":87,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T08:07:58.802765Z","state":"measured"},{"denominator":87,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":87,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-03T06:30:56.289259+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/2607.08396/citation-record","integrity":"/paper/2607.08396/integrity","json":"/paper/2607.08396/citation-record.json","paper":"/paper/2607.08396"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T08:16:59.539833Z","title":null,"venue":null,"work_id":"d1acf21c-1010-4951-a2bb-6026ba0440af","year":null},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:1bfdb83e61ea0ef8aaa2177876f074fad040578309f53febfee9e17f9ebfe85a","observation_id":"ff9fa55d-2c24-4fa4-947b-58f5d61780a0","resolution":{"observed_at":"2026-07-10T08:16:59.542865Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.545420Z","title":"Vertices corresponding to rows are colored blue, and vertices corresponding to columns are colored red","venue":null,"work_id":"690e1448-6c88-4d7a-9c0e-6ff7172ab2f3","year":null},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:eb6208829c8da3a1546d7821f26ac18ffa1190fb6e21de032f3f7bdd866de592","observation_id":"8fe0ee1e-17b3-4154-9bcf-7322a9aebc49","resolution":{"observed_at":"2026-07-10T08:16:59.546827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.543413Z","title":null,"venue":null,"work_id":"ce76c2a5-a7d5-49a4-aa50-06f85b555e7c","year":null},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:b4c5cd75a68242f8969c3b14dab42f5290972bf0274a9b9d9d05c98873baebea","observation_id":"f689936c-b809-4979-975e-0607214759a5","resolution":{"observed_at":"2026-07-10T08:16:59.544781Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.547378Z","title":null,"venue":null,"work_id":"42344fdd-d837-4264-a148-ac220e3d5f67","year":null},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:a6d18f886b85b2aaecc3a3c8a283f925e0ef091f6b51068b50ed8b0209ea3b34","observation_id":"dff41d0a-a2ff-4c3f-9595-b96caa7844d9","resolution":{"observed_at":"2026-07-10T08:16:59.548806Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.561601Z","title":null,"venue":null,"work_id":"774b0e37-2448-4bf1-9df7-19b2d1499f97","year":null},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:07bf2c746300b4853c6a4a7bf17c7e141e0985cb501dcdac2b43bfdadf04ce36","observation_id":"4dd80fd6-95ba-4f07-8024-967f646bdae0","resolution":{"observed_at":"2026-07-10T08:16:59.562926Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.521191Z","title":"This method allows us to find automorphisms of large codes in a short amount of time and study their logi- cal gates efficiently","venue":null,"work_id":"0d0a89e4-d90d-4664-a35e-0dcdd053638d","year":null},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:e03be3ecb1f9ec8614886c25def90854e1685a85c5fc3d0cace14a9ecdff65e9","observation_id":"2e7338ed-25e4-4ef1-ab1f-2c1df30ba947","resolution":{"observed_at":"2026-07-10T08:16:59.522754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.526480Z","title":"We choose the logical basis ¯X1 =X 1X2, ¯Z1 =Z 1Z3, ¯X2 =X 1X3, ¯Z2 =Z 1Z2.(7) Figure 2 shows the square geometry and the bipartition underlying this choice of logical basis","venue":null,"work_id":"42950e5e-a122-4d3b-bafc-ab0596a9396c","year":null},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:ea369e1511636339311734a6a765a2c7d34f835bafec7171059997642e377f0f","observation_id":"59ea6d2b-1f66-4127-ab7f-f068cb7f64b7","resolution":{"observed_at":"2026-07-10T08:16:59.528095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.516925Z","title":"QEC Readout Testbed","venue":null,"work_id":"766a9f3f-3a8d-4c64-b7c5-16537d75aaec","year":2000},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:7c25c4982b421d0ad66822ab845b54666428d190d58e1831903f41a0f9e2e0ce","observation_id":"194113b5-2bc2-4246-92e6-70c3857d92e1","resolution":{"observed_at":"2026-07-10T08:16:59.518526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.592403Z","title":null,"venue":null,"work_id":"105bd479-50c4-449e-b1c3-08e159823c33","year":2022},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:f005b7ceb9eb6a18e8513e345556b637ce3809031687eff04e2dd59eb22b8726","observation_id":"facabcaf-78bc-437c-85b9-7a86543f6b02","resolution":{"observed_at":"2026-07-10T08:26:59.593468Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.09901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T08:16:58.908353Z","title":"Hangleiter, Has quantum advantage been achieved? (2026)","venue":null,"work_id":"727533fa-96ee-4ccf-964f-7a00aeacec99","year":2026},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:cc322dd959a7b5502f0d49221981ccfe4c86318b736d35d45f2a42a3e51cb031","observation_id":"a50f2c2f-ea1a-4e08-927b-2b6b9d3d94ec","resolution":{"observed_at":"2026-07-10T08:16:58.910096Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9807006","last_updated":"1998-07-01T19:34:39Z","snapshot_observed_at":"2026-07-07T07:27:58.465159Z","submitted_at":"1998-07-01T19:34:39Z","title":"The Heisenberg Representation of Quantum Computers","version":1},"cited_work":{"arxiv_id":"quant-ph/9807006","doi":"10.48550/arxiv.quant-ph/9807006","metadata_source":"pith","pith_arxiv_id":"quant-ph/9807006","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"The Heisenberg Representation of Quantum Computers","venue":"quant-ph","work_id":"64ad356b-b16b-40e9-8055-ea3eb48cb88f","year":1998},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/quant-ph/9807006","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:a7e687496c775152fc791ab5b037ee5af88b49355ec1e13ead0ee7be0c0b2513","observation_id":"47f6090a-2d85-4396-b172-d4cefc0ef9b3","resolution":{"observed_at":"2026-07-10T08:16:58.916175Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-07-17T19:50:54.865069+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:50:54.865069+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0406196","last_updated":"2008-06-18T19:36:18Z","snapshot_observed_at":"2026-07-30T18:49:59.479815Z","submitted_at":"2004-06-25T17:57:42Z","title":"Improved Simulation of Stabilizer Circuits","version":5},"cited_work":{"arxiv_id":"quant-ph/0406196","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0406196","snapshot_observed_at":"2026-07-10T08:16:58.922513Z","title":"Improved Simulation of Stabilizer Circuits","venue":"quant-ph","work_id":"01280529-5bec-4e0d-89e1-9188adf97e89","year":2004},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/quant-ph/0406196","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:70e7eccaceed2f9668dcf2b1373bd75c51fddd881b962cf827df0612f6d34f43","observation_id":"ba5693a5-bd94-4754-9e17-e27b6d7fa4b3","resolution":{"observed_at":"2026-07-10T08:16:58.923780Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.590898Z","title":null,"venue":null,"work_id":"ec8adb8b-8591-4b3c-803d-43577537ef45","year":2002},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:91c120eda7ace8435200d24947408fc0a88b857a307d80b68926db2b62675484","observation_id":"35b0fac2-f810-4c1e-b7ba-8a6712821e35","resolution":{"observed_at":"2026-07-10T08:26:59.591883Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.594068Z","title":"Jozsa and A","venue":null,"work_id":"1b08762e-28ca-48a7-bc01-9b67e5bafe9b","year":2008},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:867cadf47892dbf97a21a91a19944e3a18f597e6c94afc7f01ffa5fcd28e6bac","observation_id":"1718f6d4-c76e-4bca-bb92-c9228bd20515","resolution":{"observed_at":"2026-07-10T08:26:59.595134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.595698Z","title":null,"venue":null,"work_id":"d609d928-8d7e-44b9-8b36-3a8207b30d51","year":2002},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:5998ae9a6b7bce038a6734a343b0a1fa525fca86536c62d62b205ebb45fd0fd0","observation_id":"617030fe-b696-4f5d-8df1-0b89408e0d03","resolution":{"observed_at":"2026-07-10T08:26:59.596797Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1311.3046","last_updated":"2015-08-16T06:34:41Z","snapshot_observed_at":"2026-07-06T03:28:03.012593Z","submitted_at":"2013-11-13T08:18:16Z","title":"Jordan-Wigner formalism for arbitrary 2-input 2-output matchgates and their classical simulation","version":3},"cited_work":{"arxiv_id":"1311.3046","doi":null,"metadata_source":"pith","pith_arxiv_id":"1311.3046","snapshot_observed_at":"2026-07-10T08:16:58.861235Z","title":"Jordan-Wigner formalism for arbitrary 2-input 2-output matchgates and their classical simulation","venue":"quant-ph","work_id":"244f95ad-f1ae-4ae7-8ee7-57ccf6478196","year":2013},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/1311.3046","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:0db64c8318577c7759e029a9cf1a9a7e9a943f486e7efbe6f56033697bf0e0ce","observation_id":"6da55b57-afc5-4ed0-912c-4ad52c944d6e","resolution":{"observed_at":"2026-07-10T08:16:58.862533Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0301063","last_updated":"2003-02-26T03:05:05Z","snapshot_observed_at":"2026-07-07T07:11:35.292783Z","submitted_at":"2003-01-15T04:35:35Z","title":"Efficient classical simulation of slightly entangled quantum computations","version":2},"cited_work":{"arxiv_id":"quant-ph/0301063","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0301063","snapshot_observed_at":"2026-07-10T08:16:58.905514Z","title":"Efficient classical simulation of slightly entangled quantum computations","venue":"quant-ph","work_id":"2e63f103-5980-4200-a67b-83dd30ea0fb9","year":2003},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/quant-ph/0301063","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:33ae322ff2e63771abc97fa702e53280849f1dc60ce324d27af3725975e24af3","observation_id":"f301c9c1-7862-4d5e-9b65-1c944d6deba2","resolution":{"observed_at":"2026-07-10T08:16:58.907092Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1008.3477","last_updated":"2011-01-03T17:31:29Z","snapshot_observed_at":"2026-07-06T02:14:20.602734Z","submitted_at":"2010-08-20T11:49:19Z","title":"The density-matrix renormalization group in the age of matrix product states","version":2},"cited_work":{"arxiv_id":"1008.3477","doi":"10.1103/physreva.82.063816","metadata_source":"pith","pith_arxiv_id":"1008.3477","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"The density-matrix renormalization group in the age of matrix product states","venue":"cond-mat.str-el","work_id":"e3cbdff6-1438-4f54-a794-fb01b39dae30","year":2010},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/1008.3477","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:9925cf6562aa587c429079a7c40e4ada7c2d9a3c0620cf72fb107b87c40f1541","observation_id":"cee2e19e-5ce3-45fd-a79e-515a5d4e6882","resolution":{"observed_at":"2026-07-10T08:16:58.918616Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.599014Z","title":null,"venue":null,"work_id":"8ea0d456-1548-4d86-bfea-44452bf25360","year":2023},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:25a511a6b62cd5b371573802a32d01243e70a2d1a63bbf31dd681b50beadecc7","observation_id":"279cfd0b-7707-4766-9ae9-0fdf070a9b6a","resolution":{"observed_at":"2026-07-10T08:26:59.600087Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.602482Z","title":"Bravyi and D","venue":null,"work_id":"7b7460ba-c6a0-4666-844f-fe85a7259324","year":2016},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:b66633ef1f631a21f33cb3c9f0415d614ce80d3eddf3035dc701a151f81b650f","observation_id":"bfd11d89-a869-4269-af85-f08f0fe4b73f","resolution":{"observed_at":"2026-07-10T08:26:59.603596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.610756Z","title":"Bravyi, D","venue":null,"work_id":"8b925d63-b480-44ca-97d7-92421acb06dd","year":2019},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:6e68cb6e9558af07ed9db14f274556bc95c43d51d28d5e97ef7b88d0dfb01e4a","observation_id":"17ba57a3-51cd-443d-8144-7c71aae81999","resolution":{"observed_at":"2026-07-10T08:26:59.611974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.02654","last_updated":"2024-06-16T23:35:00Z","snapshot_observed_at":"2026-08-02T19:45:28.185858Z","submitted_at":"2023-02-06T09:50:16Z","title":"Extending Matchgate Simulation Methods to Universal Quantum Circuits","version":2},"cited_work":{"arxiv_id":"2302.02654","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.02654","snapshot_observed_at":"2026-07-10T08:16:58.919781Z","title":"Extending Matchgate Simulation Methods to Universal Quantum Circuits","venue":"quant-ph","work_id":"f75b95f6-87ec-4fbb-92f2-7bd9442574d4","year":2023},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/2302.02654","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:ca78e9029b9e9d0797ce74e8bd078131031f11979a89151c634632773fb38158","observation_id":"6137cd6b-f246-48c5-9d00-cddc4cb527fc","resolution":{"observed_at":"2026-07-10T08:16:58.921071Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.19317","last_updated":"2025-04-27T17:42:39Z","snapshot_observed_at":"2026-07-06T21:15:25.985791Z","submitted_at":"2025-04-27T17:42:39Z","title":"Classical simulation of parity-preserving quantum circuits","version":1},"cited_work":{"arxiv_id":"2504.19317","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.19317","snapshot_observed_at":"2026-07-10T08:16:58.912055Z","title":"Classical simulation of parity-preserving quantum circuits","venue":"quant-ph","work_id":"ba83cc86-59d8-4db0-8fca-62a1ea64b4d4","year":2025},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/2504.19317","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:887ff1a1f4eef91214fe4c2e29b932e6ffac7af529453400a61e333f034a20e1","observation_id":"91888799-a587-4cc6-8d68-b1df5a1f01cb","resolution":{"observed_at":"2026-07-10T08:16:58.913455Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.549374Z","title":null,"venue":null,"work_id":"39c14294-4d58-4f0a-9813-a8ce17f7aadb","year":1996},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:1d4c4ee9025cf202ba2675ecac19760c6920d75c55235a5ad237cc65a992ff3e","observation_id":"1abad3cb-6be3-4c02-bb4a-824e2fdb7486","resolution":{"observed_at":"2026-07-10T08:16:59.550860Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.551651Z","title":null,"venue":null,"work_id":"5b2f7037-c19d-4400-a0c5-faadc3a5dd20","year":1996},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:6386b9c213f8270cd9bb9c28b3e4c48da7ce433627afdf4c938388bd7df290b6","observation_id":"850d7c43-13b0-4b56-b7f1-65c24e495be6","resolution":{"observed_at":"2026-07-10T08:16:59.554875Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.537997Z","title":"Calderbank, E","venue":null,"work_id":"a997d82d-695b-46d1-a955-e7c75bb9206f","year":1998},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:3884814464e4c7a4f4c3ee01f5c0410c153b38c1ae78a48e62c3a899bf8a3550","observation_id":"007e80ed-4e61-405f-bfc7-0fbfc5bc97a3","resolution":{"observed_at":"2026-07-10T08:16:59.539221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.597375Z","title":"Grassl and M","venue":null,"work_id":"a5deef78-701d-42c9-8a15-953266c01e88","year":2013},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:62b05c8f1e4e0ee2e02cad629ec5641ff086e597b21564a76a831859f1bcc977","observation_id":"85ab4dae-756c-4c89-94b2-c84c7ebd41a3","resolution":{"observed_at":"2026-07-10T08:26:59.598447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.510696Z","title":"Sayginel, S","venue":null,"work_id":"14eec9ce-a59d-4050-a606-c33f555737d0","year":2025},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:c7db01aca68e5c4bfd9751ec93ed94546844e54a44416da87804c3bb84f56dbb","observation_id":"9dc0600e-1e6c-4185-b6c7-c09957a37489","resolution":{"observed_at":"2026-07-10T08:16:59.511896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.507014Z","title":null,"venue":null,"work_id":"cdb6eb26-146c-4cbc-897c-059d5966e053","year":2017},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:0c447cd92a73c63f71cbfc93bacb8718b344c10fd1e21cfb973be4866db23d64","observation_id":"fe02e2ae-d2f5-42a3-8cbb-ac59efb4002c","resolution":{"observed_at":"2026-07-10T08:16:59.508416Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.563531Z","title":null,"venue":null,"work_id":"0ede76f9-7791-47c6-82fd-52806c481930","year":2023},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:30c8cb351e9e7f889911382ffcf956e1742c86a543054350e21e5830a25eb7c1","observation_id":"cc9dfc1a-65c4-4cc7-84a0-b97d9bce62b1","resolution":{"observed_at":"2026-07-10T08:16:59.564804Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.604173Z","title":null,"venue":null,"work_id":"fa5db1a3-4de6-4b27-a7d8-d11d908ffd70","year":2025},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:215a61e42607f98b7cad4062adb519257ab5e36bf93902cd85b208d63a22dbe1","observation_id":"02ad4ef0-3610-4f06-a67e-bb68d0870d1c","resolution":{"observed_at":"2026-07-10T08:26:59.605221Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0811.4262","last_updated":"2009-07-09T22:52:52Z","snapshot_observed_at":"2026-07-06T01:51:37.939453Z","submitted_at":"2008-11-26T10:09:31Z","title":"Restrictions on Transversal Encoded Quantum Gate Sets","version":2},"cited_work":{"arxiv_id":"0811.4262","doi":null,"metadata_source":"pith","pith_arxiv_id":"0811.4262","snapshot_observed_at":"2026-07-10T08:16:58.900443Z","title":"Restrictions on Transversal Encoded Quantum Gate Sets","venue":"quant-ph","work_id":"9ce5bdb8-bc58-4645-bc2d-0f51c08e36ad","year":2008},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/0811.4262","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:c8a4acceae42a3fc91ef6aa4951180262c94d73c4c8099f1bdbda7bf0fc36348","observation_id":"7bc7cc01-fdd3-433f-8c24-b5b578afcf6b","resolution":{"observed_at":"2026-07-10T08:16:58.901710Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.14066","last_updated":"2022-10-25T14:47:29Z","snapshot_observed_at":"2026-08-01T16:52:03.947829Z","submitted_at":"2022-10-25T14:47:29Z","title":"The Smallest Code with Transversal T","version":1},"cited_work":{"arxiv_id":"2210.14066","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.14066","snapshot_observed_at":"2026-07-10T08:16:58.874324Z","title":"The smallest code with transversal t","venue":"quant-ph","work_id":"2000f895-bd6a-4a13-8c94-b4c3cdc79869","year":2022},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/2210.14066","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:7bb775a404987a84131f08ca5acbd4af0baa077c9a5895f3a078e4d5036fc249","observation_id":"874eec50-faf9-4a1b-b8b6-3465cfceb4f9","resolution":{"observed_at":"2026-07-10T08:16:58.875970Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.565911Z","title":"Deger, PhasePoly.jl: Fast exact simulation of mono- mial quantum circuits via phase polynomials,https: 20 //github.com/aydindeger/PhasePoly.jl(2026), julia package, version 0.1.0","venue":null,"work_id":"7087a087-0eeb-4028-a006-13d5071abf41","year":2026},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:03707585236eb4fd455ddc1879761f894bea32b22642da807d8df3b3c2046cf8","observation_id":"282f7b96-91ba-42fe-9d45-85acbbe97378","resolution":{"observed_at":"2026-07-10T08:16:59.567974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1607.08473","last_updated":"2016-07-28T14:24:41Z","snapshot_observed_at":"2026-08-02T04:02:09.353795Z","submitted_at":"2016-07-28T14:24:41Z","title":"Quantum circuits and low-degree polynomials over F_2","version":1},"cited_work":{"arxiv_id":"1607.08473","doi":null,"metadata_source":"pith","pith_arxiv_id":"1607.08473","snapshot_observed_at":"2026-07-10T08:16:58.892638Z","title":"Quantum circuits and low-degree polynomials over F_2","venue":"quant-ph","work_id":"aaec739a-236e-4723-b075-6e5516e83879","year":2016},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/1607.08473","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:62c39c1f0fb05539c4b56f8c504150cdccd50fe606b790289fab7e869f2269b1","observation_id":"cbcf556e-bc1b-4b6c-b906-09bb3567ac29","resolution":{"observed_at":"2026-07-10T08:16:58.893918Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03211","last_updated":"2024-02-05T17:22:41Z","snapshot_observed_at":"2026-07-06T17:25:35.493362Z","submitted_at":"2024-02-05T17:22:41Z","title":"Fast classical simulation of Harvard/QuEra IQP circuits","version":1},"cited_work":{"arxiv_id":"2402.03211","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.03211","snapshot_observed_at":"2026-07-10T08:16:58.879808Z","title":"Maslov, S","venue":"quant-ph","work_id":"232e08f0-f8f0-400a-bdc8-314750b23aeb","year":2024},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/2402.03211","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:ea68be3db75d5a38ecce1d3792fed26f4f90fe19a7db12d4e6f7ef1aa5844bfa","observation_id":"61724ecf-a77e-445e-ae61-0a91e41b0dae","resolution":{"observed_at":"2026-07-10T08:16:58.881034Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.586151Z","title":null,"venue":null,"work_id":"73f3fd9c-6d63-416d-92fd-13d3e6c0f185","year":2015},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:1ca85c7d1b3187662e1f4a4d5ee90a6091f7c78b8e25958577a3b1bbadef4f9e","observation_id":"f0fc6b84-e22e-4b3f-aefb-608dd5c9dc9a","resolution":{"observed_at":"2026-07-10T08:26:59.587183Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.589324Z","title":null,"venue":null,"work_id":"654a4f07-2fc9-494c-942a-5b6d67e128ac","year":2014},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:7883910ff448fde4f4f432ced2919c5105efd59f80a7d4ed4ce0eceb2f307271","observation_id":"7237a217-9883-4884-807d-f6cf2c35b3ce","resolution":{"observed_at":"2026-07-10T08:26:59.590356Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1109.3195","last_updated":"2012-03-24T13:56:09Z","snapshot_observed_at":"2026-07-06T02:34:02.604905Z","submitted_at":"2011-09-14T20:01:02Z","title":"Efficient Quantum Polar Coding","version":2},"cited_work":{"arxiv_id":"1109.3195","doi":null,"metadata_source":"pith","pith_arxiv_id":"1109.3195","snapshot_observed_at":"2026-07-10T08:16:58.863885Z","title":"Efficient Quantum Polar Coding","venue":"quant-ph","work_id":"ba511c98-2e96-4168-a8f4-c2b104ff2c0f","year":2011},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/1109.3195","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:e7deb4ed140212cb42dd3daaab24f94d12a1272be2c6fa47c9f388514936ede1","observation_id":"6e8336b8-e5fe-4767-be5d-6ca401c4abbb","resolution":{"observed_at":"2026-07-10T08:16:58.865041Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.579672Z","title":null,"venue":null,"work_id":"f279b306-9fa3-43dd-b5ba-c60c1de6dc14","year":2018},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:65463788612a26b649912d453bf2829ec5bb1c6246819f343cb460394581dc30","observation_id":"e1530759-64fd-4e3b-aaa0-de2cce10683c","resolution":{"observed_at":"2026-07-10T08:26:59.580779Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.581368Z","title":"Matos, A","venue":null,"work_id":"27b195e7-ba8f-46ad-b6ec-6b497b7190c9","year":2021},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:d82215a07faa8011807281c13311c2a0bccadf0fe8f453c8d042e08b0e1aba06","observation_id":"831b052a-7e5e-4e0a-b4d4-6517e7f01d54","resolution":{"observed_at":"2026-07-10T08:26:59.582454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.582998Z","title":"Deger, A","venue":null,"work_id":"c212d814-18f6-4699-ba21-65bf7cd4b7e8","year":2023},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:704b144681aa53d383dcade6ae2ac9de69797d35179f5c50e28a324da5737f55","observation_id":"2f1e68e3-9c31-40b0-86df-0858b4fd78be","resolution":{"observed_at":"2026-07-10T08:26:59.584041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.584576Z","title":"Leone, S","venue":null,"work_id":"e589ea0e-7b54-4512-a1af-3f503bc91fc2","year":2022},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:cf2cd23db6f3f4813f9cf26d8689954f7357c2672f5b3bb942e5d6aa433cb2ad","observation_id":"c7925fc4-0db1-4256-b95f-0dbb26a188ba","resolution":{"observed_at":"2026-07-10T08:26:59.585580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.587745Z","title":null,"venue":null,"work_id":"530ed813-83f3-4edf-bfa1-b6f08420b6be","year":2011},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:1c92528f8421d53b823a48deae8fbd99f41d2d1fb3ebda77af39c8a2fdd567c3","observation_id":"e1bdfec9-1e15-4496-929f-6482148de5ca","resolution":{"observed_at":"2026-07-10T08:26:59.588786Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.607496Z","title":"Lami and M","venue":null,"work_id":"801785d5-2c67-4c6b-8505-11dd35889375","year":2023},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:2f3d23b61c70e351ac461311c4c9ec1defd1352614c9ac2850c6b11833e016a7","observation_id":"d9305c49-d79e-42fd-952c-80432e3c7d55","resolution":{"observed_at":"2026-07-10T08:26:59.608533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.569744Z","title":"Almheiri, X","venue":null,"work_id":"aa18a03e-a447-44d6-9871-d27ebc85e7fb","year":2015},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:8806c7d0e1f08f2c518a274332e5eb918c34acc8da483e97c051658d78123685","observation_id":"5b2151b9-f0e9-48bf-8382-66223bda9534","resolution":{"observed_at":"2026-07-10T08:26:59.570828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.566558Z","title":"Pastawski, B","venue":null,"work_id":"626f11be-1982-4d43-888c-a7db8446350a","year":2015},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:03d0ee988a0aebd830132b5637fae40df25feeced6e44b6ac5d55ed21fb638c1","observation_id":"da2c0588-65e0-447c-8891-9a8429495003","resolution":{"observed_at":"2026-07-10T08:26:59.567585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.568122Z","title":"Dehaene and B","venue":null,"work_id":"8b82f6d2-1346-4c8d-b8c5-a0b88d146bf9","year":2003},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:8056681c6e4ac0c8a94f44f3b71a75ee0c5904af2b615917c5391568b364f491","observation_id":"f9f56566-bfe6-44f2-bc32-8cd955d8c953","resolution":{"observed_at":"2026-07-10T08:26:59.569162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.571368Z","title":"Gottesman and I","venue":null,"work_id":"bb5c6877-dc60-43bd-9579-d87e3e031c94","year":1999},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:0c8d41945e075cbc8f66df6675c658f1f1e79f345ec36ede588de32b00649bad","observation_id":"3585117f-e30b-433f-bddc-aa15a2fa0fee","resolution":{"observed_at":"2026-07-10T08:26:59.572458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.573004Z","title":"Bravyi and A","venue":null,"work_id":"f6c91c7e-a2ac-4495-bd60-ac0cbe107b88","year":2005},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:60ec04cffdd37bc627d4e8f0f1331fa52e508a55581ce9588ada564b01d2946d","observation_id":"253dae38-a04e-4e52-b4b3-363192561193","resolution":{"observed_at":"2026-07-10T08:26:59.574101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.576439Z","title":"Raussendorf, D","venue":null,"work_id":"50d065fe-4b5f-4b7c-80ba-1f61a0cc72c3","year":2003},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:81b27c5752e64c8e103150c0d91b6b09c0d2b6e407ee6373861c2d15487338df","observation_id":"36f1de03-fa32-47e5-a9c6-a76468b6242b","resolution":{"observed_at":"2026-07-10T08:26:59.577566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.564955Z","title":"Hebenstreit, R","venue":null,"work_id":"5c0e1638-21c3-4069-bb32-d43c4f9db170","year":2019},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:522ac52147c5734f70abdd7d88cd3f3acfb6362f27a96cb4acdd65d2c12228a9","observation_id":"95274c97-bf9a-4b29-bf3b-b14e899a0135","resolution":{"observed_at":"2026-07-10T08:26:59.566031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.563287Z","title":"Dias and R","venue":null,"work_id":"b674ed06-b7b8-4243-aca6-57ddb2c445b9","year":2024},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:d1984a1e10c2743274147756ce6e6136ea1d6c076c8f37549ddecfa92946a54a","observation_id":"40e0ff81-7520-4c18-b7d5-08b6264859b9","resolution":{"observed_at":"2026-07-10T08:26:59.564406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.26813","last_updated":"2026-05-12T01:04:12Z","snapshot_observed_at":"2026-07-06T23:12:24.456023Z","submitted_at":"2026-04-29T15:42:59Z","title":"Classical simulation of free-fermionic dynamics and quantum chemistry with magic input","version":2},"cited_work":{"arxiv_id":"2604.26813","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.26813","snapshot_observed_at":"2026-07-10T08:16:58.877173Z","title":"Classical simulation of free-fermionic dynamics and quantum chemistry with magic input","venue":"quant-ph","work_id":"02efc2a5-75ac-4b02-bb9b-af75dd5337a6","year":2026},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/2604.26813","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:3384156948399e6f689e683c9636f7c8c1c8d43645fc1ee1e5bdda3c454e9af5","observation_id":"0e317efa-b011-43c7-9ea3-9ca2e8967da4","resolution":{"observed_at":"2026-07-10T08:16:58.878536Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9705052","last_updated":"1997-05-28T23:51:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"1997-05-28T23:51:29Z","title":"Stabilizer Codes and Quantum Error Correction","version":1},"cited_work":{"arxiv_id":"quant-ph/9705052","doi":"10.48550/arxiv.quant-ph/9705052","metadata_source":"pith","pith_arxiv_id":"quant-ph/9705052","snapshot_observed_at":"2026-07-10T23:37:44.929606Z","title":"Stabilizer Codes and Quantum Error Correction","venue":"quant-ph","work_id":"8dffbb8a-b91b-45a6-98ea-5fdf60573717","year":1997},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/quant-ph/9705052","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:e769ff4ca74095a655dead57b673b8280f1993207fcfafac869fddb2fe8466bb","observation_id":"effafff1-81c1-4dec-8d9e-7ad8b882b95d","resolution":{"observed_at":"2026-07-10T08:16:58.904098Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-07-13T23:19:54.826904+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T23:19:54.826904+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.561513Z","title":"Gottesman, Surviving as a Quantum Computer in a Classical World, 2024 Draft (2024)","venue":null,"work_id":"4a9caa85-e9f9-4b51-9d2d-7d8a2085deec","year":2024},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:8d7af3676f1f75c1696bd2b08ee22ec32e6e5c7093e0a273716ba610a878cdb6","observation_id":"1047f45a-f0a9-421c-a14b-7bb20645b345","resolution":{"observed_at":"2026-07-10T08:26:59.562722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.12735","last_updated":"2021-09-27T00:39:47Z","snapshot_observed_at":"2026-07-06T11:51:32.965715Z","submitted_at":"2021-09-27T00:39:47Z","title":"Investigations on Automorphism Groups of Quantum Stabilizer Codes","version":1},"cited_work":{"arxiv_id":"2109.12735","doi":null,"metadata_source":"pith","pith_arxiv_id":"2109.12735","snapshot_observed_at":"2026-07-10T08:16:58.882166Z","title":"Investigations on Automorphism Groups of Quantum Stabilizer Codes","venue":"cs.IT","work_id":"e7595212-e58d-4b69-a2dc-6c2e1eeee6fc","year":2021},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/2109.12735","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:de779a67c177b14df1457ad76cc2f85ba421377a655d88f9b718531011fd232f","observation_id":"adb3bf72-baa8-4316-af07-57b6d4a6c791","resolution":{"observed_at":"2026-07-10T08:16:58.883400Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:58.840065Z","title":"Barenco, C","venue":null,"work_id":"ef516271-8d35-489a-bb65-e97ac7bcb310","year":1995},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:fa64d4c2feb1f9ddf18a089419e1abedf5a9d9fa64044e3f7ba1df2e3fdfaf96","observation_id":"57902c91-eaa5-4a1c-8199-3f2ad2eb0b20","resolution":{"observed_at":"2026-07-10T08:16:58.841499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.578115Z","title":null,"venue":null,"work_id":"d98680c4-044d-4990-8377-0d7c94ecffa6","year":2022},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:1a3337f51e01fd00b776b9c235c58c6f8cd9610592b1caf5f35e8a85e99f274c","observation_id":"485d74d8-e2a3-42ef-a63d-426047138797","resolution":{"observed_at":"2026-07-10T08:26:59.579154Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.519346Z","title":"Tanner, IEEE Transactions on Information Theory 27, 533 (1981)","venue":null,"work_id":"6cf851a2-b554-4b54-9834-0c3479860dd9","year":1981},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:cbd23e28f7aead9eddacfa2a6215ccb6ae12e56994456c2527943ee24c48b3a1","observation_id":"cfd86569-525f-4b00-bba0-5f90e73eabef","resolution":{"observed_at":"2026-07-10T08:16:59.520597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.528651Z","title":"Junttila and P","venue":null,"work_id":"97204c3a-207d-427b-8aa4-00c1780aea35","year":2007},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:67fd2af4281a55ba7aaaceb97c43270423444708946a9db5bc67715fc869940e","observation_id":"a6b506ed-604d-473e-8447-a038f060db21","resolution":{"observed_at":"2026-07-10T08:16:59.530021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.530589Z","title":null,"venue":null,"work_id":"ad6f66e3-331f-4bb6-8a14-104fd3c3af23","year":2014},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:82ec39faaa7bdcab7faaf474938a7ebaab1c12da294d940b5b6827ee38a3e743","observation_id":"5a0dcc25-fbc0-497d-94bc-1f3af48c804c","resolution":{"observed_at":"2026-07-10T08:16:59.531831Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.532428Z","title":"Bomb´ ın and M","venue":null,"work_id":"1960b3cd-dac2-4db9-8253-0d78c9db31ad","year":2006},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:46813c112695485ef1023029d36480545c3d05e187eaeb4cbcb0b3ceba35e2ce","observation_id":"b2e55658-a63d-47db-ae94-0cf1a39b433b","resolution":{"observed_at":"2026-07-10T08:16:59.535689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.605808Z","title":"Bomb´ ın, New Journal of Physics17, 083002 (2015)","venue":null,"work_id":"53145ce1-4770-4135-b126-e09cdc510422","year":2015},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:f12fe7f2a21a0f289c718fb87231a9e16496975e8b2d8eaddfa2f4e1824b0e99","observation_id":"43785aca-80d6-4bae-95e9-22e7e7b53483","resolution":{"observed_at":"2026-07-10T08:26:59.606918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.609112Z","title":"Vasmer and D","venue":null,"work_id":"4e5e7918-3ef2-4745-bb07-f50e744afdfa","year":2019},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:7b06af71db41d85984f1455e8bce954852bd3f665a8884363c8c3d875d9e1c78","observation_id":"77d8b91a-7bb2-429c-9604-b14ce75d1219","resolution":{"observed_at":"2026-07-10T08:26:59.610190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.600845Z","title":"Honciuc Menendez, A","venue":null,"work_id":"c99e3e48-9277-4b1c-939e-6288ddd0e68b","year":2024},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:904dac3cae95b02d76db4e577cacf3b0b47a2ef00507727106ddb70a2df027cb","observation_id":"5fbf6c13-c09d-4d1d-848b-7cd6eae25bdd","resolution":{"observed_at":"2026-07-10T08:26:59.601929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.508930Z","title":"Gong and J","venue":null,"work_id":"9e9e8efd-8e30-420f-bfb4-9425dc192fc2","year":2024},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:d8fd57f700a5d8a2ac2cf980bfc55ca60ea46552e74e8a7c265191ad50ace80c","observation_id":"ffb9a11c-c6ef-4107-a8e8-7d9b29bca503","resolution":{"observed_at":"2026-07-10T08:16:59.510155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0807.3917","last_updated":"2009-07-20T09:05:07Z","snapshot_observed_at":"2026-07-06T01:42:47.850717Z","submitted_at":"2008-07-24T15:44:27Z","title":"Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels","version":5},"cited_work":{"arxiv_id":"0807.3917","doi":null,"metadata_source":"pith","pith_arxiv_id":"0807.3917","snapshot_observed_at":"2026-07-10T08:16:58.866137Z","title":"Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels","venue":"cs.IT","work_id":"bc54ade0-e83c-42ed-b445-9afb690839f7","year":2008},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/0807.3917","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:5deeb7dde55cb9e990754a53f2f4c0bab28e804c88ce63fd0708e53f58fa7543","observation_id":"2ebe026f-89d0-4db9-a943-63354cc62067","resolution":{"observed_at":"2026-07-10T08:16:58.867444Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.514731Z","title":null,"venue":null,"work_id":"d8397725-4e32-4b42-84e8-8d50febdbc5d","year":1996},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:7b9538b75aaf695d4d20a34e873ed1afd1af0e53464c160aed47d65c50814833","observation_id":"955c0d5e-7181-4260-b802-8faa2586b3a6","resolution":{"observed_at":"2026-07-10T08:16:59.516221Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.512736Z","title":"Bravyi and J","venue":null,"work_id":"cdfe3fd9-c1d6-4e76-abfc-ba8163c3fac7","year":2012},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:60966d86367f7bc70106c7f097c1e5b9bb518523a2188f6e9cb750bd6942db71","observation_id":"a179e2bb-ddc5-4f69-b5fd-8138e3c6d56c","resolution":{"observed_at":"2026-07-10T08:16:59.514085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.505240Z","title":null,"venue":null,"work_id":"7b79cd77-735e-44e6-8e38-3d82ef95f3ae","year":2018},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:fc9dc7bcb2c9f6cd5ac8cc2864d6ce02400b52224272d0d79d2f0bc8ba3cc290","observation_id":"ab870db8-50bc-470b-bab3-5e9bbb1c2509","resolution":{"observed_at":"2026-07-10T08:16:59.506487Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1109.2591","last_updated":"2012-07-27T13:16:38Z","snapshot_observed_at":"2026-08-04T01:47:38.036932Z","submitted_at":"2011-09-12T20:00:02Z","title":"Polar codes for classical-quantum channels","version":3},"cited_work":{"arxiv_id":"1109.2591","doi":null,"metadata_source":"pith","pith_arxiv_id":"1109.2591","snapshot_observed_at":"2026-07-10T08:16:58.871369Z","title":"Polar codes for classical-quantum channels","venue":"quant-ph","work_id":"8de53085-5ff6-4d5e-bd21-b23e1cc632bf","year":2011},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/1109.2591","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:dc119b1c2e63177352e09aed8262c9319eef7acb7590b6f6101fd6d674742cac","observation_id":"79109122-ff1b-48ec-b146-aecd10f4d7f1","resolution":{"observed_at":"2026-07-10T08:16:58.872813Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0406168","last_updated":"2004-06-23T03:21:59Z","snapshot_observed_at":"2026-07-07T07:16:20.902237Z","submitted_at":"2004-06-23T03:21:59Z","title":"Entanglement in the stabilizer formalism","version":1},"cited_work":{"arxiv_id":"quant-ph/0406168","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0406168","snapshot_observed_at":"2026-07-10T08:16:58.887441Z","title":"Entanglement in the stabilizer formalism","venue":"quant-ph","work_id":"429896de-6970-4854-abd5-914c024585da","year":2004},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/quant-ph/0406168","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:2c9f2513a5438044d80d9f63caaa82c8a1f6e66ab23421a3daa3cdaf18a6146a","observation_id":"e462f7b3-fe2b-47bc-9e53-5292dba6aaa5","resolution":{"observed_at":"2026-07-10T08:16:58.888616Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.536284Z","title":"Nahum, J","venue":null,"work_id":"61538c8c-094e-4bd7-bc8d-1c5dfaed0609","year":2017},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:62f9a0c37329520491e87e49e510521aa2f8b52687fb0bc48ab8d4acbdc5c1ab","observation_id":"bd4385af-236c-45aa-9e88-6e1d7fe70f5a","resolution":{"observed_at":"2026-07-10T08:16:59.537492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:58.817830Z","title":"Hayden and J","venue":null,"work_id":"761cec24-7989-4110-a501-90dfbf9c2cec","year":2007},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:9de657ce04009b0da1724268f5d486713006240c3f6cd9cea92b96c0cffd01ba","observation_id":"d7338bff-454c-4401-b14c-7a01c365e9c0","resolution":{"observed_at":"2026-07-10T08:16:58.819221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:58.824054Z","title":"Sekino and L","venue":null,"work_id":"bcbccdb6-7baa-44de-9c0b-9eb32958172e","year":2008},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:eb301b3d2ef45f132ca3a74ed5be5ed4f0ee1bb43b6a3e36b25746d3b36744ce","observation_id":"11b32d5f-36ee-4e2b-8e77-4bf08992b04a","resolution":{"observed_at":"2026-07-10T08:16:58.825345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:26:59.574670Z","title":"Van den Nest, New Journal of Physics13, 123004 (2011)","venue":null,"work_id":"d2ed4501-6ca9-42a1-86d8-dd2497afe6ae","year":2011},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:eb89f8a803b4f8a1fbfd7a6cb56fd718788c5e497b1790261d9bcdafb1ec1316","observation_id":"89270d80-94ea-413c-a078-118ae40fb73a","resolution":{"observed_at":"2026-07-10T08:26:59.575856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1303.2042","last_updated":"2013-12-13T17:31:54Z","snapshot_observed_at":"2026-07-06T03:08:16.668100Z","submitted_at":"2013-03-08T16:20:34Z","title":"Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning","version":2},"cited_work":{"arxiv_id":"1303.2042","doi":null,"metadata_source":"pith","pith_arxiv_id":"1303.2042","snapshot_observed_at":"2026-07-10T08:16:58.895226Z","title":"Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning","venue":"quant-ph","work_id":"859eece1-65e2-4469-8816-a94d6699f835","year":2013},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/1303.2042","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:ce5aa2c29e8ad6a2d830e3f083505b7024c3e2596c24a25d06c812bb57371a55","observation_id":"d813c386-9dc2-44d4-9477-e32ff42fe94e","resolution":{"observed_at":"2026-07-10T08:16:58.896472Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.20624","last_updated":"2026-06-28T19:27:27Z","snapshot_observed_at":"2026-07-06T21:47:34.444132Z","submitted_at":"2025-06-25T17:13:16Z","title":"Leveraging Phase Polynomials for Quantum Circuit Optimization","version":2},"cited_work":{"arxiv_id":"2506.20624","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.20624","snapshot_observed_at":"2026-07-10T08:16:58.884785Z","title":"Leveraging Phase Polynomials for Quantum Circuit Optimization","venue":"cs.PL","work_id":"995e93ab-b124-47e5-a2c4-2d374f4e64d3","year":2025},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/2506.20624","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:75872c0aa779e9113eef74e7cba14b46fad94c781c64005ba4e2d0bc39495ade","observation_id":"ec2ef45a-0d8c-4dce-b318-e69df36a4a9d","resolution":{"observed_at":"2026-07-10T08:16:58.886205Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.00224","last_updated":"2022-02-24T03:43:21Z","snapshot_observed_at":"2026-08-02T07:42:18.987406Z","submitted_at":"2018-12-01T16:37:54Z","title":"Classical simulation of quantum circuits by half Gauss sums","version":2},"cited_work":{"arxiv_id":"1812.00224","doi":null,"metadata_source":"pith","pith_arxiv_id":"1812.00224","snapshot_observed_at":"2026-07-10T08:16:58.897955Z","title":"Classical simulation of quantum circuits by half Gauss sums","venue":"quant-ph","work_id":"a1a4d3f6-f188-4471-a724-bb343892b87e","year":2018},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"cited_paper":"/paper/1812.00224","citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:412c9df31720e5bee759f30026f8de62b78599ab4040dcb6737ff11253f89c22","observation_id":"b8e95b4b-5680-4f99-bdf4-eb913583b6c8","resolution":{"observed_at":"2026-07-10T08:16:58.899228Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2412.15187","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T08:16:58.868597Z","title":"Veroni, A","venue":null,"work_id":"3b038676-74e0-4575-b954-8c7f43cec66b","year":2025},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:e324a6a62b7eba7e4a58a24acd319b0b98218eac5a7c6e593bbe43968ce62fbc","observation_id":"f0379468-5bb6-4d22-9a3f-5e850b53a7fc","resolution":{"observed_at":"2026-07-10T08:16:58.870158Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:58.806263Z","title":"Tirrito, P","venue":null,"work_id":"078d7674-a74f-41d5-b921-b9e3e270b9cb","year":2024},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:18f252da5b700b52ba85808c5b4dccb0b81c6ef58cbdb383f6c4206e96707611","observation_id":"d6bfa263-fc5b-4680-bb9b-14f7847b21c8","resolution":{"observed_at":"2026-07-10T08:16:58.807643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:58.804178Z","title":null,"venue":null,"work_id":"275b7063-947a-4ff2-9211-14cd5356bd91","year":2017},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:121ca497baef8d94dc7fe02bcc9cba0dc13d86796886148d74e965d6e7c52455","observation_id":"beeea1e1-e4f5-4ab8-b469-26234f0de14a","resolution":{"observed_at":"2026-07-10T08:16:58.805569Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.557699Z","title":null,"venue":null,"work_id":"f43a4fec-492e-45a4-82f4-a6be448700a1","year":2019},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:80e9bd8c28bc7822b84804ddae241c7b33bc7d6eee29daeeea4fd8d94ce45634","observation_id":"436c770e-1158-4d24-88f4-9ce84f836972","resolution":{"observed_at":"2026-07-10T08:16:59.558904Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.555670Z","title":"Aharonov, X","venue":null,"work_id":"77604882-b594-4465-a330-6ca5326a126e","year":2023},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:9d070199be4ca64ba18738c5a254e540ca504348a474689537c6b09901492364","observation_id":"5b85f206-9afb-4f4c-af6d-1f8042ffdb2f","resolution":{"observed_at":"2026-07-10T08:16:59.556978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2409.01706","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T08:16:58.889805Z","title":"Angrisani, A","venue":null,"work_id":"f45a6a74-50f9-4f49-b7e1-632e5cf04553","year":2025},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:ede348eaa83b9a5d90c650cf24be7f9f2f502dcc61298486779db513095bd97d","observation_id":"01c1da61-4b73-4d5a-b0d4-12b4116b55e8","resolution":{"observed_at":"2026-07-10T08:16:58.891281Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T08:16:59.559467Z","title":"Tindall and M","venue":null,"work_id":"92f4f83c-6dc9-4365-bd7f-fabf35f25808","year":2023},"citing_paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-07-10T08:07:58.802765Z"},"links":{"citing_paper":"/paper/2607.08396"},"observation_digest":"sha256:e71ee2a540e81a224929584e7f1f25fb78eced7e7c0a83763734dc74b57ab721","observation_id":"55eeff2c-41ad-48f0-b009-45fc56e4d9cd","resolution":{"observed_at":"2026-07-10T08:16:59.560955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.08396","last_updated":"2026-07-09T12:19:50Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-02T18:39:22.188047Z","submitted_at":"2026-07-09T12:19:50Z","title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks"},"reference_resolution":{"displayed":87,"state_counts":{"malformed_identifier":0,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":23,"verified_exact":19,"verified_fuzzy":40},"total_outbound_references":87},"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-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 87 of 87 outbound references and 0 inbound Pith citation observations for arXiv:2607.08396."}