{"as_of":"2026-08-10T12:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:68bcbab2b2d453b93f837f50dc657394daa7326ba66df6be3c461b74335b1023","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T02:27:47.197073Z","state":"measured"},{"denominator":55,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":55,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T05:49:54.196065Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.11882","snapshot_observed_at":"2026-07-31T05:49:54.196065Z","title":"Chakraborty, B","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24924","last_updated":"2026-07-27T18:00:03Z","snapshot_observed_at":"2026-08-06T21:36:16.178074Z","submitted_at":"2026-07-27T18:00:03Z","title":"Efficient computation of real-time correlators using Pauli Propagation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T05:49:54.196065Z"},"links":{"cited_paper":"/paper/2607.11882","citing_paper":"/paper/2607.24924"},"observation_digest":"sha256:08794bdf32d897e6a163102096b6fec1af4b28ab1c6fb2f381cd1b9d834b73c6","observation_id":"059e967f-68f7-44fb-a5f4-e89283813c3b","resolution":{"observed_at":"2026-07-31T05:49:54.196065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2607.11882/citation-record","integrity":"/paper/2607.11882/integrity","json":"/paper/2607.11882/citation-record.json","paper":"/paper/2607.11882"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"For example, for an N -qubit system, one could consider the basis of all traceless Pauli strings spanning su(2N )","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:0455abe2d694dd5043c8d1692a4fa22dbe9678aa3b09e770f6806968a33e7174","observation_id":"91728278-67b0-4aca-88a1-3eaf6cf6ceea","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Here, we introduce a truncated operator Lanczos algorithm that constructs the Krylov basis, S ¯O","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:ab4df84a6d18cba33383d119f432fd839bf7e5f6297b35149fa218a39848c051","observation_id":"bf8fc68e-7fbe-4d97-a81f-854df307f900","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"This ensures that the resulting Krylov vectors can- not have more than |S ¯O| elements of the predefined ba- sis, which scales polynomially in system size for a given threshold","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:6729d911f375afb3d481cc3ac7c6abb57661d20b3451ec11b085b5c3c1fe8d67","observation_id":"a48ab101-9bde-4c6c-8f32-aea7694f5456","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:7c55e8845d2113162c1fa527bd5de24efc6d33b4c0fea4530e66dbb2e75e107a","observation_id":"31d83129-c5ad-4912-ade0-29da8dc1a0ac","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:f419a59bda74f42c77293d51c88b22c5b7afb0984e6f1b0fb09435ea8db9477a","observation_id":"1347966f-4dd6-420c-ae7b-f35809ed0a00","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Davoudi, C.-C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:ca6119131c58f6fbcf6ffbfc5b263689fccf646d57ac5eb0d165f9f1ae967956","observation_id":"cbebeb40-7145-4c58-b1f3-d1e191f04ba2","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:9161a92b48c3255cc029eee01902a152dfd1996a67e08f7a658efc5c7c528e25","observation_id":"dcf5f4ce-7ee4-47c1-8f8e-e97991da4688","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Karrasch and J","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:7190e889216d16ad48e5a13cec059c8c43ec4273f0b3793533deee4f657c02de","observation_id":"f4b645b6-b812-4d7e-b827-084d3e729fa5","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Gustafson, Y","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:55bcc44378e55f663fb888a6ef57c33b03bcb126577fe81e67aa96f15f92928f","observation_id":"757eb8f9-9bc6-496c-9cf4-8c644c6e8c27","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1073/pnas.1916213117","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the National Academy of Sciences","work_id":"77911fcf-9539-4afa-8f62-6c9d40d08686","year":2020},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:730163a47e1186af97096b32be76f03b4e79d073cce5028ba98cba0399f13917","observation_id":"76ca9491-7583-430c-a4f1-fc665ff61e76","resolution":{"observed_at":"2026-07-14T02:30:10.410099Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T02:49:39.810255+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T02:49:39.810255+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Eckstein, R","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:a45a1b58afe5b2c513bdbb9b0e7dda49ae2b482c0156e7abf80ea8578bd3bdc7","observation_id":"6430d482-ab8c-422d-a0be-64755cfdd4ac","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:12d5e814972260cc18b42dd8ab88ebef7041085a947751b0dd36491ecd31c7ae","observation_id":"f2a53035-de95-4b12-b444-483dfa8a4585","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:b7249029b677bfbb1913b3e174597239c6fbe2029eb079b94892e1ac5508e703","observation_id":"d3c00403-0368-4809-aa4f-1d10f9a582f2","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:bad2ac5708be8650c27e1eee4d37fdde5671e8013f96d58d98c3222639ec1925","observation_id":"3eae8b8e-20bc-4919-abf0-be01c9f938eb","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:7ffc69509d1dd45b91b8cc657283b8aca16e71a6c79e07270256c5fa6357f98e","observation_id":"f4ab65fa-966e-4b87-92c5-a53a4acf19f6","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Anand, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:b19ec7105e1a6f26f0cc9c52cecb316d825738abe740cdd909244465d828438f","observation_id":"195568b4-92c7-43af-8f54-3f5572a64217","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Asaduzzaman, R","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:1126d36f850c8eb39d0221e9177e22fc9c50bdf8f3af7bc99baab98241109ee4","observation_id":"a332c0ca-9a30-45c6-a871-1f4ab0d37762","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Perrin, T","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:12ba1338495ceaee97c15d3af07ac2a81b9f39d8d201bfb2e79888a412861af1","observation_id":"b4585e57-ef08-4394-8fba-4fe0c73dbff3","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Kassal, S","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:78f1a74c9ff989ea48c4f1ad336e15c053a3947deac217d1bd6cd9cdc1f67c1a","observation_id":"70269012-711d-4b57-bcb6-ffbb6e15b7eb","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:7d92ae638ceda2e7e8b6271f06d6b34d9281e3567989cbb4f736d119ece11513","observation_id":"5bf5059e-086d-4c71-bfa2-d1c5283de23e","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:37560750089617eb041269aa9682c8af341369794c8b9fc153a016aab2b6d0b5","observation_id":"a0ad6fd3-b217-4210-9b0e-eccf66bc6555","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Orús, Tensor networks for complex quantum systems, Nature Reviews Physics 1, 538 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:d850c20967d7563945e3df72a759c71d32b53ab2de91ab0ad23876fad5e45ddb","observation_id":"f40d961c-c137-4642-9a83-30a1638b49bf","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.21606","last_updated":"2026-05-30T19:34:36Z","snapshot_observed_at":"2026-08-07T13:24:38.192756Z","submitted_at":"2025-05-27T17:52:57Z","title":"Pauli Propagation: A Computational Framework for Simulating Quantum Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.21606","snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"cited_paper":"/paper/2505.21606","citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:9628339eda95e99aa1eb40ec80181b79f80bcb04d9568ffd7c1197186943922d","observation_id":"f99e7e49-3a23-4c68-b304-4d42ab0aec8a","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Frías-Pérez and M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:d8774018952e3f6fb23da67c898b15bfd1f9fbf0956e73adb86dc352e2ea9754","observation_id":"cd519005-0063-4092-9e6c-ad7160fa13d3","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:cc852af5d27f1a18f55e26d86cecda29b5a2d39076013c9674afd29c379fee6d","observation_id":"8dc30104-eee1-4ab4-b01d-e050ae698173","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:1cdf7f5600c5b331bb1d25bcd0ce73a939e3a3060bf698800793eb074fdd12be","observation_id":"83b7e133-359b-4a83-8748-172fac9de3d9","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:02cf9eb15003a59c2d27d36e88509457071502c07e7389bfa5d213a2a51423e8","observation_id":"e0efc629-11b8-4d2e-8818-f51af3b4968a","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Poulin, A","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:e0e2ee5f1557411b744c325d1889b5b053bd3fb71e3660626c32b834f4d5c5d2","observation_id":"41a3465d-700d-4768-bc2f-cf57c9d090fb","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Wiebe, D","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:80ddb736cbd7fb3172e36363ec6df8841de1a1d3c6810ffd38c8ed3f3c24032e","observation_id":"60bac207-67c5-4983-b8e0-54d354dba141","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:17604bd7809488cef3eb279b536f2ae356f56f282dda5c8cfa4084714ae0ffee","observation_id":"0560bc37-5388-498f-91f0-e36b208ece75","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:f32179be5bb90b9081cdf2e5b5e3947317489435aafc646d329c6f29873aa5d5","observation_id":"146dc33d-993e-44ed-beeb-040f6d562c1f","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Campbell, Random compiler for fast hamilto- nian simulation, Physical Review Letters 123 (2019), 10.1103/physrevlett.123.070503","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:543fdbeac44260c2446d4b37bcaa5290e1cd0330bfebd4ce9e6ed4f863c53c13","observation_id":"6db3bdf1-1fd8-49f7-834a-5ce5f605bad0","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Nakaji, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:8ddd1c5f1e1bcbd2eec3d80c5912bb81da0aa374b6736eddbdbfa5c07c62bb20","observation_id":"8c9cd7ba-5ec3-4bad-9eb5-fc7854f89a7d","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:43eb8ce9bb8e6538648c5083e57ee3377db80cb3e035c0af39600b088b60fa25","observation_id":"ddebae1d-4f4d-4619-804f-16fe1009093b","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Chakraborty, Implementing any Linear Combination of Unitaries on Intermediate-term Quantum Computers, Quantum 8, 1496 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:ab365e896c38b472e223fa8772eb30feb0985205cfcf814c043b2cae6717e6ee","observation_id":"863d1b1f-6181-4c64-b9d6-7ef76d2aa3c8","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:f3a4295ad14717a2873bb9519fb66da6a5f9723fbb30320952e35ac4ced36249","observation_id":"454918a5-9a6b-4baa-a046-7df3b2b5bb16","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Alexis, G","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:4949542ad5d3835be10f74a0ce198b70d6bcbd28d80e7243f516a1a5e033fe4a","observation_id":"f4e5ae23-2f84-4b5e-97e5-1689fd07ab25","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:0fe102c87d79d3fb84b16f424aa32328b7e6f8119f2e6acfca823561ede00101","observation_id":"dff18c46-cea7-4831-be47-c81bc203a5e1","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Cîrstoiu, Z","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:b4176e3f61656842eb45b0a6a38f2979d2ec10cabe89e52fad5e252c3ce0a939","observation_id":"5d8d295d-22bc-4e32-87e4-52c684628655","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:eb8d93b1d52e4cafa38dfff85591ed1f894ae84b04af053ce5574b67f2919f27","observation_id":"fe414874-b0b0-4545-bb0a-3e8192f350f9","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Kökcü, T","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:dda1be8833e77f2919ff231ef37f429b508ee03569519b3d28ba7dc30f6d6172","observation_id":"7bf78e0c-d692-49e4-a976-e68f0bea771d","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Alsheikh, E","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:60e5066f18e57a9f55a01783c11dceb981302d3502262ab658183908f218f813","observation_id":"b2d0a979-a6ab-4909-8921-40703f7af8c5","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Sambasivam, K","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:de1b13deedacb465dc2614ebe9ca33d660ebea8ea83225fcf97f3f073b8f47c2","observation_id":"d4f13cbc-6a49-4f56-a844-a18c218b3041","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41467-025-57451-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Nature Communications","work_id":"4755e09d-4d14-421f-b8b2-80bc6a448721","year":2025},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:b085bb86c17764bccf41b42109c4080bfd6872485335a8a98604092aa55cc5e2","observation_id":"dac83048-d801-45bd-b96c-40ede9a40482","resolution":{"observed_at":"2026-07-14T02:30:10.405310Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-14T02:49:42.137517+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T02:49:42.137517+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00081","last_updated":"2024-07-31T18:00:11Z","snapshot_observed_at":"2026-07-06T18:55:15.704075Z","submitted_at":"2024-07-31T18:00:11Z","title":"Full classification of Pauli Lie algebras","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00081","snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Aguilar, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"cited_paper":"/paper/2408.00081","citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:6487e989b0139534d0c099fbf8c2b2cb5fc059e58780541f302a90902ae35123","observation_id":"1a45b104-6de0-402f-b498-ef2dad9a8a8d","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Wiersema, E","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:d889f4cfbce9cb4acf022bdc5bfbde859f5a9fc90d2e3c9262477471c4d2cdc4","observation_id":"e74a6b48-74ab-4c38-8580-a5bb33e60382","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Nandy, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:cf5170a749c3f8607c78526c9dad8e3859c344b7b958e4a451b09d83d61633d6","observation_id":"96b2184e-bd0d-4c5e-b4b2-bfef2e7a2e67","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:3504b70d11d96267bd9bbf014258f32933006dde89e8a1f273ee30e0dd47fda8","observation_id":"f4336a46-11f5-47d8-9c08-e509adb84953","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Sundar, A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:edb00f37e78b93faa26e240384b1035104b29a591124d6d23fd6ea98830e79a3","observation_id":"732e5c87-a8f4-49ed-be08-50458c502f35","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:f2c412ce933274bf56a8a54f25da7730818805eb9af97c5db46a69e5ab84a8a6","observation_id":"b6f01b22-1bd6-4d36-8c38-0fc20d195a37","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Wang and K","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:3d9bf8e2329bb7c4792a531cacd2ca63a8cbf9aa0d6b9b5a5b4633c0c806163a","observation_id":"a9d9fe00-ebb0-43f0-a4f9-7d08d4947839","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Wang and Q","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:7b1d85506c70c01bfbf7c3010a8c7d7b8db4ae9d44209d05e9cd6045f509684e","observation_id":"d503655a-c02e-4d36-97a9-25da48717cf6","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Michel and S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:8fb6c6f3d2e9a5761d718df3ce3dad03b29e87a125340438e5acca4b0f4a98db","observation_id":"ed6928f5-0e4d-48e4-9276-6312a08019f3","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:27:47.197073Z","title":"Saad, Numerical methods for large eigenvalue prob- lems: revised edition (SIAM, 2011)","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-14T02:27:47.197073Z"},"links":{"citing_paper":"/paper/2607.11882"},"observation_digest":"sha256:f249f36c186765fed2a2d2a2a651e38ce26d7851948fa69c23bcf0da0c6aa5fa","observation_id":"2fbae45a-8077-438f-a16b-8a200ef4f4e8","resolution":{"observed_at":"2026-07-14T02:27:47.197073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.11882","last_updated":"2026-07-13T17:58:38Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T13:44:52.053980Z","submitted_at":"2026-07-13T17:58:38Z","title":"An efficient algorithm for approximate shadow Hamiltonian simulation"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":52,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":54},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 1 inbound Pith citation observation for arXiv:2607.11882."}