{"as_of":"2026-08-18T22:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3448e549c0e1dc43bbd34aba8ab9c7b70018e2fd5acd91ed6a6344c587d723e0","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:43:18.177973Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.11579/citation-record","integrity":"/paper/2608.11579/integrity","json":"/paper/2608.11579/citation-record.json","paper":"/paper/2608.11579"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.620229Z","title":null,"venue":null,"work_id":"452dd4b6-0178-47e6-82ae-c204b5fe78a5","year":2004},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.771224Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:b05c20a9dda3eeb4d886f0ae0cea91179abb1d3d43d0508e81277998837bc56e","observation_id":"cf148fb1-277a-4361-9526-126487f9acb6","resolution":{"observed_at":"2026-08-16T00:43:19.625061Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.604899Z","title":"Egger, Bruce G","venue":null,"work_id":"8668e2f6-443c-4138-89a6-5410abde970b","year":2024},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.776971Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:e192026607f7f92edd3d4224deb44d6da13ba7c952c85c832221f26808e65c27","observation_id":"c506fa5e-c808-4738-ae8d-eab237e4ebea","resolution":{"observed_at":"2026-08-16T00:43:19.609726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.588673Z","title":"Brown, Giuseppe Carleo, Lincoln D","venue":null,"work_id":"12d83bbd-f27b-4ba5-b71d-3ebe83524385","year":2021},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.783166Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:2610756024122fe44223267e060bc9abc3c7fee2c2cb38688edd119cd4fbdd35","observation_id":"ba1e7282-aaee-43a0-aa77-8686d062fe56","resolution":{"observed_at":"2026-08-16T00:43:19.593423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.572501Z","title":null,"venue":null,"work_id":"fd8d6faf-6bc5-4990-9e1c-f8b43fba33d6","year":null},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.788441Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:51f48886afce5ca9cb03672085d4d7567c1571c59f55c6c12323e4e0353a15eb","observation_id":"e4ec1f81-f87a-4bc8-9631-7de1cab6bbec","resolution":{"observed_at":"2026-08-16T00:43:19.577656Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.539381Z","title":null,"venue":null,"work_id":"a1d9492c-7ef1-4284-ae5c-8379a2110c69","year":null},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.801224Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:2aca8bc41fdff17ef49be12b3442a3b29641342dd95b00775705807e94ff0761","observation_id":"055ffb42-46ab-4afa-959e-839a41cae47e","resolution":{"observed_at":"2026-08-16T00:43:19.546839Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.446843Z","title":null,"venue":null,"work_id":"e77e3cf8-23b6-46bc-8a64-3a7c02384534","year":2005},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.812703Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:6a7ae5c9b70206f0b12bee9f328338eb659564a98ffb0abb6fcd3ee4752450c2","observation_id":"964fad1f-4555-4fdf-825d-d8cb9fe2244b","resolution":{"observed_at":"2026-08-16T00:43:19.477655Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.388386Z","title":null,"venue":null,"work_id":"4694ceee-4453-4726-97fe-3499dffdb5a4","year":2021},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.819229Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:5f028e9962bcda21f34dca3f3b400eade27aed96ad46600e0c06625fc2847fb4","observation_id":"af8cb21b-f0b2-4b7c-8143-714e141228e1","resolution":{"observed_at":"2026-08-16T00:43:19.398308Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.373583Z","title":"Olson, Matthias Degroote, Peter D","venue":null,"work_id":"b438c20d-33ad-4e57-94b0-fb9605c93558","year":2019},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.823450Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:760ce88cb430576eee707bb61d0d04e9d1fa9b18a63871babf16ca9afcce2906","observation_id":"77efeccf-f5b7-4c03-b445-b80ed0dd0575","resolution":{"observed_at":"2026-08-16T00:43:19.378538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.357590Z","title":"Childs, Dmitri Maslov, Yunseong Nam, Neil J","venue":null,"work_id":"6c37a736-1f88-4a97-93ca-4a85841982f7","year":2018},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.828481Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:31ab44a160760884c5e96caf03a9d47af409cd43be95a65b3a640d4e399cfc1e","observation_id":"7a66add1-99a3-45b0-b274-eb475c4e1294","resolution":{"observed_at":"2026-08-16T00:43:19.362864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.340515Z","title":null,"venue":null,"work_id":"886f99a0-b503-4e70-b51e-a8141f42950c","year":2019},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.833514Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:fa171724b68562d67a2f77484b1d7488c02231333d2e7fd436e0b5e89e7e97e9","observation_id":"4616a8f9-b28d-419b-a415-2f0159cc943a","resolution":{"observed_at":"2026-08-16T00:43:19.345416Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.323662Z","title":"Dalzell, Sam McArdle, Mario Berta, Przemyslaw Bi- enias, Chi-Fang Chen, András Gilyén, Connor T","venue":null,"work_id":"c3b963c0-23ef-4b39-bc6b-4d726408e73c","year":2025},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.838068Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:9ff07d7f52ddc8f0b8ea552b3dedfe49cc6cadbf8d913a5ae9b904640b266e66","observation_id":"dd4d627e-5f81-4769-adaf-a4188e7100ef","resolution":{"observed_at":"2026-08-16T00:43:19.329479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.14448","last_updated":"2025-03-18T17:27:50Z","snapshot_observed_at":"2026-08-16T12:48:54.140773Z","submitted_at":"2025-03-18T17:27:50Z","title":"Pauli Network Circuit Synthesis with Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.14448","snapshot_observed_at":"2026-08-16T00:43:17.842624Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.842624Z"},"links":{"cited_paper":"/paper/2503.14448","citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:314d3685db9e14dee86f8ba8de2569c94c67880ea6708418f8520d32b7eb3cbd","observation_id":"3155c9d2-3d6e-41ff-ba01-a27d853318ad","resolution":{"observed_at":"2026-08-16T00:43:17.842624Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-08-16T20:17:55.570300Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-16T00:43:17.847529Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.847529Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:2e7a4399b1f5814f9c9cc030648d3d8b6af597b223a1de9453fd23e701479fe9","observation_id":"06732a19-66f1-415e-9e51-82dc49781275","resolution":{"observed_at":"2026-08-16T00:43:17.847529Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.307788Z","title":null,"venue":null,"work_id":"929ed4fb-972d-48aa-bb0e-5f28860d92ab","year":1982},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.852918Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:b1ddbe4d71881d1115b79b416e3867250747f1a35669d01dc77551fd09faeba4","observation_id":"bf3a9565-d3b4-47b0-b0c1-f2d024086fc3","resolution":{"observed_at":"2026-08-16T00:43:19.312567Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.291567Z","title":null,"venue":null,"work_id":"869a139d-e1c6-4ac3-b57d-b0de551a0985","year":2014},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.857548Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:bd1d2ef3f153ec83e0b6c7c8ca26e2b1c639f6036497aac53a035186cde91d0b","observation_id":"e62992af-97ea-4616-9257-3e61c622a494","resolution":{"observed_at":"2026-08-16T00:43:19.296544Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03280","last_updated":"2024-04-04T08:07:22Z","snapshot_observed_at":"2026-08-16T14:03:43.015729Z","submitted_at":"2024-04-04T08:07:22Z","title":"Faster and shorter synthesis of Hamiltonian simulation circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.03280","snapshot_observed_at":"2026-08-16T00:43:17.862168Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.862168Z"},"links":{"cited_paper":"/paper/2404.03280","citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:973555846a38766d64574e80ebbfb4b3b0cb60b047278b628a115aa9e92de5a1","observation_id":"feab6c4b-4d0f-484b-819b-e86699d4a91f","resolution":{"observed_at":"2026-08-16T00:43:17.862168Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.220764Z","title":null,"venue":null,"work_id":"b769d5a1-f67f-4577-a942-22eff48a3572","year":2022},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.866600Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:7f179699dbb765050b4ec3a18c42bbded8d8726b2289e06d21cb7b98d203436b","observation_id":"d435612d-a171-4742-ae2e-56d7cd4a5a7e","resolution":{"observed_at":"2026-08-16T00:43:19.246800Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:43:17.872292Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.872292Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:fc61aa2c62bf9db7b09afba92d3761785eaa60f9aa5a633e312aaf08f87d76dc","observation_id":"31bf2be2-0a33-4798-adff-25b449cb5fb4","resolution":{"observed_at":"2026-08-16T00:43:17.872292Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.160778Z","title":null,"venue":null,"work_id":"a5fc6e77-faa6-47dd-9e06-199c94efbfc1","year":2024},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.877420Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:4dde3b56108a99e9a153afb99825d71ec034fef01aac895119f7f99135a0f607","observation_id":"ced84e6b-77e6-4803-9f99-16d37087bafb","resolution":{"observed_at":"2026-08-16T00:43:19.165717Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.144324Z","title":null,"venue":null,"work_id":"3bda595f-03cd-40f3-bd3b-440470bdf501","year":2020},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.881966Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:dab7d2bd5321f4a276530495485d6fad62da13beac4c07ee57a83d70bb2634ee","observation_id":"02f02be7-7e0c-4f7a-9a7e-480ea0002362","resolution":{"observed_at":"2026-08-16T00:43:19.149909Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.128003Z","title":null,"venue":null,"work_id":"0a1a707a-ebf8-460d-b4b3-a71098cc0922","year":2026},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.886625Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:ce38d33721f4746005c146ae612ed5f5b77fc3040f6fb04d0d75c1f5aa34e873","observation_id":"5500aa61-b9cb-46b3-88fc-21a2ce419f2d","resolution":{"observed_at":"2026-08-16T00:43:19.133378Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.109650Z","title":null,"venue":null,"work_id":"25c91ac6-215c-466a-b12b-b1ecdf808f82","year":2022},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.891494Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:ce1e5997851fc561b9175314dd01f1f10d49c64efe6c150608eb270021fe3cb1","observation_id":"2c62ace0-8517-44bf-a10d-fcded636e7b8","resolution":{"observed_at":"2026-08-16T00:43:19.114978Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:43:17.895795Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.895795Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:13ae8738007449661397858e3bc76d81374975f333ccfd6a56f5dcca84f4f48f","observation_id":"117b2c68-b406-4b5b-a474-16e7b93634f5","resolution":{"observed_at":"2026-08-16T00:43:17.895795Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.082666Z","title":null,"venue":null,"work_id":"ede2e3fe-8206-4517-b8f6-7913a3111d6e","year":2022},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.900229Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:d617180c0b337ce2683c73bfb8bb5d6d5281a1a02ba7d12f0a11413a457f0fc3","observation_id":"6e549fdb-fb65-499d-9e5b-58dbf7d9b71f","resolution":{"observed_at":"2026-08-16T00:43:19.087375Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.064479Z","title":null,"venue":null,"work_id":"250ca836-d0be-4c34-b7ba-586651afd2fe","year":null},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.904782Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:01683ff16f675ef9eb929647d40fcf06478ab8efa20f51ec2d26660fbbb1a30e","observation_id":"901d5df5-a9ce-423d-aa3d-9bb1bab658d4","resolution":{"observed_at":"2026-08-16T00:43:19.069947Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.027282Z","title":null,"venue":null,"work_id":"209ac1b2-53e4-436e-a2e9-27db182ae7ee","year":2019},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.915074Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:4c44d56ece8a8d0c8c70351842559676826a5c4674999990a6ed1e040c5424e1","observation_id":"c254df98-e100-4793-9047-815995b4b683","resolution":{"observed_at":"2026-08-16T00:43:19.032143Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:43:17.920456Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.920456Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:882ab6d47113e94d4c92d29a3a8aa861b12a87fb2f8ce27ec33890369602a6d4","observation_id":"5df9cfec-304b-484b-843f-bccc22ae2c1b","resolution":{"observed_at":"2026-08-16T00:43:17.920456Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.001049Z","title":null,"venue":null,"work_id":"a7101f76-d5af-439e-b196-f0b9338df911","year":2025},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.925727Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:d9dedf7703d042f2e0ceb3376a85ddb1d8fe672520c74f8c2586dd8920edda41","observation_id":"e45e4073-a343-4ebe-acb0-b8ebc56e17b3","resolution":{"observed_at":"2026-08-16T00:43:19.006060Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:43:17.930543Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.930543Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:cfc12affb301f8e17b296819c890e1277ed843e0411eecfdacfd7ee6fb79f6cb","observation_id":"8d447660-d5bf-4973-9d19-90ce0ffab652","resolution":{"observed_at":"2026-08-16T00:43:17.930543Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.972589Z","title":null,"venue":null,"work_id":"69b3f859-c5bf-45d6-a203-793b1ef50c5f","year":2019},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.936144Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:8cbe4a0c6df090cbdd8f6edb17c6913874d6c724229be072d57948db7aae13b3","observation_id":"f5ee5b2a-912b-470b-b3a1-d9bc95b1cd0f","resolution":{"observed_at":"2026-08-16T00:43:18.978866Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.955219Z","title":null,"venue":null,"work_id":"be2ac71a-700d-4e54-89b9-6eb4a264cae2","year":2026},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.940826Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:50fc44e17d1639848498cd7f61f7ee5af2545fe1830a18a491c2ddd660356486","observation_id":"f385f9c6-515e-4e66-92d7-0117179b431a","resolution":{"observed_at":"2026-08-16T00:43:18.959828Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.938925Z","title":null,"venue":null,"work_id":"00b1e9ff-fb7d-40eb-b075-6ed847003385","year":2018},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.945362Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:178135926ce09cf85130bfe3c81ce63f38aa3de569682b535136b276121d95b9","observation_id":"721687f4-ef78-4cff-8b1f-ac56592b2b0b","resolution":{"observed_at":"2026-08-16T00:43:18.943897Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.921675Z","title":"Benjamin, and Xiao Yuan","venue":null,"work_id":"a5e04562-9b1a-4045-949d-cd1ee5959a91","year":2020},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.950341Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:867523fa1dd1c224d3f67a3dc64e0439f98f1c6e3d26fba6fe899fdd3e0d5461","observation_id":"fed617af-ff90-4546-af68-064380db2fa9","resolution":{"observed_at":"2026-08-16T00:43:18.927664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.870305Z","title":null,"venue":null,"work_id":"41b661f9-0469-4a81-915d-1302619c0e03","year":2023},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.955785Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:226271715e05b6c669e07639e3815b9ded376b16ad806248bcd93a5b91764f95","observation_id":"1fe642d1-5d5e-4943-8f35-8ff523f91b56","resolution":{"observed_at":"2026-08-16T00:43:18.894445Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.814207Z","title":"Nation, Abdullah Ash Saki, Sebastian Brandhofer, Luciano Bello, Shelly Garion, Matthew Treinish, and Ali Javadi-Abhari","venue":null,"work_id":"32b806e8-961a-4bd2-9e3b-b1e4aa310a91","year":2025},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.960876Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:214829b37103ce2d16da8d56097a538bb0ca3b930605b7b76b88084298a6ff26","observation_id":"cd443cec-8258-4293-b612-5ca401e024d7","resolution":{"observed_at":"2026-08-16T00:43:18.841309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:43:17.966633Z","title":"2010.Quantum computation and quantum information","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.966633Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:a6bab7bf321b95a40f11628a8dc5b341422983cec65f7bcea35a4f1fab3d4c5f","observation_id":"d913ca90-7b70-4a48-82ee-60481332775b","resolution":{"observed_at":"2026-08-16T00:43:17.966633Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.771244Z","title":null,"venue":null,"work_id":"5ffe72b4-be5a-4b32-bc85-971bd9f82dae","year":2023},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.971707Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:39e06afe37a0f563ccbafdbf875877fee2125e421fe0317b34a45cc9404b155b","observation_id":"4cc62ee0-714b-4215-ae20-a638429a1557","resolution":{"observed_at":"2026-08-16T00:43:18.776172Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.755652Z","title":null,"venue":null,"work_id":"5057606b-ceb7-4392-acc1-4f43c74598d0","year":null},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.995838Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:0b5e639c6ae889ed7e879a8bf748b17a8921ec499b32480a23cde9c2b80caf1b","observation_id":"5585f6e9-562e-4e02-b47b-c9beeb9fa379","resolution":{"observed_at":"2026-08-16T00:43:18.760825Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.720837Z","title":"McClean, Cornelius Hempel, Peter J","venue":null,"work_id":"37772b90-c93f-4a9a-b7aa-2e7f6a45f372","year":2018},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:18.007460Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:33ec0082a96c0ace65e9e6bcffab4029ee5432b3655aa5aed67a641690e3aab6","observation_id":"f7101a93-e968-4f93-9bee-35e323630146","resolution":{"observed_at":"2026-08-16T00:43:18.726773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.622509Z","title":"Ross and Peter Selinger","venue":null,"work_id":"5fe05932-89ca-452a-8d4e-28a556d47095","year":2016},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:18.013005Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:c4d42829bf5fc5df10f7621972347046282d4607ad33d79756df6dcfa709c1d1","observation_id":"1da93e79-aedb-44e8-b28f-64647170ada0","resolution":{"observed_at":"2026-08-16T00:43:18.703035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.489286Z","title":null,"venue":null,"work_id":"2116f1a2-e4e8-4683-91c0-d2800cbaca58","year":2024},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:18.017742Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:49ffcce5e84813d0472285f9a0d2e998b2ec026c7afcd7c59b5ebb2e11ab302d","observation_id":"2a552bb0-23f1-4da5-ac8b-73f44e6e2f6d","resolution":{"observed_at":"2026-08-16T00:43:18.543332Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.444826Z","title":null,"venue":null,"work_id":"0bb65cef-9045-4fb6-b014-717a6fcd5a4c","year":null},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:18.030005Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:d79d8df942985647e2d71556c2292b225f6ae3b68ad1772b81636ea90ced9af3","observation_id":"292568ff-2f3d-4c3d-9e02-7c7ccc1187ed","resolution":{"observed_at":"2026-08-16T00:43:18.464750Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:43:18.059230Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:18.059230Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:2ba83f82e8d56850b60ff71047486bd991a536ee7c03aa61dd5b81a2afab0686","observation_id":"c2e9d3a6-0ba1-46f3-a2cb-5b34e9d08901","resolution":{"observed_at":"2026-08-16T00:43:18.059230Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.403934Z","title":null,"venue":null,"work_id":"00b0b4b0-b5f3-48f3-a355-7a5213c62075","year":2021},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:18.066443Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:0655c053bb802519a08918253ff3284e0611eb7ecc70f61708357dd431e9243a","observation_id":"168218b5-de8f-4e6e-aa32-5c215094bd35","resolution":{"observed_at":"2026-08-16T00:43:18.409133Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.387647Z","title":null,"venue":null,"work_id":"19ebf346-c75b-4d34-af30-ac2af6dddd22","year":1990},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:18.072576Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:82a8fc6ee486152a3fd623964c2db1326916fa4b58f48b77e55363a73adb2590","observation_id":"fcbedd45-7045-4797-9898-f94a177a609e","resolution":{"observed_at":"2026-08-16T00:43:18.392290Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.372986Z","title":null,"venue":null,"work_id":"08ba4eeb-5542-472b-9082-40697aaf26f6","year":2021},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:18.077605Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:c5510035847d16e886c8a7c0f0d51004e48cd1e40bf373d7b0c468f017a3f7a7","observation_id":"720ab170-948e-4040-88fd-9f03c2ced7a5","resolution":{"observed_at":"2026-08-16T00:43:18.377645Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.357669Z","title":null,"venue":null,"work_id":"072037cb-be00-4424-9a37-1883ce9e3f42","year":1959},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:18.090142Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:596127a15c8650d796882e5ee42c36c47a07d4e2e4e8ae97434cc468880c9b4f","observation_id":"6cab31d4-53c9-4f7b-8f91-034fb84471c0","resolution":{"observed_at":"2026-08-16T00:43:18.362468Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T00:43:18.096195Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:18.096195Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:eb9b373ad83a3adc57860489a9e8708accc3c060a9e20209ebe491b1ac44e788","observation_id":"b1afdb19-7e71-48ef-a3f9-6ce43680bb35","resolution":{"observed_at":"2026-08-16T00:43:18.096195Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.331020Z","title":null,"venue":null,"work_id":"ccbaabb0-f933-4278-ba6a-8b76aa939b42","year":null},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:18.119009Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:53bbde1edf4c048a6ab7df87d6bddbcfce9b1640299dc27a23d7b29c643b0cdd","observation_id":"a6d143d0-6d06-4527-bae0-6da41a0bec6a","resolution":{"observed_at":"2026-08-16T00:43:18.336105Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.301154Z","title":null,"venue":null,"work_id":"30d2f5b9-7264-4349-abdd-c16257571842","year":2025},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:18.149675Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:0643b47eb6244704c38b510602c9a8211262104288e3edb4a5f5d6f166bc3027","observation_id":"525a6182-b408-4995-916c-74c8adba1f9c","resolution":{"observed_at":"2026-08-16T00:43:18.305868Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.281479Z","title":null,"venue":null,"work_id":"d8ece029-5107-48bd-b25f-a1ea3c42adc3","year":2026},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:18.167629Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:5699891052cc4bf77592c001879182ecb9c449bc6650f1bfe7f07783dcdc8036","observation_id":"e59d2c4b-d6ae-4e8c-b252-ceb31646f2f5","resolution":{"observed_at":"2026-08-16T00:43:18.290102Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.08368","last_updated":"2024-09-12T19:19:59Z","snapshot_observed_at":"2026-08-16T13:31:12.765837Z","submitted_at":"2024-09-12T19:19:59Z","title":"LightSABRE: A Lightweight and Enhanced SABRE Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.08368","snapshot_observed_at":"2026-08-16T00:43:18.177973Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:18.177973Z"},"links":{"cited_paper":"/paper/2409.08368","citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:e3b87ebb89951db14de3e960232fce6c1c7fe8b5077a538f81d95279c1539555","observation_id":"73e3b46f-75ff-4bdd-a5ac-c123300f19ef","resolution":{"observed_at":"2026-08-16T00:43:18.177973Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.557060Z","title":null,"venue":null,"work_id":"e4a9a061-b46f-46e1-8ec4-2b57ac1b5e1c","year":2013},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.793955Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:1a9eb307cdf65956bcec5de2c3d7270afc7ba72dbeec6e952d4693350cf2c2c8","observation_id":"4542d572-36f7-4465-99f1-c1cb2fe999e8","resolution":{"observed_at":"2026-08-16T00:43:19.561543Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.739184Z","title":"Nature communications5, 1 (2014), 4213","venue":null,"work_id":"b26a5310-d579-41e3-8c7b-671b7f44c2f4","year":2014},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:18.001788Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:61c9d2c238cb657adacf230243fd097fbe833e6cf9fb8a04a2843da6ccf03367","observation_id":"93e35139-ab3f-4043-a9c1-381215b1ba34","resolution":{"observed_at":"2026-08-16T00:43:18.744411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.494263Z","title":null,"venue":null,"work_id":"18f85dfe-239c-45ef-bbd9-69cafc81aab6","year":2020},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.807785Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:89e204dde1279ea703490e86c0d4c22010ba1b6b1acfabe4593385b034453e22","observation_id":"584fea1d-be8c-465f-8410-358992aa2cbf","resolution":{"observed_at":"2026-08-16T00:43:19.511097Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.315914Z","title":null,"venue":null,"work_id":"a6699f11-2865-4b44-a3e6-33ed79482288","year":2022},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:18.139801Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:bde8f9e685cadfb911b5a16c1588bb5215bcb42afb2408fd3411405bd9be0d34","observation_id":"ad4e1b74-31a3-473c-9d62-276650ba77a1","resolution":{"observed_at":"2026-08-16T00:43:18.320490Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:18.428870Z","title":null,"venue":null,"work_id":"65560c95-10f4-4fcf-b740-5d1d7d97fef5","year":2024},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:18.046071Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:8bb2a09c7ea8e3160ced8aa49f3c253ae915b53cc2cee8cca5d2bfb9aabe4409","observation_id":"bfb838b8-a6c0-4061-9752-5a2692429158","resolution":{"observed_at":"2026-08-16T00:43:18.433653Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:43:19.043512Z","title":null,"venue":null,"work_id":"13205558-b041-47f6-a5f7-ccbd7c83a911","year":2025},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.910563Z"},"links":{"citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:ae1cb24163f38c7995d3f03c3e48d3c231ea86c57ddadc54f31bd2086b33bd09","observation_id":"52df3dcb-6e61-42f8-a1e5-fe381f7e3717","resolution":{"observed_at":"2026-08-16T00:43:19.048948Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-17T06:19:04.789115Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":48,"verified_exact":0,"verified_fuzzy":10},"total_outbound_references":58},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2608.11579."}