{"as_of":"2026-08-15T21:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:623f01f39fe8d7a904aa45d5794884303af69a67bfb8030b4e641c9f885d8a8d","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-01T11:47:18.184904Z","state":"measured"},{"denominator":63,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":63,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2607.19874/citation-record","integrity":"/paper/2607.19874/integrity","json":"/paper/2607.19874/citation-record.json","paper":"/paper/2607.19874"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T11:47:12.022666Z","title":"Quantum computing, postselection, and probabilistic polynomial-time.Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 461(2063):3473–3482, 2005","venue":null,"work_id":null,"year":2063},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:12.022666Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:45f7940737db3a3397f02e80db51373c36b32578db37ac41c6329b7b6c68b8c0","observation_id":"0b16f76d-690b-40d0-b901-26a7572dd0cd","resolution":{"observed_at":"2026-08-01T11:47:12.022666Z","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-01T11:47:12.073444Z","title":"Postbqp postscripts: A confession of mathematical errors.https://scottaaronson.blog/?p= 2072, 2014","venue":null,"work_id":null,"year":2072},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:12.073444Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:ac6682acacd358d2fd1be5d08ecc70b1970f1c747e17ad98f0d881574f18af97","observation_id":"52865265-5f51-4e4c-8443-4805cc24abe6","resolution":{"observed_at":"2026-08-01T11:47:12.073444Z","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-01T11:47:12.133624Z","title":"The complexity zoo, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:12.133624Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:3150d74d32d4964b387763512a380d7f5b47161caa9cf469462172dc3e536d7d","observation_id":"41f86175-d9b8-4e7c-8462-badcf270cdfd","resolution":{"observed_at":"2026-08-01T11:47:12.133624Z","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-01T11:47:12.245684Z","title":"Quantum invariants of 3-manifolds and np vs# p.Quantum Information & Computation, 17(1-2):125–146, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:12.245684Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:ce4b638c7bd70637b0a0a33b0804386a51cb18c005656fead3ceaf34287c707e","observation_id":"efb121b8-f8b7-47df-8aa6-5b53ac5cafea","resolution":{"observed_at":"2026-08-01T11:47:12.245684Z","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-01T11:47:12.305324Z","title":"Partitioning and geometric embedding of range spaces of finite vapnik-chervonenkis dimension","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:12.305324Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:99741a57fe143d208aaaa8ba0d8a254284cad760ccb7b2277dcd3c1792938739","observation_id":"ef410fda-7135-463a-aec3-a8568ad66039","resolution":{"observed_at":"2026-08-01T11:47:12.305324Z","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-01T11:47:12.413278Z","title":"Chemical basis of trotter-suzuki errors in quantum chemistry simulation.Physical Review A, 91(2):022311, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:12.413278Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:4c9767316caf847ddc335a10822cdf4412d040383af7dac58512826c5e67550f","observation_id":"15dcfc85-47a8-418b-af67-2cf81343cffd","resolution":{"observed_at":"2026-08-01T11:47:12.413278Z","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-01T11:47:12.572718Z","title":"Dynamic programming.science, 153(3731):34–37, 1966","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:12.572718Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:1bbaad4d039228cfc982fd76b312debafed9f308eb5d69afe9678e1098eb29c9","observation_id":"1644f64c-8b29-4a6e-bea0-c7950a784c50","resolution":{"observed_at":"2026-08-01T11:47:12.572718Z","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-01T11:47:12.631902Z","title":"The potential of multidimensional photonic computing","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:12.631902Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:9719984ac627d3f2baa6883d21e32702e56d75f4ae01829657c74a62cf62dc2a","observation_id":"d5970c46-c14d-4acd-b90f-4cc134b9718a","resolution":{"observed_at":"2026-08-01T11:47:12.631902Z","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-01T11:47:12.739972Z","title":"Multidimensional binary search trees used for associative searching.Communications of the ACM, 18(9):509–517, 1975","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:12.739972Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:b42eb712b67ded277e55c9074f8fcd7999bd55b6257323f030c90f5cdc304531","observation_id":"807ad739-03be-4909-a033-37d6a4daca65","resolution":{"observed_at":"2026-08-01T11:47:12.739972Z","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-01T11:47:12.905938Z","title":"Bloch vectors for qudits.Journal of Physics A: Mathematical and Theoretical, 41(23):235303, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:12.905938Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:d43c5fb1dc43fbd681d724112ba3f16c723c3408592266e2870ca3f87e30ce54","observation_id":"885eecdd-de0b-4086-8031-bb28abeeeb9b","resolution":{"observed_at":"2026-08-01T11:47:12.905938Z","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-01T11:47:13.003798Z","title":"On the baker-campbell-hausdorff theorem: non- convergence and prolongation issues.Linear and Multilinear Algebra, 68(7):1310–1328, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:13.003798Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:ca281ec10fc8d9b5b9c78f4330c88df704a8006e83013d1740a20cde352a21a6","observation_id":"73eeba17-1e14-4280-91e5-d878e881dd49","resolution":{"observed_at":"2026-08-01T11:47:13.003798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.02040","last_updated":"2021-12-03T17:39:41Z","snapshot_observed_at":"2026-08-13T17:22:23.423866Z","submitted_at":"2021-12-03T17:39:41Z","title":"Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.02040","snapshot_observed_at":"2026-08-01T11:47:13.102474Z","title":"Efficient universal quantum compilation: An inverse-free solovay- kitaev algorithm.arXiv preprint arXiv:2112.02040, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:13.102474Z"},"links":{"cited_paper":"/paper/2112.02040","citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:af29c67efe9409f7ecd1db0dacf07dd90c5e2b66ff5d9a06cf8d60db21bd22d0","observation_id":"7551073c-1eda-40aa-abba-4a7c8445e243","resolution":{"observed_at":"2026-08-01T11:47:13.102474Z","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-01T11:47:13.182867Z","title":"A spectral gap theorem in su.(d).Journal of the European Mathematical Society (EMS Publishing), 14(5), 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:13.182867Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:6a6ce0aeb4fe4a3f9240de09b091523e3b0e64b6ca9a5e123ec6627e7cf7049d","observation_id":"11dcf983-78c8-4515-ba1e-1b5b42114b48","resolution":{"observed_at":"2026-08-01T11:47:13.182867Z","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-01T11:47:13.252560Z","title":"Near neighbor search in large metric spaces","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:13.252560Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:01822260a8bbce45411b249449d3dc0ddeb3d2ce8e39a26e6563b97f057fa0bd","observation_id":"d01ebbe9-19f0-4390-83ad-616f91e6ec5e","resolution":{"observed_at":"2026-08-01T11:47:13.252560Z","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-01T11:47:13.280453Z","title":"Springer Science & Business Media, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:13.280453Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:84a93faadc9064c42f6a31fad8ed56cd8b0c1eadef90433d41298a8693e8d66a","observation_id":"9b4ca43a-9fb4-4674-8c1e-9eaf2d6f95c9","resolution":{"observed_at":"2026-08-01T11:47:13.280453Z","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-01T11:47:13.350709Z","title":"Trapped-ion quantum computing: Progress and challenges.Applied physics reviews, 6(2), 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:13.350709Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:d5eabcc6878896faed2a4ec10cc14db75cdec9ac73e9a0341105862cf4483e52","observation_id":"7727bc23-7deb-4a66-a9e0-301602b9091a","resolution":{"observed_at":"2026-08-01T11:47:13.350709Z","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-01T11:47:13.488171Z","title":"Toward the first quantum simu- lation with quantum speedup.Proceedings of the National Academy of Sciences, 115(38):9456–9461, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:13.488171Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:9e172309d5c8b61080608182b295ac6374a42318e365106bfbf34840e0a4d255","observation_id":"0aab4504-6f02-463b-a89e-4da79b8991c5","resolution":{"observed_at":"2026-08-01T11:47:13.488171Z","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-01T11:47:13.550116Z","title":"Theory of trotter error with commutator scaling.Physical Review X, 11(1):011020, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:13.550116Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:c68433cdca2a8c6c67c81d63ad0bcd9936590ad8fdaf41b6ef7ab8dd1db43c6f","observation_id":"1ec20e13-246c-4d38-a063-66395aadfaaf","resolution":{"observed_at":"2026-08-01T11:47:13.550116Z","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-01T11:47:13.620154Z","title":"Chapman and hall/CRC, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:13.620154Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:c8da0ae6742755ae0eb5dfe5835636bca8619738ef77ea62048f79875302588a","observation_id":"169e0c51-82e7-4e3e-ad31-4b8741fe11e6","resolution":{"observed_at":"2026-08-01T11:47:13.620154Z","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-01T11:47:13.706406Z","title":"Exact and approximate unitary 2- designs and their application to fidelity estimation.Physical Review AAtomic, Molecular, and Optical Physics, 80(1):012304, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:13.706406Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:b57a66f2916a0df3938ae97fd50d4ea0ec665a829f59c15a616ff5d0593bf3b8","observation_id":"8b995b53-20ac-4f7f-bd0a-f0d4e1d37655","resolution":{"observed_at":"2026-08-01T11:47:13.706406Z","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-01T11:47:13.776306Z","title":"Topological quantum computation.Physics today, 59(7):32–38, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:13.776306Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:472e3434c621f6fb46f0b280b9a06ace53fa4ea998263e76e4f9e1812fbb80f4","observation_id":"a13d7b07-fc96-4ec8-9d5a-94f717abe9dc","resolution":{"observed_at":"2026-08-01T11:47:13.776306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0505030","last_updated":"2005-08-23T01:12:00Z","snapshot_observed_at":"2026-08-13T09:40:04.012975Z","submitted_at":"2005-05-06T00:55:45Z","title":"The Solovay-Kitaev algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0505030","snapshot_observed_at":"2026-08-01T11:47:13.846606Z","title":"The solovay-kitaev algorithm.arXiv preprint quant-ph/0505030,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:13.846606Z"},"links":{"cited_paper":"/paper/quant-ph/0505030","citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:a2c5b60e0af3098b512453c070351e8ad01daf08487ca6492a2cf8db5614a71a","observation_id":"2b98fb35-b178-486a-bbff-f7cd1b5f793a","resolution":{"observed_at":"2026-08-01T11:47:13.846606Z","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-01T11:47:13.911241Z","title":"Springer, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:13.911241Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:9c065edfa1f27f686a12b77a6a3e68e251070bad51df7646ea59beff4060c98b","observation_id":"6730e77f-c703-49b1-9a3b-2f89af0ceced","resolution":{"observed_at":"2026-08-01T11:47:13.911241Z","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-01T11:47:13.994413Z","title":"Universality in quantum computation.Proceedings of the Royal Society of London","venue":null,"work_id":null,"year":1937},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:13.994413Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:cea515e9e5689fddb92bb5cef67db8878b0e0993b47a69c00aa068f8409886ae","observation_id":"34058cf5-ec91-4517-aa18-791257cda0a3","resolution":{"observed_at":"2026-08-01T11:47:13.994413Z","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-01T11:47:14.056222Z","title":"Quantum control theory and applications: a survey.IET control theory & applications, 4(12):2651–2671, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:14.056222Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:0456ad830a5c6e7c722bcc7317092df432f96a94e73e483c5de0506ea06b99ce","observation_id":"68900393-d7c0-43e5-b3ea-2a06e0d07a0b","resolution":{"observed_at":"2026-08-01T11:47:14.056222Z","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-01T11:47:14.126382Z","title":"Springer, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:14.126382Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:3a6151cde5bee7498e6517f844246c9dbab8d25360a4f0baa26a6377cc7f31b4","observation_id":"a3a452f5-ce34-495e-a287-d3e14d8c43bb","resolution":{"observed_at":"2026-08-01T11:47:14.126382Z","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-01T11:47:14.196389Z","title":"Topological quantum computation","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:14.196389Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:816024e47d7eb098e8ccee95bd042e30655fe97031c5a923aa4357399033e44f","observation_id":"8835001d-8e7d-417e-9083-9a03905a4a61","resolution":{"observed_at":"2026-08-01T11:47:14.196389Z","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-01T11:47:14.266514Z","title":"Taylor & Francis, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:14.266514Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:4ec6aa1dd673c6dd5fcb786fde38d45ef24f8d3a71f452853290ea0f9122c88a","observation_id":"5c9d12fa-4c50-4bd7-932b-2ded394c34e6","resolution":{"observed_at":"2026-08-01T11:47:14.266514Z","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-01T11:47:14.390713Z","title":"A fast quantum mechanical algorithm for database search","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:14.390713Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:e6e32aaab4e0c9b6d0c98e6aceb5fcd492fab9b53af446283d3e10d2b6ba98d0","observation_id":"39d0a0b0-5283-4754-918f-318e78535e2d","resolution":{"observed_at":"2026-08-01T11:47:14.390713Z","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-01T11:47:14.452758Z","title":"Quantum mechanics helps in searching for a needle in a haystack.Physical review letters, 79(2):325,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:14.452758Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:43af98cb7257b84cbc247deb9fdac757cadac45d3bc1d671a0a56348fdc983b1","observation_id":"fc55555a-88c6-4c19-a77d-b6e274a52653","resolution":{"observed_at":"2026-08-01T11:47:14.452758Z","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-01T11:47:14.516301Z","title":"Quantum computing with trapped ions.Physics reports, 469(4):155–203, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:14.516301Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:161eeca4970cb7b3692c008d8ad2ea3b7a75d9ff703fca101016d47822a6e3cf","observation_id":"09353a3a-9626-4f81-9fa6-8b59ec7781e7","resolution":{"observed_at":"2026-08-01T11:47:14.516301Z","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-01T11:47:14.576236Z","title":"Lie groups, lie algebras, and representations","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:14.576236Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:8124d9bbe18ff845c4a77898102e8ddd8805ebb0d25e4fb1b662de103105baad","observation_id":"c20f9087-34a1-4634-842a-8e4e1bf2515d","resolution":{"observed_at":"2026-08-01T11:47:14.576236Z","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-01T11:47:14.700332Z","title":"Efficient discrete approximations of quantum gates","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:14.700332Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:9674c2c4370e2c12373a764dd9b273b3b9654325f4f8ce8c61601c0ef6c98320","observation_id":"7ddd0a52-2e67-4de9-ab9f-6c73687e630c","resolution":{"observed_at":"2026-08-01T11:47:14.700332Z","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-01T11:47:14.770898Z","title":"SIAM, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:14.770898Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:e0a8331b3e03513e92eb98c7ff5f9d3adcd0ad7e2a19e0c7e592dcb9feb4301a","observation_id":"185120fa-80cc-48fc-ba5f-30aefd8cd27c","resolution":{"observed_at":"2026-08-01T11:47:14.770898Z","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-01T11:47:14.816988Z","title":"Cambridge university press, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:14.816988Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:fea3e7af6dbdaba35ad3fe55cceeda23de1e54847549310f8095833269b59403","observation_id":"7cfe1add-c2f3-4b5e-922c-40c14587237f","resolution":{"observed_at":"2026-08-01T11:47:14.816988Z","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-01T11:47:14.915212Z","title":"Native qudit entanglement in a trapped ion quantum processor","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:14.915212Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:555ef2aa45811b9ed40cac904691ed4ea36c29fd3646ca1a80109828391b802e","observation_id":"ad3e3559-7565-4573-9f6f-74345e0be2d2","resolution":{"observed_at":"2026-08-01T11:47:14.915212Z","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-01T11:47:15.082725Z","title":"Approximate nearest neighbors: towards removing the curse of dimensionality","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:15.082725Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:2d36be7cdfa02767b82b5ad95a3051b1735cd145706ed8db00d5879d9e983f1d","observation_id":"70ba37ca-8fd5-47e1-9bee-9ff7c34e8431","resolution":{"observed_at":"2026-08-01T11:47:15.082725Z","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-01T11:47:15.245490Z","title":"The bloch vector for n-level systems.Physics Letters A, 314(5-6):339–349, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:15.245490Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:32fcc66e6a58ca5941d90f1ba5a90b91a5b71bf10bbd138252832dd1748721dc","observation_id":"0f849a0d-75b6-4033-b4de-6d45c170f78e","resolution":{"observed_at":"2026-08-01T11:47:15.245490Z","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-01T11:47:15.389628Z","title":"Quantum computations: algorithms and error correction.Russian Mathematical Surveys, 52(6):1191–1249, 1997","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:15.389628Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:a2677279e561e03e4b3257d5d3b7466afc91ff4b38e598a4f49d26f91aa8b00b","observation_id":"d7e1f6c0-e018-4c5e-8c76-f2694928033a","resolution":{"observed_at":"2026-08-01T11:47:15.389628Z","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-01T11:47:15.447850Z","title":"Number 47","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:15.447850Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:340efbeaa7e1e479ae991cc308dbc96e13b7b504753d53d9ff0607b2fb57558f","observation_id":"836b7d6a-5bc3-4a03-b3fd-a8cc1e6da5d2","resolution":{"observed_at":"2026-08-01T11:47:15.447850Z","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-01T11:47:15.554173Z","title":"How hard is it to approximate the jones polynomial?Theory OF Computing, 11(6):183–219,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:15.554173Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:802b44ca3940505ab3902911b74b137dc7353d0f3fe350496eb7d406027f2674","observation_id":"fb5a8356-17e3-4247-903a-278618672831","resolution":{"observed_at":"2026-08-01T11:47:15.554173Z","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-01T11:47:15.666585Z","title":"Breaking the cubic barrier in the solovay-kitaev algorithm.arXiv preprint arXiv:2306.13158,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:15.666585Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:a08fa2aa5d92d1c7e81cf22902fee2fd4a5d637788a435ede99d39c2ab18ecc0","observation_id":"a9763d60-cce4-48ce-93ee-f3732f4d35e0","resolution":{"observed_at":"2026-08-01T11:47:15.666585Z","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-01T11:47:15.772339Z","title":"Universal quantum simulators.Science, 273(5278):1073–1078, 1996","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:15.772339Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:5fd5685a2c32b3249c2993aed686f445f7be9b98baf3ec75161b9021fcca6eae","observation_id":"95c0020c-fabf-405f-bf15-7b31e50770bf","resolution":{"observed_at":"2026-08-01T11:47:15.772339Z","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-01T11:47:15.945525Z","title":"SIAM, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:15.945525Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:f4eb1902e52175aa178ea60b3e1c37c5cdd0a5543bc7af84281a33911dba66a6","observation_id":"3ec1797f-96da-43bb-b3bc-a2c6ae5c6c9a","resolution":{"observed_at":"2026-08-01T11:47:15.945525Z","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-01T11:47:16.117160Z","title":"Kluwer Academic Publishers, Boston, MA, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:16.117160Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:69798d397610ca4c18473d64eb81c8af8da2ea06e6e084dfd1fa36cad3e48cf0","observation_id":"8f032ef6-92bf-4977-bb1d-3dee83343e15","resolution":{"observed_at":"2026-08-01T11:47:16.117160Z","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-01T11:47:16.288276Z","title":"On the constant depth implementation of pauli exponentials.npj Quantum Information, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:16.288276Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:64d3c0aa4a0850e1993553c06d4b392fe59af3cb7cc0c478a3ce4e49fa0fc59a","observation_id":"c189ce7d-c073-415a-873c-eaeaeab220c1","resolution":{"observed_at":"2026-08-01T11:47:16.288276Z","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-01T11:47:16.376188Z","title":"Epsilon-approximations & epsilon-nets","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:16.376188Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:7e94ceec7c50c2bf9047ac8b02c315af5d69fc2d4fd95457ec6b9f026512db8b","observation_id":"6684f9ed-979d-4103-9063-8d6ae062823c","resolution":{"observed_at":"2026-08-01T11:47:16.376188Z","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-01T11:47:16.567183Z","title":"A geometric approach to quantum circuit lower bounds.Quantum Information and Computation, 6(3):213–262, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:16.567183Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:d5d6624145810893cb37cc7ffcda87d0ccf6e026c5d6e35900b30ee56764203b","observation_id":"2206bb16-4e9d-4770-9e02-c338ac27cba1","resolution":{"observed_at":"2026-08-01T11:47:16.567183Z","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-01T11:47:16.648053Z","title":"Optimal control, geometry, and quantum computing.Physical Review AAtomic, Molecular, and Optical Physics, 73(6):062323, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:16.648053Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:6b542dcb5e2c33496338b58c59253ebf5ddd16f12e551da3ecae1dac629a5066","observation_id":"7e2f8d3f-db90-447e-a7a0-37808ac865b6","resolution":{"observed_at":"2026-08-01T11:47:16.648053Z","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-01T11:47:16.724093Z","title":"Quantum computation as geometry","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:16.724093Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:c419d520a08c962ab6d9a185ef503d9fada740bef9562801047088a33c106e2a","observation_id":"2d213fa3-9d07-4106-b474-4fbea5cc3e56","resolution":{"observed_at":"2026-08-01T11:47:16.724093Z","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-01T11:47:16.800076Z","title":"Five balltree construction algorithms","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:16.800076Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:ede4551fe2d10af292daf8d4cc4a7dbfe64b2ac9a026ebcab5ce60c179309211","observation_id":"5d9c0d47-326e-4bbb-9f46-620d6faad593","resolution":{"observed_at":"2026-08-01T11:47:16.800076Z","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-01T11:47:16.867631Z","title":"Epsilon-nets, unitary designs, and random quantum circuits.IEEE Transactions on Information Theory, 68(2):989–1015, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:16.867631Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:8b5863701b7e2cd9272ae14709ce40e6d337e985781206b7133dcdd96ed68be4","observation_id":"7a1e1a66-d695-435a-abd1-4c51fae8ab7e","resolution":{"observed_at":"2026-08-01T11:47:16.867631Z","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-01T11:47:16.989268Z","title":"Optimally generating su (2 n) using pauli strings.Physical Review Letters, 134(20):200601, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:16.989268Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:5e1e55a56fcc562aa04b097dd784c092c4780561c4bceb9942433b8543b23b2f","observation_id":"fcf34ed9-0952-4d8c-961b-993b7449d36b","resolution":{"observed_at":"2026-08-01T11:47:16.989268Z","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-01T11:47:17.136944Z","title":"Topological quantum computationfrom basic concepts to first experiments","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:17.136944Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:dd837343d662a401adaf70e8edc8a4c64ed85942a9cee1bf0f6f4fc3ec797958","observation_id":"71d1618b-03e4-410d-90af-c2543f7c08f7","resolution":{"observed_at":"2026-08-01T11:47:17.136944Z","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-01T11:47:17.201782Z","title":"On the construction and comparison of difference schemes.SIAM journal on numerical analysis, 5(3):506–517, 1968","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:17.201782Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:5315755063c12ef74eb56f77d18c25d6b1568ff573b9cb3858fb67384aa2ca3f","observation_id":"2910eaf2-28dc-40e2-b24e-4b2a982d3484","resolution":{"observed_at":"2026-08-01T11:47:17.201782Z","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-01T11:47:17.364055Z","title":"General theory of fractal path integrals with applications to many-body theories and statistical physics.Journal of mathematical physics, 32(2):400–407, 1991","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:17.364055Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:f1888ea293587b3e24265d8e9fdc8729fffdacbe33c93c671e9f1e5238e7c996","observation_id":"cb6b0a46-0d24-4946-88e9-3056b439dce0","resolution":{"observed_at":"2026-08-01T11:47:17.364055Z","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-01T11:47:17.536663Z","title":"Another NP-complete problem and the complexity of computing short vectors in a lattice","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:17.536663Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:79b19fa8647220701453c4f4d83d4820b8663ac4c653f5e372c0906cd00ad0bf","observation_id":"276d7b00-d36d-49e5-8c22-bfd624ad9d9c","resolution":{"observed_at":"2026-08-01T11:47:17.536663Z","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-01T11:47:17.795052Z","title":"Optimal hadamard gate count for clifford+ t synthesis of pauli rotations sequences.ACM Transactions on Quantum Computing, 5(1):1–29, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:17.795052Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:aed012df774af81b0532a20f9fc9fed2768599e4d1c0952f6b85ddbdc276d9e0","observation_id":"8ea27816-3095-4002-b3d7-d26e7b53bd64","resolution":{"observed_at":"2026-08-01T11:47:17.795052Z","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-01T11:47:17.970955Z","title":"Photonic realization of qudit quantum computing.Photonic Quantum Technologies: Science and Applications, 2:651–674, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:17.970955Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:ce6cd69f78820a811f49f79290fde82cb235bbb131bf42d6cb2538004661a4a2","observation_id":"954fd626-806d-4f78-8a12-77f67029bb2a","resolution":{"observed_at":"2026-08-01T11:47:17.970955Z","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-01T11:47:18.011171Z","title":"Qudits and high-dimensional quantum computing","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:18.011171Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:5d383dcf30908686e0a847a6a9dac2d5b1e077c227dacf1479439b4ffe6e56b4","observation_id":"9d982b65-6028-49fb-bf01-d21652190139","resolution":{"observed_at":"2026-08-01T11:47:18.011171Z","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-01T11:47:18.054852Z","title":"Number 112","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:18.054852Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:23697a84f4fdaa87128266e481d62a04db28caee1a5355117e9e0dc38ea14f87","observation_id":"8453e137-1721-41db-9b63-2c5a2551d0e0","resolution":{"observed_at":"2026-08-01T11:47:18.054852Z","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-01T11:47:18.111698Z","title":"Solving strongly correlated electron models on a quantum computer.Physical Review A, 92(6):062318, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:18.111698Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:86ff8030345e2b0da168f82931f67a31cc722f8362e97cf66ef0147b97d550fa","observation_id":"74d1dd51-3cb6-49d2-b1e7-eba73676aa37","resolution":{"observed_at":"2026-08-01T11:47:18.111698Z","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-01T11:47:18.184904Z","title":"Springer, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-01T11:47:18.184904Z"},"links":{"citing_paper":"/paper/2607.19874"},"observation_digest":"sha256:258e1b1e44ffd1e9d67156393244ccacdee4ecf329eb78abcb3d9cbef464854b","observation_id":"c8fd5510-8f80-41b3-84fb-265c5a55e434","resolution":{"observed_at":"2026-08-01T11:47:18.184904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.19874","last_updated":"2026-07-22T08:01:43Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-10T13:58:27.081951Z","submitted_at":"2026-07-22T08:01:43Z","title":"Removing Online Exponential Net Search from Solovay-Kitaev"},"reference_resolution":{"displayed":63,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":63,"verified_exact":0,"verified_fuzzy":0},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 0 inbound Pith citation observations for arXiv:2607.19874."}