{"as_of":"2026-08-12T16:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:317e7af8719ae7ec075348386d2b4ca7d8be531deb03d1eff180a8429f0c1665","coverage":[{"denominator":63,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":63,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T19:24:33.621541Z","state":"measured"},{"denominator":64,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":64,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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-05-10T03:22:26.487817Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T12:31:06.858758Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"cited_work":{"arxiv_id":"2412.06909","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.06909","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A generic multi-pauli compilation framework for limited connectivity","venue":null,"work_id":"040f979d-a722-47db-a7c5-87d5d921bd82","year":2024},"citing_paper":{"arxiv_id":"2604.19029","last_updated":"2026-04-21T03:26:25Z","snapshot_observed_at":"2026-08-11T00:22:39.638444Z","submitted_at":"2026-04-21T03:26:25Z","title":"MonteQ: A Monte Carlo Tree Search Based Quantum Circuit Synthesis Framework","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T03:22:26.487817Z"},"links":{"cited_paper":"/paper/2412.06909","citing_paper":"/paper/2604.19029"},"observation_digest":"sha256:d2a8ee42f100ce773935c213b7e66e8d2586f0979914c198b43a2feedc1f0235","observation_id":"6e4ffaf5-7fbe-4f0a-89bf-feafa592e67c","resolution":{"observed_at":"2026-05-11T12:31:06.865347Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.06909/citation-record","integrity":"/paper/2412.06909/integrity","json":"/paper/2412.06909/citation-record.json","paper":"/paper/2412.06909"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:24:33.150325Z","title":"Quantum computing in the NISQ era and beyond,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.150325Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:814dc6d43339ef4822314da05998221694a21b4332852e8f5324c33052c3fb62","observation_id":"1840b19d-b451-4b86-ba6f-3faaa938e3d0","resolution":{"observed_at":"2026-08-11T19:24:33.150325Z","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-11T19:24:35.344932Z","title":"Simulating physics with computers,","venue":null,"work_id":"aaac1e43-b790-41ef-81cd-5bb9f3f2d5f7","year":2018},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.157162Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:27f949b97c27f9b9ed9e5c105fb20dd6b8e5fe776ca22fbd7059536562f878a9","observation_id":"a2a68fab-e6b4-40be-ad39-7e0e46d74cac","resolution":{"observed_at":"2026-08-11T19:24:35.360390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:35.317909Z","title":"Potential of quantum computing for drug discovery,","venue":null,"work_id":"8f444a37-1b02-46bb-a100-6b8a900a6a4b","year":2018},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.164631Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:af0a44838cdfdf55646e412e1b73899014ce5f953837087e51ed7b214d9f68a5","observation_id":"ca91d524-1fb2-4a53-b7a2-d23feb3f0cb3","resolution":{"observed_at":"2026-08-11T19:24:35.323816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.12405","last_updated":"2022-06-22T09:05:24Z","snapshot_observed_at":"2026-08-12T11:29:29.088531Z","submitted_at":"2022-06-22T09:05:24Z","title":"Quantum network medicine: rethinking medicine with network science and quantum algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.12405","snapshot_observed_at":"2026-08-11T19:24:33.171489Z","title":"Quantum network medicine: rethinking medicine with network science and quantum algorithms,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.171489Z"},"links":{"cited_paper":"/paper/2206.12405","citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:70f325ae4c6ee2819b149f226503c1fe614547b1bf792c0b5cbd518ca87146c5","observation_id":"51bba81e-99a8-4991-9a60-fbdee8cf64bd","resolution":{"observed_at":"2026-08-11T19:24:33.171489Z","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-11T19:24:35.298734Z","title":"Quantum algorithms for quantum chemistry and quantum materials science,","venue":null,"work_id":"0a8ac9dd-0e70-4bb0-ab0d-b216f46d451f","year":2020},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.179781Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:a1f0d1d045320fd95aff5d335454778f65b0912f69d99d1d76e4cee2a5c2a32b","observation_id":"331b64b5-8c4c-479f-8844-53d981c6a4d2","resolution":{"observed_at":"2026-08-11T19:24:35.304742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:35.277982Z","title":"Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors,","venue":null,"work_id":"e3574e10-20c8-4e26-bce6-5c62fe8db3f7","year":1999},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.185206Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:672199e93bee47b65393c28a3dc0991d0988ac974ea34afad3f835b23bb6cbc8","observation_id":"4d3bfda4-d9a8-4cf9-858e-7efbbe690316","resolution":{"observed_at":"2026-08-11T19:24:35.285171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:35.253327Z","title":"A variational eigenvalue solver on a pho- tonic quantum processor,","venue":null,"work_id":"990520a8-9a80-477d-9e09-fee5c666885d","year":2014},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.194817Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:e2bea66bbfb3164bc83a86b0e52ddafc8559fb985b792d01e955288dc633b532","observation_id":"78a0a6fa-4526-4e1a-9c80-048c6bbf68bf","resolution":{"observed_at":"2026-08-11T19:24:35.261684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:35.218028Z","title":"Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz,","venue":null,"work_id":"e896bb9f-ebc0-477d-bdaa-ddd028c81cc0","year":2018},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.202641Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:03fb8f03b4a2dc8ab308454a8c3a83c6b8a0b70f5810f20be09b989b3e159bb8","observation_id":"5dfae73e-423c-4dfd-a2c7-028c47819e3e","resolution":{"observed_at":"2026-08-11T19:24:35.231419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:33.208319Z","title":"Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.208319Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:bf897880978175bd5917b4b2e61832eb831e8c165ae81bcd1d2ae0cb9562ff48","observation_id":"1aa07bd5-b0c2-4411-926e-f831a6f89442","resolution":{"observed_at":"2026-08-11T19:24:33.208319Z","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-11T19:24:35.174510Z","title":"An adaptive variational algorithm for exact molecular simulations on a quantum computer,","venue":null,"work_id":"520e2605-4bf4-421e-9561-949f4c703bee","year":2019},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.214127Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:3f0035fdcb394114587647102f866cc559fd221ce50d9442fe38492a36add281","observation_id":"1c12e858-5511-4e9a-b978-303ad50426b6","resolution":{"observed_at":"2026-08-11T19:24:35.183636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:35.145452Z","title":"qubit-adapt-vqe: An adaptive algorithm for constructing hardware-efficient ans¨ atze on a quantum processor,","venue":null,"work_id":"ab788a72-322d-4354-ad76-4eba3bd0d51a","year":2021},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.221730Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:6ff867e6291e742a8c07646aea68d5fbabe7615e21d73e2444efe0a555e1ff71","observation_id":"79cc3adf-1b60-47fe-9151-2b5b3a50c752","resolution":{"observed_at":"2026-08-11T19:24:35.154065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:35.114592Z","title":"Qubit- Excitation-Based adaptive variational quantum eigensolver,","venue":null,"work_id":"a2e730ed-ce6a-45d2-aa5f-073f90567646","year":2021},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.228683Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:edcf46785c446971b33bd09ad7d32c23d5b7f2bc5edc64659b3de94a8cfdf73f","observation_id":"2f8c59ad-577d-4d28-b363-b3c1a44cf492","resolution":{"observed_at":"2026-08-11T19:24:35.124326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08696","last_updated":"2025-05-12T17:35:24Z","snapshot_observed_at":"2026-08-12T06:22:10.908927Z","submitted_at":"2024-07-11T17:31:30Z","title":"Reducing the Resources Required by ADAPT-VQE Using Coupled Exchange Operators and Improved Subroutines","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.08696","snapshot_observed_at":"2026-08-11T19:24:33.244447Z","title":"Reducing the resources required by ADAPT-VQE using coupled ex- change operators and improved subroutines,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.244447Z"},"links":{"cited_paper":"/paper/2407.08696","citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:de6f5be4a5540a652dae2959c28c9b2f93be1bd489f6c509757111831853c528","observation_id":"87d141f1-488d-4872-bba4-ba0e9d5a9522","resolution":{"observed_at":"2026-08-11T19:24:33.244447Z","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-11T19:24:35.090253Z","title":"Tetris- adapt-vqe: An adaptive algorithm that yields shallower, denser circuit ans¨ atze,","venue":null,"work_id":"b42200c5-b8fb-4939-995c-ac4a9914605e","year":2024},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.256911Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:e3b82057602a3e24810bfc1e0b86ffd45760d4faa744d0320368bc566c02fcf6","observation_id":"d96829fd-9dcf-4717-a125-798a1d1940c1","resolution":{"observed_at":"2026-08-11T19:24:35.097446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:33.265421Z","title":"Mitigating the measurement overhead of adapt-vqe with optimised information- ally complete generalised measurements,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.265421Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:d6821e6b95507584d65ff042c1da2aee7e16d9eddb668728422c26136d80f963","observation_id":"590adb4c-ce20-40af-8f9b-46682638c8ba","resolution":{"observed_at":"2026-08-11T19:24:33.265421Z","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-11T19:24:35.066938Z","title":"Paulihedral: a generalized block-wise compiler optimization framework for quantum simulation kernels,","venue":null,"work_id":"b88113fb-473a-4516-9e8f-8f7c9cb807cc","year":2022},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.271735Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:fc9885581ef685fcbf3f2fcb1667f6499fec1185fcab5d97d0fa22422bb3ae51","observation_id":"ed94d81b-24f6-4dd1-9f15-879c2843da7c","resolution":{"observed_at":"2026-08-11T19:24:35.072519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:35.047191Z","title":"Tetris: A compilation framework for VQA applications in quantum computing,","venue":null,"work_id":"ac7d29a5-2387-4fb6-a79d-f6324dc4dd57","year":2024},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.278235Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:8d8fbf351cd970aadcc6f23a33180cf86ee6e506a20db33c780a5f02c21b4b59","observation_id":"ab2046ed-d68d-4582-8f0b-122bfd350612","resolution":{"observed_at":"2026-08-11T19:24:35.055008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:35.022195Z","title":"Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters,","venue":null,"work_id":"f6f733fa-1b1b-4465-bdc2-f629ecb3e84b","year":2020},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.288434Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:f7af318f76aed5e5ec03f414262062c2181f1683b4df8a963a85f0618f414eb1","observation_id":"d0d1ecc1-b0df-42a4-94bc-eff7caaa9488","resolution":{"observed_at":"2026-08-11T19:24:35.027889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.10515","last_updated":"2020-08-27T13:16:04Z","snapshot_observed_at":"2026-08-09T22:50:29.770322Z","submitted_at":"2020-07-20T22:26:16Z","title":"A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.10515","snapshot_observed_at":"2026-08-11T19:24:33.296388Z","title":"A generic compilation strategy for the unitary coupled cluster ansatz,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.296388Z"},"links":{"cited_paper":"/paper/2007.10515","citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:24a12c26f5f7986d02cb90d75b9a1276a5161083d261586968d4b1f374296209","observation_id":"1ff63eb8-f976-49d2-a1a6-aa4e6e2ca7ab","resolution":{"observed_at":"2026-08-11T19:24:33.296388Z","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-11T19:24:35.002491Z","title":"Meijer-van de Griend, Advances in Quantum Compilation in the NISQ Era","venue":null,"work_id":"2d8fe719-28c1-4ddd-aee3-3192994b57e7","year":2024},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.303458Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:2d915e376ff288a43f451577feb6947bd9389efd8ed4ddb2df5990ca89778828","observation_id":"442d1bee-0743-4466-99d8-94aca67bdf12","resolution":{"observed_at":"2026-08-11T19:24:35.008957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.06052","last_updated":"2023-11-15T12:30:56Z","snapshot_observed_at":"2026-08-11T06:53:44.917861Z","submitted_at":"2020-04-13T16:26:14Z","title":"Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.06052","snapshot_observed_at":"2026-08-11T19:24:33.312437Z","title":"Architecture-aware synthesis of phase polynomials for NISQ devices,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.312437Z"},"links":{"cited_paper":"/paper/2004.06052","citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:3723ab6cfe4cadb14c829b2d2ab7a56a9b97ca7ae04ea8b7507a3faa49f9769b","observation_id":"cf2aa3be-d57c-4209-9fec-3bedf74c5025","resolution":{"observed_at":"2026-08-11T19:24:33.312437Z","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-11T19:24:34.982254Z","title":"Phase polynomials synthesis algorithms for NISQ architectures and beyond,","venue":null,"work_id":"387d49b2-52cd-425f-bcdd-d38fb61144e8","year":2022},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.318954Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:0eb1f76553bf2487df9353139fa398db4b56cad642a9633a9d87341ddcf52d2f","observation_id":"0e9c5d68-52b2-4699-838d-878396f1420e","resolution":{"observed_at":"2026-08-11T19:24:34.988703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.01859","last_updated":"2018-08-13T15:01:18Z","snapshot_observed_at":"2026-08-09T01:05:36.755079Z","submitted_at":"2017-12-05T19:00:19Z","title":"On the CNOT-complexity of CNOT-PHASE circuits","version":2},"cited_work":{"arxiv_id":"1712.01859","doi":null,"metadata_source":"pith","pith_arxiv_id":"1712.01859","snapshot_observed_at":"2026-08-11T19:24:33.889630Z","title":"On the CNOT-complexity of CNOT-PHASE circuits","venue":"quant-ph","work_id":"e98074e1-50ae-474e-9385-f1cd1f37e63f","year":2017},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.327893Z"},"links":{"cited_paper":"/paper/1712.01859","citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:f41db7bba840db7b38ab685e2d4222cdf3bfff24645737ae14c1f679c131e02d","observation_id":"9b511db5-a7e8-45e2-b108-e0b62acf329c","resolution":{"observed_at":"2026-08-11T19:24:33.901064Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.960651Z","title":"Quantum circuit optimizations for NISQ architectures,","venue":null,"work_id":"4981bca1-ee5c-413f-a522-a1d362a7ada6","year":2020},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.337242Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:3d0f6300fc033a2bae354e401254412b4e810f808cd2c163c0139aebdead66f4","observation_id":"c221510f-d2f8-4d91-a9f7-373f3546b0d8","resolution":{"observed_at":"2026-08-11T19:24:34.967386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.00633","last_updated":"2019-05-26T20:00:01Z","snapshot_observed_at":"2026-08-03T05:02:35.979959Z","submitted_at":"2019-04-01T08:26:00Z","title":"CNOT circuit extraction for topologically-constrained quantum memories","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.00633","snapshot_observed_at":"2026-08-11T19:24:33.346698Z","title":"CNOT circuit extraction for topologically-constrained quantum memories,","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.346698Z"},"links":{"cited_paper":"/paper/1904.00633","citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:6a7cc101e484cd0cb30ff64f5f42debb65d1a5d39f44c434a8c18147cbbd1137","observation_id":"17f09f6d-611c-493d-82ce-66e49ec764e6","resolution":{"observed_at":"2026-08-11T19:24:33.346698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.08814","last_updated":"2024-09-19T18:33:10Z","snapshot_observed_at":"2026-08-09T10:33:08.328589Z","submitted_at":"2023-04-18T08:25:47Z","title":"A Comparison of Quantum Compilers using a DAG-based or phase polynomial-based Intermediate Representation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.08814","snapshot_observed_at":"2026-08-11T19:24:33.357540Z","title":"Towards a generic compilation approach for quantum cir- cuits through resynthesis,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.357540Z"},"links":{"cited_paper":"/paper/2304.08814","citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:79f836452810fe48f27aa2a003ac74cd3a5fcbf08251bfb5f0dd05349c4b9495","observation_id":"494af508-c4f5-420e-a6c6-a90c633c3e1e","resolution":{"observed_at":"2026-08-11T19:24:33.357540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.11839","last_updated":"2023-11-15T11:45:05Z","snapshot_observed_at":"2026-07-06T13:24:02.173160Z","submitted_at":"2022-06-23T17:11:12Z","title":"Annealing Optimisation of Mixed ZX Phase Circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.11839","snapshot_observed_at":"2026-08-11T19:24:33.368739Z","title":"Annealing optimisation of mixed ZX phase circuits,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.368739Z"},"links":{"cited_paper":"/paper/2206.11839","citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:6d80f070999ec6ae48174e9af5bb8bb30f0eb37a85b79de5ebe3233ee52e21ce","observation_id":"73caf37b-5092-4566-b923-18f8f890be0b","resolution":{"observed_at":"2026-08-11T19:24:33.368739Z","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-11T19:24:34.937586Z","title":"A recursively partitioned approach to architecture-aware ZX polynomial synthesis and optimization,","venue":null,"work_id":"17875d74-a7a2-469a-9e28-1f8fa30cf501","year":2023},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.374673Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:5cdac4fd6f90c52bdcd64fa5c263c223c79442d28ad654303a31d5d42b89af4b","observation_id":"e682ce0f-f2f1-4fd9-bfaf-bcdcdc603a66","resolution":{"observed_at":"2026-08-11T19:24:34.944813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08T17:43:00.200467Z","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-11T19:24:33.384804Z","title":"Faster and shorter synthesis of hamiltonian simulation circuits,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.384804Z"},"links":{"cited_paper":"/paper/2404.03280","citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:de18cc956489a8822ed2b96ca097a5860d10cb6b9d1e8269e0f7bb5ae96ba40d","observation_id":"796eea88-599e-4b0c-9290-1b1400705dab","resolution":{"observed_at":"2026-08-11T19:24:33.384804Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.13316","last_updated":"2025-02-22T03:10:31Z","snapshot_observed_at":"2026-08-12T11:28:17.199453Z","submitted_at":"2024-08-23T18:03:57Z","title":"QuCLEAR: Clifford Extraction and Absorption for Quantum Circuit Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.13316","snapshot_observed_at":"2026-08-11T19:24:33.392305Z","title":"Quclear: Clifford extraction and absorption for significant reduction in quantum circuit size,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.392305Z"},"links":{"cited_paper":"/paper/2408.13316","citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:3ca770eba55c5f209ce5ff61a574f6ddb57eecf962a33a1fbcfaea05e1c23f72","observation_id":"d95a694e-5a3b-4ad8-849b-780de8b4d4ce","resolution":{"observed_at":"2026-08-11T19:24:33.392305Z","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-11T19:24:34.915269Z","title":"A greedy search algorithm for the construction of architecture-aware Pauli-exponential-Clifford circuits,","venue":null,"work_id":"59d42e10-e24c-4d9c-bade-bcd78dbb1282","year":2024},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.399489Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:2dd1f88968c23c7b6deaa0fc357fc1262ade07471be6b3cb6ff6a006125b41f3","observation_id":"77a2f30c-dca2-4440-8b58-882e4e03a5a2","resolution":{"observed_at":"2026-08-11T19:24:34.922233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.894027Z","title":"Architecture aware compilation of quantum circuits via lazy synthesis,","venue":null,"work_id":"47105353-7c64-4174-b1c1-dece6c15ed16","year":2022},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.405246Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:39a09cbd83780e759071abe50d2053ea3520328c553ad48197e97f8661b4e0da","observation_id":"895ab38c-2983-4a9c-89ab-8cde5d9c5f53","resolution":{"observed_at":"2026-08-11T19:24:34.900960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.08972","last_updated":"2024-10-30T08:51:05Z","snapshot_observed_at":"2026-07-06T16:19:22.122087Z","submitted_at":"2023-09-16T12:11:56Z","title":"Architecture-Aware Synthesis of Stabilizer Circuits from Clifford Tableaus","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.08972","snapshot_observed_at":"2026-08-11T19:24:33.410770Z","title":"Architecture- aware synthesis of stabilizer circuits from Clifford tableaus,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.410770Z"},"links":{"cited_paper":"/paper/2309.08972","citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:38566cddeeba9defab807e5a1e2fe925bf3acd4bc735ec6d4416dd3f9f1537bb","observation_id":"36984d2d-4127-4226-a017-594c6537171d","resolution":{"observed_at":"2026-08-11T19:24:33.410770Z","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-11T19:24:34.864563Z","title":"Improved simulation of stabilizer circuits,","venue":null,"work_id":"5daba836-de17-43a1-8643-401183556391","year":2004},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.416547Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:1c4705e191dca7bb8d904b6ccdca23f7958a7a0328d3050ca0762f86988c9da2","observation_id":"e8690d56-44bc-41cc-9560-ba29dd20dbdb","resolution":{"observed_at":"2026-08-11T19:24:34.878589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03992","last_updated":"2024-07-29T14:08:20Z","snapshot_observed_at":"2026-07-06T17:40:37.837709Z","submitted_at":"2024-03-06T19:05:53Z","title":"Treespilation: Architecture- and State-Optimised Fermion-to-Qubit Mappings","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03992","snapshot_observed_at":"2026-08-11T19:24:33.423201Z","title":"Treespilation: Architecture- and state- optimised fermion-to-qubit mappings,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.423201Z"},"links":{"cited_paper":"/paper/2403.03992","citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:2243e24e9141085d70a2a2698f882637cbd9607c985ba4c1990688f700771b25","observation_id":"7a35a8ce-bafd-404e-9121-a13ca1eafcbb","resolution":{"observed_at":"2026-08-11T19:24:33.423201Z","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-11T19:24:34.835121Z","title":"Jordan and E","venue":null,"work_id":"3be18718-051d-4f8e-86ee-b7bd4e44c19c","year":1993},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.431271Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:0dbe9e7cc3519e56d7d667673022486b859f5aea826df48ab37accf3b3a615d9","observation_id":"0fdc96df-fb63-490a-859b-990f03d38ae3","resolution":{"observed_at":"2026-08-11T19:24:34.841912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.803597Z","title":"Fermionic quantum computation,","venue":null,"work_id":"b43d9f3f-73eb-4570-9288-72a103541668","year":2002},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.437184Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:4d115a5e3a684161607a5182e123c934675aa7c5fdf439fd721e9fa3de0d9fab","observation_id":"3e11d15b-7b35-4e00-8fef-d1aef8361370","resolution":{"observed_at":"2026-08-11T19:24:34.810671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:33.444422Z","title":"Magic State Distillation: Not as Costly as You Think,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.444422Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:6c9f1c513ba9c63f871a0a1ecdae96aebe0c4b0811c380dfa44f4930e0d032fe","observation_id":"c985e3f5-da49-4a50-9f88-2858894ace50","resolution":{"observed_at":"2026-08-11T19:24:33.444422Z","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-11T19:24:34.768642Z","title":"Hadamard-free circuits expose the structure of the Clif- ford group,","venue":null,"work_id":"f870dfb1-a8f8-4653-b45a-6b13ab4fc154","year":2021},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.452717Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:1b01893dc60ff4d9efef92c7bfb228b9ef414626c1cb81bd4d78c86a70c42e07","observation_id":"1355ef07-9eaf-41ee-b4be-b79ba451eb0b","resolution":{"observed_at":"2026-08-11T19:24:34.774453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.746270Z","title":"Excita- tion energies of a Thiophene-fused boron dipyrromethene (BODIPY) fluorophore simulated on a superconducting quantum computer,","venue":null,"work_id":"ff62616f-f794-46ef-b410-4c7fdb0df3e5","year":2024},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.458221Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:77db5cb854f220b3b6978fd8fbc11f6561cbb6694ef148607866ee81db39063d","observation_id":"edc90d5f-6291-48b4-9f0b-f87e8f30e45b","resolution":{"observed_at":"2026-08-11T19:24:34.755374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.717596Z","title":"A faster approximation algorithm for the Steiner problem in graphs,","venue":null,"work_id":"bb48ff2f-36fe-42dd-a353-bf17c206f3f8","year":1988},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.465214Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:a41355203a7a3ca5e2c579cdd25afca6c83c5e6fb4e579f5c26002a9b5f833bf","observation_id":"9bacf350-82ce-4ba5-a0f4-3ceee9042d6d","resolution":{"observed_at":"2026-08-11T19:24:34.723779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.675600Z","title":"Pauliopt","venue":null,"work_id":"ff25ac81-5df2-4a22-80b7-6afeeca42893","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.470866Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:f0c476310bed483e62682fdff4aa995f4f11ff50f2646e4e03c280b5dd40f757","observation_id":"8bd1f271-2a23-4342-bcfc-2e4497a52412","resolution":{"observed_at":"2026-08-11T19:24:34.693975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.650543Z","title":"In our case, we only use compressing and implementing Cliffords from 2.1","venue":null,"work_id":"9d152fba-1e34-4173-b6a4-b4bf3af0e482","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.478166Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:1983c4f9b093f7bca24a9f4e5634812e644a23d27fa42b547e4925ef6b8f46cc","observation_id":"a836020b-8d3c-455c-a79b-48765114f808","resolution":{"observed_at":"2026-08-11T19:24:34.661929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.630124Z","title":"This may in par- ticular include information about the pairs of qubits that can be interacted with CNOTs","venue":null,"work_id":"51f52c48-d927-4bdf-aa67-a2505c568205","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.484679Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:021108c2131e6e7f36fb44c3514377c22e8a8ec641527e5d5562db825927baa2","observation_id":"4b23c713-c87a-41cd-8310-0baefb829447","resolution":{"observed_at":"2026-08-11T19:24:34.636328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.608592Z","title":"In our case, we focus on finding Clifford circuits that minimize the number of CNOT gates","venue":null,"work_id":"fb265af1-e999-4c73-ad88-e5a8488df64d","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.490843Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:2b052bc36eaadd7ac9c0082792ad22dd9e1efa0293da084449f27cb33dd824e4","observation_id":"e717ff7d-6f53-4b2c-82bb-9eb6d2a2eddf","resolution":{"observed_at":"2026-08-11T19:24:34.615151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.589496Z","title":null,"venue":null,"work_id":"0efe6a42-03f3-4b1b-acd8-af719880be4b","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.496763Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:8f4cec49fc30d62fff56b5624d5546c7be02b6ce5008b0158ab18f424099c7be","observation_id":"753f1524-d638-4232-8be9-7831c14a694e","resolution":{"observed_at":"2026-08-11T19:24:34.594954Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.550994Z","title":", PM , circuits for each sublists P1,","venue":null,"work_id":"c283c6d0-0c2c-49a0-a95b-4af351e44a92","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.502889Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:eb7586423babec0e5f76df693513525eb379e37a8cc730d872e85c32c563a8c5","observation_id":"e40cad9a-618e-44b0-b855-bb32eb8fdce5","resolution":{"observed_at":"2026-08-11T19:24:34.558659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.520816Z","title":"The information was compressed from 4 into 3 qubits","venue":null,"work_id":"eb2e24ec-7f02-4208-88ab-42189b0f4700","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.509963Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:711f29bb653933422fef5377499dc3884f003c134298374469f6ff0400e1679f","observation_id":"7d31ac38-8ac8-4eee-aee8-a49559950bb7","resolution":{"observed_at":"2026-08-11T19:24:34.532133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.497889Z","title":null,"venue":null,"work_id":"fe840b16-ff87-4915-8d97-6fe531d0e74e","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.515838Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:688ab4ddfcef2ab5ed8b4d66cbb961a5690aa23a56e549eaef1460947dd66ff5","observation_id":"2202c7c6-5274-43f0-8dd6-7b6c0b571d9c","resolution":{"observed_at":"2026-08-11T19:24:34.505231Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.474212Z","title":"The Clifford circuits that appeared at the end of LS and MPLS methods were resyn- thesized using Pauliopt method","venue":null,"work_id":"8e77533f-542f-4592-8bd5-856bfaaa0687","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.522653Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:63b1749dbc1abf6c22ffbbdd02262015adf6a9d34d31c3905e16509e4ce02884","observation_id":"9dcdc01b-feca-44f4-89c8-a8c0ee4527ec","resolution":{"observed_at":"2026-08-11T19:24:34.483325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.442653Z","title":"C.1, except that it was first prepended with the trotterization of the 8-Pauli double excitations","venue":null,"work_id":"96b6472f-623f-41ee-bc45-d04fef5362a9","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.528354Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:19a1751d84f9cc2d2edaeb1e9d39415a2e32f11b41a21cb3a3d5955817f50826","observation_id":"dbc76282-f58f-4ae7-8ba1-baa73c2f860b","resolution":{"observed_at":"2026-08-11T19:24:34.454586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.419716Z","title":null,"venue":null,"work_id":"7737ecdc-1e0b-4be3-92a8-6e74ed0f8ff7","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.537531Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:d541972503129c22e92a3d7e49325215ec6d033cb8254f6c24348134e565c1c8","observation_id":"f85a4e72-f688-47fa-9fb8-7403e2411a0b","resolution":{"observed_at":"2026-08-11T19:24:34.425098Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.393455Z","title":"In this case: (a) We always compressed all 8-Paulis together, in which the leaf to be removed was selected randomly","venue":null,"work_id":"39605e7b-bf74-440d-9436-4725d4ef03a7","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.543702Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:e915855e7e9b0084c2da13653b2b4e60f0e1c9401cc27feb04a621e4e676bfba","observation_id":"3a44ee49-1a26-4fe1-9b14-5ea73d9597f2","resolution":{"observed_at":"2026-08-11T19:24:34.399712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.374309Z","title":"We took the original implementation from [42]","venue":null,"work_id":"4e7b9bc0-ccb5-48b4-9e0c-7f3f27455f7d","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.551496Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:99063a5e7a84b46de076ed3aac5001f6daa6bd7ec881ec37c9718bf357db2bc6","observation_id":"9ff58179-30eb-4fb0-8157-66f90581c514","resolution":{"observed_at":"2026-08-11T19:24:34.380621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.350073Z","title":"In each step a pair of logical q and physical qubits q′ are taken which requires the smallest number of gates to compute first Zq, then Xq on physical qubits q′","venue":null,"work_id":"0f6dd0b5-b6bb-4e62-aa19-51ed04312c3e","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.558066Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:8e972aad2b09bd9179be65f42034840a2ccc28494547ee02bdb073e4d1fcdca4","observation_id":"f047b80b-5cc6-472d-a43e-86130845e3d8","resolution":{"observed_at":"2026-08-11T19:24:34.356052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.331488Z","title":null,"venue":null,"work_id":"de7da79d-3bff-4de9-9984-4a63b6caee5d","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.565967Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:a5c7a807b58bed304079c503573dce16269f9e61d27d0ae45a1aca7f8874e9ef","observation_id":"e7bab9a8-2be0-487f-a1fc-d9fa2399a675","resolution":{"observed_at":"2026-08-11T19:24:34.337309Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.312662Z","title":null,"venue":null,"work_id":"50af483a-80f1-410e-9dcb-3bd935313412","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.573071Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:a30a669d4f2f8495dcce2608872ece14ff7664e4aa388d369ef71920aba1dd1c","observation_id":"c83ceef1-837b-47f3-928a-a096d9ccea4c","resolution":{"observed_at":"2026-08-11T19:24:34.318329Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.287678Z","title":"This step is repeated until no such Pauli from the group is found","venue":null,"work_id":"63c8630b-c51a-4da0-ba00-33d1144723e6","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.584267Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:131213c4c743ccfbab03f7b0506b20a83794c4ca8a46f2c75f00e38b05ccc45d","observation_id":"90a576be-98de-4b19-bd3a-9b3ac3287476","resolution":{"observed_at":"2026-08-11T19:24:34.295000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.265922Z","title":null,"venue":null,"work_id":"cbf78b55-3468-4eb7-8264-61de0a96dacb","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.592048Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:98f54ab1ac4c2717c00a0ce3194f518f1e53b13645c3d258bfe822e6c9b76563","observation_id":"b6b1a8ed-8a53-47d1-b6bd-58e5b2899ec1","resolution":{"observed_at":"2026-08-11T19:24:34.272276Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.234701Z","title":"This step is repeated until no such Pauli from the group is found","venue":null,"work_id":"81db11e7-bec7-4061-8d01-29681789e635","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.600516Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:66a5081de53ed0335691dcfbd51520f26c5d2d798045560bc4656e378b34a034","observation_id":"0887f819-6ce5-4b61-a3f1-2c40fb133bcb","resolution":{"observed_at":"2026-08-11T19:24:34.242590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.215886Z","title":"This step is repeated until no such Pauli from the group is found","venue":null,"work_id":"b50f3143-d12c-4b9b-b7f0-277f8b1daa8e","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.607279Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:d6517b7a8bce3ddb8ca5b05de2b2e28fac1cbc83170c30a7d296812c932fba3f","observation_id":"6d931d1a-c6c6-43bc-a4a0-61b31ea751e2","resolution":{"observed_at":"2026-08-11T19:24:34.221669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.186361Z","title":"This step is repeated auntil no such Pauli from the group is found","venue":null,"work_id":"3cfd3650-5b7e-4558-93d1-a016bfe4af95","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.613531Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:57ff0d9e551a27dab7e23f189a8e477bd067d64cd88f35f556019ef1d6370ea8","observation_id":"7d5ec778-2971-47b9-a99b-7029409424f9","resolution":{"observed_at":"2026-08-11T19:24:34.198145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T19:24:34.156842Z","title":"After this step, the procedure repeats starting from step 1","venue":null,"work_id":"415bc8a2-2b47-461a-a217-504f6c990f7b","year":null},"citing_paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:33.621541Z"},"links":{"citing_paper":"/paper/2412.06909"},"observation_digest":"sha256:3dff7530344d95e37c980539245c3e1ff8215ee5dc9a73b7bbd9ca62c3aba5bb","observation_id":"9b64f3de-0c72-4631-9ea4-350444666648","resolution":{"observed_at":"2026-08-11T19:24:34.167138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.06909","last_updated":"2024-12-09T19:01:29Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-12T11:28:51.886563Z","submitted_at":"2024-12-09T19:01:29Z","title":"A generic multi-Pauli compilation framework for limited connectivity"},"reference_resolution":{"displayed":63,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":1,"verified_fuzzy":41},"total_outbound_references":63},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 1 inbound Pith citation observation for arXiv:2412.06909."}