{"as_of":"2026-08-10T02:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4c4ca3d384f2076c1a2ace3a77ae242fce724277004412d8a866bb8807f2d3c2","coverage":[{"denominator":68,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":68,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T18:17:31.207671Z","state":"measured"},{"denominator":69,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":69,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T15:33:58.103988Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-08T15:34:00.282300Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"cited_work":{"arxiv_id":"2603.13160","doi":null,"metadata_source":"pith","pith_arxiv_id":"2603.13160","snapshot_observed_at":"2026-08-08T15:34:00.282300Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","venue":"quant-ph","work_id":"f5cd9b07-7b72-453e-9111-a6d00948c593","year":2026},"citing_paper":{"arxiv_id":"2608.05314","last_updated":"2026-08-05T18:15:19Z","snapshot_observed_at":"2026-08-09T23:10:33.081960Z","submitted_at":"2026-08-05T18:15:19Z","title":"Machine learning for sample-based quantum diagonalization: generative configuration recovery and the classical-simulability frontier","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T15:33:58.103988Z"},"links":{"cited_paper":"/paper/2603.13160","citing_paper":"/paper/2608.05314"},"observation_digest":"sha256:6a49d9464a5f5829c7692da9dadc131e9c4490286352426ba1fbb12bec26e594","observation_id":"ffc1f053-e0ce-47ed-9131-3e0ec39563c9","resolution":{"observed_at":"2026-08-08T15:34:00.287299Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2603.13160/citation-record","integrity":"/paper/2603.13160/integrity","json":"/paper/2603.13160/citation-record.json","paper":"/paper/2603.13160"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:30.126363Z","title":"In addition, it can be sparse or dense, but the accuracy of the final eigenvalue(s) depends on the matrix’s density","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:30.126363Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:0a6894ba23eb80e76fb1099a251c160fd04457913e7b4db32d592f6a8124efe1","observation_id":"cf47b233-aaa0-46ad-98fb-7f96d7c20ac2","resolution":{"observed_at":"2026-08-02T18:17:30.126363Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:30.223366Z","title":"This means that the approach is agnostic to the type of quantization used to construct the Slater de- terminants (see below), i.e, first- or second-quantization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:30.223366Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:6ce53e0f130bfbd5c7a0bbd1ab68522830aebfdef0b9df5b6bc278a6a44dcb6a","observation_id":"e85d439c-4143-4784-8a82-0d0680796a0c","resolution":{"observed_at":"2026-08-02T18:17:30.223366Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:30.394767Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:30.394767Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:7809c2ef9b93695558332766d8d85abba8acb68d5746994836564bc6dc06a8d4","observation_id":"3f7acef0-6448-4ad0-8ead-fe9d388929b6","resolution":{"observed_at":"2026-08-02T18:17:30.394767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:30.511945Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:30.511945Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:7968406e40067fa8b1bc877cb646d2a669a1f7795ea4b3fbd8fa8d0751d8d1ce","observation_id":"5852f2aa-737a-4a1a-b290-26af2a626256","resolution":{"observed_at":"2026-08-02T18:17:30.511945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:30.670292Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:30.670292Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:93a444daa50224d82e5aa8a1a447cbbb1e9e7c57faba9eca94513781c145ab52","observation_id":"7f3ebf9e-1643-45cb-b4cd-e9aa0386ef96","resolution":{"observed_at":"2026-08-02T18:17:30.670292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:30.674797Z","title":"An active-space is created when Slater determinants are built using a specified set of orbitals,y, and ac- tive electrons,x, instead of using the full Hilbert space","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:30.674797Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:bef33c31298edbda2c7ac63e2fc3beb1efd6e1bf9516a527e90d18ced47830b5","observation_id":"a5c9d23b-ca72-46a2-b8e1-3dd3da9e5849","resolution":{"observed_at":"2026-08-02T18:17:30.674797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:30.773291Z","title":"This algorithm works in two stages","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:30.773291Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:136cc96d2ecfade37a0a12a4b2bb0eee1bef1b4ee3a645a41e032aeab73958f2","observation_id":"c2175033-9e46-4736-8a7b-2f4b065b2104","resolution":{"observed_at":"2026-08-02T18:17:30.773291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:30.922341Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:30.922341Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:4032b7a44bb796e2f1ded1069d6bedef600a1e4e00b6a5ddaa1ebdb7054a4b4e","observation_id":"eed67c10-dc92-460a-81b9-e0505bdf2a1b","resolution":{"observed_at":"2026-08-02T18:17:30.922341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:30.935510Z","title":"In this algorithm, the CIM is decomposed into a sum of one-sparse Hamiltonians, each of which contains a single molecular integral","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:30.935510Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:4df1feb0bb672af32ed1fd151103e5c2e1f2943f5ea58c90e6a893bfde12405e","observation_id":"39817a72-f5fc-44fa-aa01-681db5fc9245","resolution":{"observed_at":"2026-08-02T18:17:30.935510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:30.993269Z","title":"These are used to construct a subspace-Hamiltonian (see Section II E)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:30.993269Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:0653d77bb888a3e5184b38757324df48cad6015caaf3e840595e8ff90a2ad108","observation_id":"0314cfa3-b14c-4ce5-a66d-b74404a2c3ab","resolution":{"observed_at":"2026-08-02T18:17:30.993269Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.019006Z","title":"The set of sampled CSF,S, then undergoes the bit-flip mitigation post-selection process described above","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.019006Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:c0740fecaf83e0b4b0bc8943dec2f536c804185d53b88a99cad480f02fd31b77","observation_id":"3553a33f-63ea-4da6-9bf7-5f544e511154","resolution":{"observed_at":"2026-08-02T18:17:31.019006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.048735Z","title":"The algorithm has the following steps:","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.048735Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:08a5ca7dc70312490937e8afb352dace1fd3e631b684ade8cdc9d46bf9536eb3","observation_id":"29917247-2876-4b4f-a0b9-16d849730cee","resolution":{"observed_at":"2026-08-02T18:17:31.048735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.054323Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.054323Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:15548d410181a89aca3af99067efcbbd4e31ab3725e02427e812e7d8823138c3","observation_id":"fb0b06d7-5f23-47f8-9746-f995b21805c7","resolution":{"observed_at":"2026-08-02T18:17:31.054323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.063764Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.063764Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:a78f3374cdb196778a4d15352d5f51055782f9ec2f4f5f956ec4ae39c8a1a1a6","observation_id":"9cb7bd76-f5d9-4142-afe1-0c88b92733d7","resolution":{"observed_at":"2026-08-02T18:17:31.063764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.070870Z","title":"The term vis a user-defined variance factor which relaxes the acceptance criteria if desired","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.070870Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:b25fb8905f9f7f976a2ab7697bb9e9a2b67a00b0141ab9af6135496d70f1b2fe","observation_id":"45be24ec-10b5-4876-bc49-51ea972f5419","resolution":{"observed_at":"2026-08-02T18:17:31.070870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.074085Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.074085Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:db6bbc82e5d771a1c2831166f31c662f2acfc354db778346dbab77a408376cd0","observation_id":"e23db20a-f8a5-4ae6-95c3-237deb6cb0a2","resolution":{"observed_at":"2026-08-02T18:17:31.074085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.076079Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.076079Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:b4d02599965441cf8b2b321a79169e9971f69795bd3b0fd67e9c66238fdd6097","observation_id":"ea100642-f250-4422-a018-cee10418b97a","resolution":{"observed_at":"2026-08-02T18:17:31.076079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.078039Z","title":"Note that the final subspace Hamiltonian is still constructed in double- precision so that the final eigenvalues inherit this higher level of precision","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.078039Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:b4f2ba9aa20cbc89653d16c0d821c8a4646c004c7fab52edd8a14de0b00df4df","observation_id":"bfad17f4-4ac4-4c74-aac8-79beb292afc2","resolution":{"observed_at":"2026-08-02T18:17:31.078039Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.080969Z","title":"In addition, this approach results in a lower gate count than full Trotterization which can easily become intractable","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.080969Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:d0b2e74576784194d3416b33d5a27357d906111548399bd86e97a976382c3848","observation_id":"317d7df7-f5d7-4f30-8086-f1417db954bd","resolution":{"observed_at":"2026-08-02T18:17:31.080969Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.137139Z","title":"Piccinelli, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.137139Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:b231b647cf864e6e39ece5ae1ae4f280d9930c2389626912712b1486dcc6a970","observation_id":"ddd5267d-5e40-4de6-93c0-98199731d505","resolution":{"observed_at":"2026-08-02T18:17:31.137139Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.09976","last_updated":"2018-12-28T18:50:49Z","snapshot_observed_at":"2026-07-06T07:23:18.087801Z","submitted_at":"2018-12-24T19:49:51Z","title":"Quantum Chemistry in the Age of Quantum Computing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.09976","snapshot_observed_at":"2026-08-02T18:17:31.087547Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.087547Z"},"links":{"cited_paper":"/paper/1812.09976","citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:358a2f6af1c78f1b92ede275bd53dd36cd58a712a03be1c5042f45efab8558c6","observation_id":"5bd482af-1d07-43b7-ac87-c6ce70c8e2df","resolution":{"observed_at":"2026-08-02T18:17:31.087547Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.090623Z","title":"Bauer, S","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.090623Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:4e3254605d3e0b654b347e2c0d91d04810c65094bed9e0e7d0759d0731e65c40","observation_id":"ecd06de5-f594-435b-9347-1cf63c7e3ccb","resolution":{"observed_at":"2026-08-02T18:17:31.090623Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.093424Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.093424Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:81653bce7f1f3c7b8cd8b41f4c1bedbe82662e92b353bd5d1cd1ebdb9097b77d","observation_id":"401d409a-92aa-4f2d-ad73-9e46a33f9e26","resolution":{"observed_at":"2026-08-02T18:17:31.093424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.095881Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.095881Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:f9d54443f218764d01823ba4560a761eb204a7e0d3c1873efd2eae0931e7cd77","observation_id":"44318865-ee56-49f0-b3ea-876e822ef2f7","resolution":{"observed_at":"2026-08-02T18:17:31.095881Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.098565Z","title":"Peruzzo, J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.098565Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:1c2fa6e625cdb7cd3f45d3f94ab393e7e5ab6c90fe53f17f1f6efe7a22059c5f","observation_id":"b7d17e75-54a4-4afd-962b-a776a493f82f","resolution":{"observed_at":"2026-08-02T18:17:31.098565Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.101371Z","title":"Kandala, A","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.101371Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:71c2bea935e6d7578f78be1821b11b4873bd2856fad88ac56096ae315e896c6b","observation_id":"ce66a9c8-cdb7-4c18-8ba6-ebe2ea41181c","resolution":{"observed_at":"2026-08-02T18:17:31.101371Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.103745Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.103745Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:bb95aff144ced3ae545569cae8562c118ded28b364cc02ef69ef6566ac0df236","observation_id":"95a69d64-76b2-48e6-8fdd-63a7c10a8102","resolution":{"observed_at":"2026-08-02T18:17:31.103745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.106396Z","title":"Larocca, S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.106396Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:39ddcef1e5e06e1616746611ebf3e84ce7ee08bc2913582dcd09cf6f43720117","observation_id":"945bf0cc-0830-4211-8ded-52596da38e93","resolution":{"observed_at":"2026-08-02T18:17:31.106396Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.108432Z","title":"Cerezo, A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.108432Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:f96e359fd05ea6fce6fedf98fea82a4fae845d6288f50d42e9f05ec75d07214c","observation_id":"e4d1218b-fc3c-40f8-b2cd-5122fc3cd72d","resolution":{"observed_at":"2026-08-02T18:17:31.108432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.110539Z","title":"Takagi, S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.110539Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:1f9e544b0127d5ae3cab7373ee30c810575eacf9d7f220795422dbcc9b594abb","observation_id":"c1afc49e-3548-4d3e-b3a8-e1b150a7f4be","resolution":{"observed_at":"2026-08-02T18:17:31.110539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.113260Z","title":"Tilly, H","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.113260Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:37080b9f883c8e64b40a22399e4555aa094aaa6c78fa030ce2ab0bb6addfd45a","observation_id":"af5500ef-f144-480f-9c72-4298f8905742","resolution":{"observed_at":"2026-08-02T18:17:31.113260Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.115616Z","title":"Yang, B.-N","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.115616Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:48165398aad445f268abb79e1338e2a67b5749a3c82fe7f77021fc4501525938","observation_id":"2c5dd90b-ec07-477d-80eb-856e775e0e2b","resolution":{"observed_at":"2026-08-02T18:17:31.115616Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.117906Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.117906Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:782c8188f8fe796863b5dc141d97ab989c75a33e4c3cf1816d99a169ab0eba6c","observation_id":"92954ba1-5211-4eb8-9eb3-9c98eb476805","resolution":{"observed_at":"2026-08-02T18:17:31.117906Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11320","last_updated":"2023-02-22T12:05:31Z","snapshot_observed_at":"2026-07-06T14:54:33.989993Z","submitted_at":"2023-02-22T12:05:31Z","title":"Quantum-Selected Configuration Interaction: classical diagonalization of Hamiltonians in subspaces selected by quantum computers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.11320","snapshot_observed_at":"2026-08-02T18:17:31.120914Z","title":"Kanno, M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.120914Z"},"links":{"cited_paper":"/paper/2302.11320","citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:fe210a1f579c9a592f9b9a3370d46dd197624fbb53eac3aecbc8c2d8e4f3e18b","observation_id":"f4367674-a145-49b2-89a0-47d940d975d6","resolution":{"observed_at":"2026-08-02T18:17:31.120914Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.124090Z","title":"Sugisaki, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.124090Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:b16679d9c08c0978c0eefbaa1e8f5718b8d53e236459d74f8123cebd8a9f959d","observation_id":"6f0d45da-dfac-469d-be03-6958aa9821fe","resolution":{"observed_at":"2026-08-02T18:17:31.124090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.05068","last_updated":"2025-07-13T21:10:52Z","snapshot_observed_at":"2026-08-06T20:05:55.204478Z","submitted_at":"2024-05-08T14:08:07Z","title":"Chemistry Beyond the Scale of Exact Diagonalization on a Quantum-Centric Supercomputer","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.05068","snapshot_observed_at":"2026-08-02T18:17:31.126974Z","title":"Robledo-Moreno, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.126974Z"},"links":{"cited_paper":"/paper/2405.05068","citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:530c3c4a9d0311db0f9bf22bb4f283dfe974b2b4b71b3682533dd1387ac92829","observation_id":"82bea673-91f6-49bb-9a9f-4f36efa2786f","resolution":{"observed_at":"2026-08-02T18:17:31.126974Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.00468","last_updated":"2024-11-01T09:33:08Z","snapshot_observed_at":"2026-08-09T02:10:21.489704Z","submitted_at":"2024-11-01T09:33:08Z","title":"Quantum-centric computation of molecular excited states with extended sample-based quantum diagonalization","version":1},"cited_work":{"arxiv_id":"2411.00468","doi":"10.48550/arxiv.2411.00468","metadata_source":"pith","pith_arxiv_id":"2411.00468","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Quantum-centric computation of molecular excited states with extended sample-based quantum diagonalization","venue":"quant-ph","work_id":"b59f027d-aa4e-446e-a560-c7b5f221c646","year":2024},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.129778Z"},"links":{"cited_paper":"/paper/2411.00468","citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:f83ced5166e935242dd536df8b70c477c46c48ea11076daa54c9587ecdf2497f","observation_id":"a3ea5da8-93f9-4fda-b13c-a491a7745ac8","resolution":{"observed_at":"2026-08-02T18:18:23.150340Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09209","last_updated":"2024-11-22T14:57:34Z","snapshot_observed_at":"2026-07-06T19:32:06.379698Z","submitted_at":"2024-10-11T19:25:47Z","title":"Accurate quantum-centric simulations of supramolecular interactions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.09209","snapshot_observed_at":"2026-08-02T18:17:31.132278Z","title":"Kaliakin, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.132278Z"},"links":{"cited_paper":"/paper/2410.09209","citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:ea37afe5f926246fd5d11a38854048bbe6d5adab546031e26b9ba6ca15340715","observation_id":"066fc150-3d2e-48c8-bb17-2ee15ec88fef","resolution":{"observed_at":"2026-08-02T18:17:31.132278Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.135073Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.135073Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:294dee35a66a498a0e42b36ddb61b87b70109c7c15e96352bf9a84a5be3ae5cf","observation_id":"4100a572-2ab1-4cc7-9a25-f0de6c450221","resolution":{"observed_at":"2026-08-02T18:17:31.135073Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.186418Z","title":"Richer, G","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.186418Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:41de412c71bdbe3d743c6939de0f5684749cee3823e6002b621a68f262a0f65d","observation_id":"6dec9c56-dd02-4110-a93a-80a6f2847ce5","resolution":{"observed_at":"2026-08-02T18:17:31.186418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.139565Z","title":"Shajan, D","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.139565Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:9b6fc79c7b30f50356e0ee1f4531226f014e2bb93ac69031706ae002147fad5d","observation_id":"673fc7b1-55ea-4a1b-9748-fbf32f824c8d","resolution":{"observed_at":"2026-08-02T18:17:31.139565Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.142099Z","title":"Danilov, J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.142099Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:718d1e11fe6e5d3be99aab01b9bf31deb31c363cc263231ad3d53d379d25328a","observation_id":"d505eb15-0f99-4b9f-ac6c-e62c27c642a1","resolution":{"observed_at":"2026-08-02T18:17:31.142099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.144614Z","title":"Kaliakin, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.144614Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:e2d6dab0f8af1fde3f2e7b013d170b094e300080ed64eb2e471cb31a5d14eca5","observation_id":"376150d9-2a02-4b49-a170-f9db4600279d","resolution":{"observed_at":"2026-08-02T18:17:31.144614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.084172Z","title":"This underscores the fact that our CIM-QS(H)CI methods achieve similar or better accuracy with fewer quantum resources","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.084172Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:48ec81bf723f9e0fd1713a5bd491b252afb55bcd6049f21ff65dcb9024db0049","observation_id":"547a1101-1e68-4337-b0ed-a3a0497a30a0","resolution":{"observed_at":"2026-08-02T18:17:31.084172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.147000Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.147000Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:4bd0ccf1621d3a34f3898b7b3cd0bb355f638ecef6a84db783412860a350ff29","observation_id":"6a14cf9a-b899-417f-bd6e-7e4180aedbe0","resolution":{"observed_at":"2026-08-02T18:17:31.147000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.2579","last_updated":"2013-12-15T20:52:38Z","snapshot_observed_at":"2026-08-06T14:11:30.848882Z","submitted_at":"2013-12-09T20:58:49Z","title":"Quantum Algorithms for Quantum Chemistry based on the sparsity of the CI-matrix","version":2},"cited_work":{"arxiv_id":"1312.2579","doi":"10.48550/arxiv.1312.2579","metadata_source":"pith","pith_arxiv_id":"1312.2579","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Quantum Algorithms for Quantum Chemistry based on the sparsity of the CI-matrix","venue":"quant-ph","work_id":"249ba1e6-380f-4602-b1ff-e7f8dc8c1bae","year":2013},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.149538Z"},"links":{"cited_paper":"/paper/1312.2579","citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:8bef39e7286edb63e89583f4a882bd9642a3cd5a5fb8fecb0b98ee91d2ca5896","observation_id":"17533c13-bf88-47db-9f5d-19270d2625fc","resolution":{"observed_at":"2026-08-02T18:18:22.904847Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.151950Z","title":"Babbush, D","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.151950Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:60881e127c0b9f3c7e375c47045fcea534f5cd736df9ec6ff23f0691d0198144","observation_id":"49c0e956-93cf-4f91-a6dd-e41c23c186d8","resolution":{"observed_at":"2026-08-02T18:17:31.151950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.154345Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.154345Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:40a5f5161a84422f36c5ffa97f2216f1339851164aa899742afe74823745beed","observation_id":"cd86b654-ae07-4e69-b3e2-f9815e89876a","resolution":{"observed_at":"2026-08-02T18:17:31.154345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.156812Z","title":"Campbell, Random compiler for fast hamiltonian sim- ulation, Physical Review Letters123, 070503 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.156812Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:6310e1944cdcc4d15f42c1d44b5b4dc55c15e1c990e8485e40f0578ef63d9eaf","observation_id":"3a064205-afe3-4658-b7fd-c202b75da9fb","resolution":{"observed_at":"2026-08-02T18:17:31.156812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.159022Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.159022Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:661cfa598b7d356f93d2f53213f2c714dcaac37e16a290aa1b085b39178287f0","observation_id":"7783e6f1-5168-44f3-a1fc-e8b0b944c474","resolution":{"observed_at":"2026-08-02T18:17:31.159022Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.161675Z","title":"Fan and P","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.161675Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:2e89312872c8622a37daee6ebf0b8146cf623d96618465be96488f39a96ab1f7","observation_id":"28870b02-428e-45ca-b42f-0d5044611c0e","resolution":{"observed_at":"2026-08-02T18:17:31.161675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.164562Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.164562Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:39aac281b5e2b341c5a65b9e36eeda536db515e214683bc7f7fea8449ba177a0","observation_id":"54a991e9-74fe-45d8-a452-8076d8da562c","resolution":{"observed_at":"2026-08-02T18:17:31.164562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.167373Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.167373Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:aee7850a35f4817fe5c2d535e03aa422591e1f73ca173c2aa7532192c98c6a44","observation_id":"f1934526-8ef8-4869-bcce-2bfd5cd19911","resolution":{"observed_at":"2026-08-02T18:17:31.167373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.169908Z","title":"Montano, G","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.169908Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:151780f89a02963c2d458c084762c38dc0ceba3cfcaeb0bea8d33a218ec60828","observation_id":"6caee93c-5317-4c66-b561-570c89df4d51","resolution":{"observed_at":"2026-08-02T18:17:31.169908Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.172384Z","title":"Wahab, L","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.172384Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:3fc4df3f8b67ade608b43d8b65dc4117e28192bd97865c9915326c60d3aeac91","observation_id":"40502d12-5cbe-42e2-971d-aa997490d5e9","resolution":{"observed_at":"2026-08-02T18:17:31.172384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.05523","last_updated":"2018-09-14T17:50:11Z","snapshot_observed_at":"2026-07-06T07:02:17.968414Z","submitted_at":"2018-09-14T17:50:11Z","title":"Postponing the orthogonality catastrophe: efficient state preparation for electronic structure simulations on quantum devices","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.05523","snapshot_observed_at":"2026-08-02T18:17:31.175200Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.175200Z"},"links":{"cited_paper":"/paper/1809.05523","citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:9a5cbdca4d10dcfd223094ab7df6ef6acd1bc42b0da59f64705ec3a24db5bbec","observation_id":"3b46ea1d-51c7-4f82-bc13-c47affac54d5","resolution":{"observed_at":"2026-08-02T18:17:31.175200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.177582Z","title":"Scali, J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.177582Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:22215e6380996ea9c25da2d2493bdff794a80972438bd1cfed5ddb32401edd10","observation_id":"94d2287a-dda1-493f-a5b9-76a392385d68","resolution":{"observed_at":"2026-08-02T18:17:31.177582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.179532Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.179532Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:e6f57f384c955bd16b6215b6c94d08afef5aee99eb062e97b0f714563304eb39","observation_id":"3bd4d697-beaf-43dc-878f-5d98946c104a","resolution":{"observed_at":"2026-08-02T18:17:31.179532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.181598Z","title":"Ghosh, C","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.181598Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:71030cc39ba45ddc0e7994ef08693ff8944b058dbcddb3ea5bcd50767d270d14","observation_id":"556db097-81da-4abf-96f5-6dc62e6b9a49","resolution":{"observed_at":"2026-08-02T18:17:31.181598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.183574Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.183574Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:69a2a07a9a4486be2288b44fc284097b02dd4f021fbcf8893037766cd1250bba","observation_id":"057a5d29-330f-47dc-bf6a-d6f932c704f4","resolution":{"observed_at":"2026-08-02T18:17:31.183574Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.189383Z","title":"Treinish, J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.189383Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:591de4419f0d5d696aaaf7cdb1a1fe94dfd7badfab2a45e82ff97e07e9feed95","observation_id":"34a2cc92-0a36-4e3d-939b-8d703188cdaf","resolution":{"observed_at":"2026-08-02T18:17:31.189383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.191834Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.191834Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:6c96892393d93f413da34c1b5454b936f546fc2f5589f53aa4dd0a6afbdea1b9","observation_id":"55954fd9-4cec-4738-8a16-fbd43f8bd9fb","resolution":{"observed_at":"2026-08-02T18:17:31.191834Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.194464Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.194464Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:c2174d9e8f287080612f4a9005e6f93b4009a81b1d29a5e270d4378b535530f3","observation_id":"f7ab81b9-6c20-400d-9708-35d9f2654cd2","resolution":{"observed_at":"2026-08-02T18:17:31.194464Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.196708Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.196708Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:08209118a2b7067267059d068abeecd247b54609ec259c56f5679c8b9b447269","observation_id":"c61f4574-6851-4895-9ba3-bb5f48fd09ea","resolution":{"observed_at":"2026-08-02T18:17:31.196708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.199625Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.199625Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:c019a18504a2e5e4ce36f54774f5ad8702e633025dbdb815a391c4923e32795f","observation_id":"40bff11d-2e74-42cd-aaef-e17ce7120ba9","resolution":{"observed_at":"2026-08-02T18:17:31.199625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.202271Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.202271Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:8ea9c4e014f0097d573b2d0f14b56e1e5c2c39a35c869c90e093d77986ea34fd","observation_id":"5f73d33a-1d18-4ce5-9035-c9d2dd6626e1","resolution":{"observed_at":"2026-08-02T18:17:31.202271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.204485Z","title":"Here, a low cosine similarity or KS- statistic score would indicate that the measured distribu- tion is similar to random sampling","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.204485Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:f1738b228e8da0e3872b71a4f8fa4e74e06776260644d9ec23d56d2e7fda2a49","observation_id":"2be553c1-ae1b-4819-9919-ce6473febb27","resolution":{"observed_at":"2026-08-02T18:17:31.204485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:17:31.207671Z","title":"In Table IV, the cosine similarity and TABLE IV: Cosine similarity and KS-statistic scores for comparisons between theS1,S2,B1andB2 distributions","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-02T18:17:31.207671Z"},"links":{"citing_paper":"/paper/2603.13160"},"observation_digest":"sha256:f680db856de064e73fb29e12b21df631c138e49c7c2a3fac91183112b470d1b2","observation_id":"6245ccf2-1a0a-4f9e-8fd6-22eae9557c6e","resolution":{"observed_at":"2026-08-02T18:17:31.207671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2603.13160","last_updated":"2026-07-29T10:52:35Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T09:19:26.923568Z","submitted_at":"2026-03-13T16:51:19Z","title":"Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization"},"reference_resolution":{"displayed":68,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":63,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":68},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 68 of 68 outbound references and 1 inbound Pith citation observation for arXiv:2603.13160."}