{"as_of":"2026-08-14T23:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c4a41bace6b5fe7b60a3c803d91afdac944401f005d0ee84af8d9539e1ac4444","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T04:53:46.719465Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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.13543/citation-record","integrity":"/paper/2608.13543/integrity","json":"/paper/2608.13543/citation-record.json","paper":"/paper/2608.13543"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:53:46.507030Z","title":"Distributed quantum computing: A survey","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.507030Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:fe9ae2b7553e7a739d7d2cb3e8d37911c200958107a4ea307a179c120029eb08","observation_id":"30ecff42-5996-4885-96c1-7989ad1f0cf5","resolution":{"observed_at":"2026-08-14T04:53:46.507030Z","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-14T04:53:47.455130Z","title":"Distributed quantum computing across an optical network link","venue":null,"work_id":"409a4511-4a5c-4066-9672-1b92d1fc4778","year":2025},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.512251Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:06249e065258f2b04810b5cd07f51cf3760466337e0b5dfbdf59d22e94438b8e","observation_id":"e575e0b5-be38-49ae-8cdc-44d4c6d92ddd","resolution":{"observed_at":"2026-08-14T04:53:47.459756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-07-06T21:35:56.582332Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-14T04:53:46.517213Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.517213Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:d81e90113e3637599591b7a73ad60e4e76465b1330817e918fd8faf7576be700","observation_id":"aeda0f0d-9b17-44d4-a535-7fc2c6c0bece","resolution":{"observed_at":"2026-08-14T04:53:46.517213Z","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-14T04:53:47.441717Z","title":"Distributed arith- metic on a quantum multicomputer","venue":null,"work_id":"dd0403bc-13ad-4183-9d9d-84f3acecdfca","year":2006},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.522465Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:8664f7b4e9a933a0952a72a755f0c188ffa8d48a2af22f9669be6819df6240bc","observation_id":"6653ba5e-4568-4faf-89b9-9c37066d4416","resolution":{"observed_at":"2026-08-14T04:53:47.446298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.428719Z","title":"Distributing circuits over heterogeneous, mod- ular quantum computing network architectures","venue":null,"work_id":"de2dbc27-e6fe-47b5-be70-4b7ffcac2557","year":2024},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.526597Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:dd68e93c0cfbb07fbc0f8fab8f1caab96e1698966a0e100864552cf494e99cf3","observation_id":"5cbd26be-6456-40d7-bd66-02672d5fad5d","resolution":{"observed_at":"2026-08-14T04:53:47.432872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.414529Z","title":"Entanglement-efficient bipartite-distributed quantum com- puting","venue":null,"work_id":"5392c716-b35c-4eae-9a3b-d1e16929bb4f","year":2023},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.530832Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:da86674b878d2e0468f276026e786ec2850e6817c4018b062a9fb6a1e12ecb3b","observation_id":"188a0b03-186e-4bcc-a38b-a9d096923362","resolution":{"observed_at":"2026-08-14T04:53:47.419312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.400009Z","title":"Distribution of quantum circuits over general quantum networks","venue":null,"work_id":"2c1b9e33-3e31-4e7f-8568-58db650b447d","year":2022},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.535774Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:cc936a801a9c747cd629555788b63e6081a27722e8a974c253e08ac05eb91077","observation_id":"42ec718b-549b-41d6-9761-a1016cc5f129","resolution":{"observed_at":"2026-08-14T04:53:47.404483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.386120Z","title":"Picturing Quantum Software: An Introduction to the ZX-Calculus and Quantum Compilation","venue":null,"work_id":"77e413f1-4e8b-471f-9f97-d8929c84e1f0","year":2024},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.539654Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:3d869d857c8b27248a17461b9f49695a353cea3ad2da0acb8d91054474248de5","observation_id":"16194c52-64d5-4f99-b986-83f61bca2672","resolution":{"observed_at":"2026-08-14T04:53:47.390882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.372968Z","title":"A game of surface codes: Large-scale quantum computing with lattice surgery","venue":null,"work_id":"054ff52d-12da-483d-8622-81ef8466e2e2","year":2019},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.544134Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:316ad90c502305adb009131259ab12255294c713134d8afda9d8db47c23ad875","observation_id":"370366cd-037b-4ec1-8b19-6e88cfd45dc2","resolution":{"observed_at":"2026-08-14T04:53:47.377008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.360368Z","title":"Improved simulation of stabilizer circuits","venue":null,"work_id":"df66b8ee-ba89-4f4f-9d20-f9eef23fb941","year":2004},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.548464Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:53c8a5ef62ebcf1fbd6a8a889f5031d97535dffb08d9c1f7f34a001862d9e1ca","observation_id":"6b405ccf-7f66-4995-bdec-e7d3b7aa55eb","resolution":{"observed_at":"2026-08-14T04:53:47.364402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.347543Z","title":"Optimization of cnot circuits on limited-connectivity architecture","venue":null,"work_id":"4c8462a9-5364-4da5-b5b7-320f42b509d2","year":2023},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.552512Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:1a4e8ebd4753ddbe01a5798a76ef0c80f16a5af4680dd8c1a6335fed04e22df0","observation_id":"0c786d5d-6b1c-4e85-9631-576cb7228096","resolution":{"observed_at":"2026-08-14T04:53:47.351612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-13T18:22:42.284529Z","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-14T04:53:46.556932Z","title":"Architecture-aware synthesis of stabilizer circuits from clifford tableaus","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.556932Z"},"links":{"cited_paper":"/paper/2309.08972","citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:a7396d395b07ce2366c19b8a9c515952a0509d460cdf867ec5581c42adb4e10f","observation_id":"6acecb05-a52d-45a8-9b4f-3afca0c2408b","resolution":{"observed_at":"2026-08-14T04:53:46.556932Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:53:46.561378Z","title":"Quantum circuit optimizations for nisq architectures","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.561378Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:3a7ee14db01b20399f01d8efb24358430c676ebc8d44d62db3832cb74aa9fb8a","observation_id":"9fad83c9-20a7-466b-b89b-06ca0ce02cac","resolution":{"observed_at":"2026-08-14T04:53:46.561378Z","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-14T04:53:47.325735Z","title":"Phase polynomials synthesis algorithms for nisq architectures and beyond","venue":null,"work_id":"4a521b41-541c-41b2-8afd-4f389546b8cb","year":2022},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.565190Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:48b488da365981a770d4e25460c9fc7e166d3a5ee87f7bb269bf23011b723f62","observation_id":"f0a91543-38d0-48c5-a1bf-175368432ff2","resolution":{"observed_at":"2026-08-14T04:53:47.330130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.06011","last_updated":"2021-08-17T11:58:02Z","snapshot_observed_at":"2026-08-03T21:49:45.780210Z","submitted_at":"2020-08-13T16:56:42Z","title":"A simple method for sampling random Clifford operators","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.06011","snapshot_observed_at":"2026-08-14T04:53:46.569252Z","title":"A simple method for sampling random clifford operators","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.569252Z"},"links":{"cited_paper":"/paper/2008.06011","citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:f6c93e56b7aeb0d9f5405afaa79b6f8690ee45b2178e58bd254940000ee5168d","observation_id":"d0308521-47de-4888-b426-c9b0d36ed916","resolution":{"observed_at":"2026-08-14T04:53:46.569252Z","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-14T04:53:47.311935Z","title":"“dgpe”.https://github.com/tlaakkonen/dgpe(2026)","venue":null,"work_id":"828b1963-602f-4aa5-8625-ea6d994f01ac","year":2026},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.573543Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:4cd799f8f6c762c40921b9359a4bde53479c5a73c28fc8ac0583ecc7b79eadb4","observation_id":"d361d1de-4ba6-45be-9368-cb794fff56fa","resolution":{"observed_at":"2026-08-14T04:53:47.316151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15917","last_updated":"2025-05-21T18:11:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-21T18:11:44Z","title":"How to factor 2048 bit RSA integers with less than a million noisy qubits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.15917","snapshot_observed_at":"2026-08-14T04:53:46.577670Z","title":"How to factor 2048 bit rsa integers with less than a million noisy qubits","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.577670Z"},"links":{"cited_paper":"/paper/2505.15917","citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:2ebfc9f4dc901686ace725753b029d85c39850823586e865663e150f93036b9f","observation_id":"5f194e6d-3291-431f-8e9c-bb369a3741fa","resolution":{"observed_at":"2026-08-14T04:53:46.577670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:53:46.582118Z","title":"Entangling logical qubits without physical operations","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.582118Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:fddb3591dbced0be58056e767230aa1e49e9b39acb692e8a006d2478b5bf3677","observation_id":"6931b8b8-1fd3-4e0f-9c9a-8ff46528c539","resolution":{"observed_at":"2026-08-14T04:53:46.582118Z","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-14T04:53:47.299113Z","title":"Sim- ulating quantum circuits using tree tensor networks","venue":null,"work_id":"538c1e74-1d31-4ab4-b450-e1e0fa786dd4","year":2023},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.586229Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:8387376b06e028167780eb78bbc2f179edffa89c750e4fffce7bff20104bd49c","observation_id":"bb9039d1-971d-49f1-b82c-d2029df85820","resolution":{"observed_at":"2026-08-14T04:53:47.303336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0904.2557","last_updated":"2009-04-16T18:40:02Z","snapshot_observed_at":"2026-08-02T06:03:48.397877Z","submitted_at":"2009-04-16T18:40:02Z","title":"An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0904.2557","snapshot_observed_at":"2026-08-14T04:53:46.590442Z","title":"An introduction to quantum error correction and fault-tolerant quantum computation","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.590442Z"},"links":{"cited_paper":"/paper/0904.2557","citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:284ef651faadb794e7f64aba5d2fd693b97a0239c6b1fdb8efbd5e0c6d180e18","observation_id":"c6b3bd56-45f8-4ff7-b802-df071249f6f2","resolution":{"observed_at":"2026-08-14T04:53:46.590442Z","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-14T04:53:47.285897Z","title":"Reducing the number of non-clifford gates in quantum circuits","venue":null,"work_id":"0eb5f803-ccbb-47fe-a43b-423b21880c05","year":2020},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.595199Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:167742566985df5d1602e86bc903df0a08e37fb73cc3b3537e5645f112acff85","observation_id":"48332d1f-c000-4f96-97ea-b1799bcce658","resolution":{"observed_at":"2026-08-14T04:53:47.290536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.12456","last_updated":"2019-03-29T11:55:10Z","snapshot_observed_at":"2026-08-14T16:54:50.164896Z","submitted_at":"2019-03-29T11:55:10Z","title":"Optimizing T gates in Clifford+T circuit as $\\pi/4$ rotations around Paulis","version":1},"cited_work":{"arxiv_id":"1903.12456","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.12456","snapshot_observed_at":"2026-08-14T04:53:46.848204Z","title":"Optimizing T gates in Clifford+T circuit as $\\pi/4$ rotations around Paulis","venue":"quant-ph","work_id":"65ddf8f7-8a86-407c-8655-42d9997b69dc","year":2019},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.599370Z"},"links":{"cited_paper":"/paper/1903.12456","citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:50dc007e30f438ec4859c12df6baad8e75777076f95cf67d888248015e12466c","observation_id":"89ef1663-d2f4-448e-b73f-9f7f0d5f083d","resolution":{"observed_at":"2026-08-14T04:53:46.854436Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.272878Z","title":"The classification of clifford gates over qubits","venue":null,"work_id":"9812a829-b7dd-4317-9f52-0c05e609063d","year":2022},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.604149Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:014f24847af13e76295afc304ffd93b4e71336404be66a8a8c7bcef7ac1f8445","observation_id":"9d39f78d-d1e0-4e54-8760-ce88dc88ec99","resolution":{"observed_at":"2026-08-14T04:53:47.277238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.08814","last_updated":"2024-09-19T18:33:10Z","snapshot_observed_at":"2026-08-13T12:00:22.136955Z","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-14T04:53:46.608378Z","title":"A comparison of quantum compilers using a dag-based or phase polynomial-based intermediate representation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.608378Z"},"links":{"cited_paper":"/paper/2304.08814","citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:3dfdc711bc904c54c66373191841cec7d46296a79c0f2ccdb19430908c6d81e2","observation_id":"62321065-e2e9-4d3d-ad85-7774e2923b5d","resolution":{"observed_at":"2026-08-14T04:53:46.608378Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.20052","last_updated":"2026-06-01T16:51:56Z","snapshot_observed_at":"2026-08-14T03:54:27.682894Z","submitted_at":"2025-09-24T12:19:30Z","title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.20052","snapshot_observed_at":"2026-08-14T04:53:46.612948Z","title":"Nontrivial multi-product commutation relation toward reducing t-count in sequential pauli-based computation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.612948Z"},"links":{"cited_paper":"/paper/2509.20052","citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:c1d178f0d95732e2d9ebc51f2e8bf6539c6585733dab5bb5688aecdb748cf2f6","observation_id":"4af58321-1d1a-49b3-9a1d-4a726b9e016e","resolution":{"observed_at":"2026-08-14T04:53:46.612948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.00633","last_updated":"2019-05-26T20:00:01Z","snapshot_observed_at":"2026-08-14T16:53:50.765911Z","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-14T04:53:46.617288Z","title":"Cnot circuit extraction for topologically- constrained quantum memories","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.617288Z"},"links":{"cited_paper":"/paper/1904.00633","citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:63daa22643fe324eecc327dfba5fa6db277267037b4184408f3a9af9649c76d9","observation_id":"ca079f40-1e4d-4903-ad54-1fbca08959c6","resolution":{"observed_at":"2026-08-14T04:53:46.617288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0302002","last_updated":"2003-02-03T00:20:03Z","snapshot_observed_at":"2026-07-07T07:11:41.739517Z","submitted_at":"2003-02-03T00:20:03Z","title":"Efficient Synthesis of Linear Reversible Circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0302002","snapshot_observed_at":"2026-08-14T04:53:46.621693Z","title":"Efficient synthesis of linear reversible cir- cuits","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.621693Z"},"links":{"cited_paper":"/paper/quant-ph/0302002","citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:648b32402f15eb6fa84b272f9500bf86d5fee141b1252d3b7a3fdd8fa6b69b3c","observation_id":"58197a6c-464f-4e61-bea9-0fbb36bf1f3e","resolution":{"observed_at":"2026-08-14T04:53:46.621693Z","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-14T04:53:47.259975Z","title":"A fast algorithm for steiner trees","venue":null,"work_id":"25726b2b-e6c7-42ff-aefd-67f0007f37ee","year":1981},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.626157Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:18f4c63c5f3e7315b8dedd7ac4250462b1dd40a570b393829befedfcae2c36e9","observation_id":"09af536c-488f-49aa-92fb-1c30d9bcfd3a","resolution":{"observed_at":"2026-08-14T04:53:47.264061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.246995Z","title":"Improved steiner tree approximation in graphs","venue":null,"work_id":"a9e90d19-5b99-478b-a4aa-03f2305cb1f5","year":2000},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.630425Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:8200aca5c488a725e3b5f0faaed77586f051eb2861cd529db83d9070cbbdb417","observation_id":"4c859538-974f-4529-8288-9cced87c37dc","resolution":{"observed_at":"2026-08-14T04:53:47.251251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.233840Z","title":"Full rank factorization of matrices","venue":null,"work_id":"07080500-c503-4b10-8697-f6ce5a414bc3","year":1999},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.634059Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:b8c55dbb832ef34a47ea2cb2ffde06d9ea03dd458b827d84d79b665fbaf5600a","observation_id":"70d1da93-b851-4b78-9f89-afc5cb25d68d","resolution":{"observed_at":"2026-08-14T04:53:47.238286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.220230Z","title":"Hadamard-free circuits expose the structure of the clifford group","venue":null,"work_id":"e0ed372d-46a7-4be4-8202-7a986a7bb34b","year":2021},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.637720Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:14607d98aea2e9e261e410d2b194b1613d7b1a447a696c81183a9eeb12abceec","observation_id":"2436a41d-cc4b-4d1b-90cf-c54e0951b6bd","resolution":{"observed_at":"2026-08-14T04:53:47.224766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.01557","last_updated":"2018-06-07T11:07:52Z","snapshot_observed_at":"2026-08-14T20:06:50.342971Z","submitted_at":"2017-12-05T10:19:30Z","title":"An Efficient Quantum Compiler that reduces $T$ count","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.01557","snapshot_observed_at":"2026-08-14T04:53:46.641699Z","title":"An efficient quantum compiler that reducest count","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.641699Z"},"links":{"cited_paper":"/paper/1712.01557","citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:b4f78e40b77eba86e24ba996e054e7448a3efcf2db1f38ab3bcf69d2497aa129","observation_id":"da6b51dd-4687-4932-a048-55a051298eb4","resolution":{"observed_at":"2026-08-14T04:53:46.641699Z","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-14T04:53:47.205757Z","title":"Dynamic transitive closure via dynamic matrix inverse (extended abstract)","venue":null,"work_id":"b402fd53-899a-4c71-84c9-85a0fbc728c4","year":2004},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.645890Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:33e3b420a50ec843102820ea50ac31b0acc529e9d2e8e52ad913203de87a528f","observation_id":"48ad46d3-6628-4582-9b5a-78b64402c5c4","resolution":{"observed_at":"2026-08-14T04:53:47.210193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.192621Z","title":"Acyclic partitioning of large directed acyclic graphs","venue":null,"work_id":"8e94f4bf-ca07-46a7-8b56-1474e25347eb","year":2017},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.649587Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:1f24bc7e03d02aa701ba21f85d4c75b469c24cdeb8c7edcee65b936dba03ee0f","observation_id":"988de104-384d-4045-a9ec-c095dee6c14d","resolution":{"observed_at":"2026-08-14T04:53:47.196941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.180063Z","title":"Breaking paragraphs into lines","venue":null,"work_id":"f8e753d0-c330-4649-92d3-877b03b1fd91","year":1981},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.653310Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:53dbc3e037d59943c7de3c201c7b1083a9604a34ba5baaabe7e707b75f92c7d5","observation_id":"d781a9a1-9e60-4da2-be73-1c3aef523957","resolution":{"observed_at":"2026-08-14T04:53:47.184207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.167264Z","title":"Reducing circuit depth with qubitwise diagonal- ization","venue":null,"work_id":"4b17573f-ede6-42cf-b29b-84257f70ed0d","year":2023},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.657055Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:3ee71da8ef24471c2c86a57134883c0ea9422fcb132d5646f4d6217e074dc10a","observation_id":"236cccd8-5a47-4177-a867-6ea2d7e45578","resolution":{"observed_at":"2026-08-14T04:53:47.171325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.154389Z","title":"Worst-case analysis of set union algorithms","venue":null,"work_id":"38ed941e-0c34-47d1-bf98-17e2e4471f64","year":1984},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.661627Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:a250035c342133db119f052ecd8ad774e9d4193a84934beb05662e6e29554fa6","observation_id":"7318c014-1685-4729-8eaf-b58811ab1e04","resolution":{"observed_at":"2026-08-14T04:53:47.158753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.139662Z","title":"Quizx: a quick rust port of pyzx","venue":null,"work_id":"83d8bab7-c9a8-46b0-9648-ae76786d3af5","year":2019},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.666122Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:a0d9b27a9d901809c3acd409b87e80017366f56658b9dbc1e08df8ac3a612eb9","observation_id":"ae7c0329-b83f-4441-b0aa-7f720ef2064a","resolution":{"observed_at":"2026-08-14T04:53:47.144330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.126158Z","title":"High-quality hypergraph partitioning","venue":null,"work_id":"25a49bff-60c6-4477-bba6-ef998b308c07","year":2022},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.670585Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:b2e8326c67990a91ff237bef089c8aed8a95a46ffc9f9301fdcdf270f66956d2","observation_id":"c402e404-0106-4c19-9d6b-646cd4c1733e","resolution":{"observed_at":"2026-08-14T04:53:47.130419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.112365Z","title":"Good quantum error-correcting codes exist","venue":null,"work_id":"b3ac67ce-2393-4b0b-9e03-df331d5927a8","year":1996},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.675261Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:3d573fd78f333c72ab2e323d7d0017b181e68c30785b8f243bc954cdbbf4c9fa","observation_id":"8f7d02ef-5094-47a8-b8d3-c304b7d5ded1","resolution":{"observed_at":"2026-08-14T04:53:47.116976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.11457","last_updated":"2026-05-05T14:58:57Z","snapshot_observed_at":"2026-08-12T02:03:48.174751Z","submitted_at":"2026-02-12T00:30:48Z","title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.11457","snapshot_observed_at":"2026-08-14T04:53:46.679840Z","title":"The pinnacle architecture: Reducing the cost of breaking rsa-2048 to 100 000 physical qubits using quantum ldpc codes","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.679840Z"},"links":{"cited_paper":"/paper/2602.11457","citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:a0dc3b5beea998b347d6364babed409667bb064274ad5136448342269f2e5f43","observation_id":"9fc8e51c-0e2e-4e94-b8c9-2b892cb986b9","resolution":{"observed_at":"2026-08-14T04:53:46.679840Z","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-14T04:53:47.098709Z","title":"Css codes are the only stabilizer codes with transversal cnot?","venue":null,"work_id":"0aa994bd-d8a1-4b80-9f55-e367d0fb98f5","year":2023},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.684253Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:f6bcb451afa6882ec9b7befd76acaafece011e80ebf1573a4432a64023468366","observation_id":"514bef02-bb42-463c-aa60-d84235e7f55f","resolution":{"observed_at":"2026-08-14T04:53:47.103069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.084225Z","title":"Parallel logical measurements via quantum code surgery","venue":null,"work_id":"e8fd1cbb-41ae-4b41-926b-04f3f769a71d","year":2026},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.688528Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:11916e9282d22ae4ffaf39f3612d669ce6949172e6fb0cbcc188e74da069d2c5","observation_id":"87669e32-88e5-4c01-b666-1b64717b25eb","resolution":{"observed_at":"2026-08-14T04:53:47.088981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.067954Z","title":"Decomposition of clifford gates","venue":null,"work_id":"4e9be74f-9355-4223-aa12-b54d4f98e94b","year":2021},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.692988Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:a7ea084f73be03d46bcb55687ec2c37f695a9b728621799a71aec134130ac38f","observation_id":"68b17a12-7ec9-452d-9de6-dab8c3ca41f7","resolution":{"observed_at":"2026-08-14T04:53:47.073521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.051673Z","title":"Dynamic qubit routing with cnot circuit synthesis for quantum compilation","venue":null,"work_id":"742866bd-e123-4077-a5fc-29c5ddca304f","year":2023},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.697418Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:018c1b818ebdfb734d0c04df5080eb6300a0c212c72fd17d8b63a6cab881d519","observation_id":"5cda2712-271a-4e76-a754-51ceeaf0b0ef","resolution":{"observed_at":"2026-08-14T04:53:47.055738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.037943Z","title":"Tackling the qubit mapping problem for nisq-era quan- tum devices","venue":null,"work_id":"f9ab9975-90d0-4a83-9091-056141411775","year":2019},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.701988Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:c4b791f7f4196f44107fd0378c57dba00cda01622a0c8bac66da1049bf095c10","observation_id":"bb94a5cc-1850-415b-aa26-d507a495fd09","resolution":{"observed_at":"2026-08-14T04:53:47.042080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.00634","last_updated":"2025-04-01T10:35:58Z","snapshot_observed_at":"2026-08-13T11:04:20.293559Z","submitted_at":"2025-04-01T10:35:58Z","title":"CNOT-Optimal Clifford Synthesis as SAT","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.00634","snapshot_observed_at":"2026-08-14T04:53:46.706750Z","title":"Cnot-optimal clifford synthesis as sat","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.706750Z"},"links":{"cited_paper":"/paper/2504.00634","citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:4b5cceaf570d9d86037457289017478148ff0fc324d3bc3eddff40f89c459c60","observation_id":"52ee4a96-3900-4607-be98-d08ec644e2a0","resolution":{"observed_at":"2026-08-14T04:53:46.706750Z","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-14T04:53:47.024307Z","title":"Architecture aware compilation of quan- tum circuits via lazy synthesis","venue":null,"work_id":"20bf1eb8-0d4c-4ca6-9972-47e6d7cdcd4c","year":2022},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.711090Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:baf86bde6aae8448ad33bb92a7e9b7148a658a41f52448b2453dd21ec9c95cb7","observation_id":"49ae7327-6545-4e85-b8fb-30878fb44c80","resolution":{"observed_at":"2026-08-14T04:53:47.028647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:47.010100Z","title":"Clifford circuit opti- mization with templates and symbolic pauli gates","venue":null,"work_id":"11fb053e-a6e2-4eaf-bac8-2b25bd6a3395","year":2021},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.715348Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:7ea3972508b489496fc99c07b88c495ab29c060155ea3ecbedd9f82e184bb5f0","observation_id":"5879ee43-867b-407b-a647-7a482b195891","resolution":{"observed_at":"2026-08-14T04:53:47.014801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T04:53:46.995598Z","title":"Optimization of clifford circuits","venue":null,"work_id":"3ea1b7f8-004c-4b04-b01b-14f127da1ed4","year":2013},"citing_paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T04:53:46.719465Z"},"links":{"citing_paper":"/paper/2608.13543"},"observation_digest":"sha256:c56edcc11550bf589ea3d05bdc35a5653c65f89b501ff35e98b1bbed00ad1246","observation_id":"630c30e0-4b0a-4deb-862f-204a1bf89a06","resolution":{"observed_at":"2026-08-14T04:53:47.000544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.13543","last_updated":"2026-08-13T17:55:40Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-14T23:21:07.258053Z","submitted_at":"2026-08-13T17:55:40Z","title":"Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":1,"verified_fuzzy":34},"total_outbound_references":50},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2608.13543."}