{"as_of":"2026-08-16T16:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:41932d9860a2265e82af8dd8c7f45c8a2c55a3e6eacedd3dc949e15220cf6c5e","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:13:26.670366Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T11:26:53.677924Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2112.02040","last_updated":"2021-12-03T17:39:41Z","snapshot_observed_at":"2026-08-16T00:15:47.257302Z","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-12T17:30:30.286004Z","title":"Bouland and T","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.12610","last_updated":"2024-11-19T16:14:52Z","snapshot_observed_at":"2026-08-15T12:41:27.874961Z","submitted_at":"2024-11-19T16:14:52Z","title":"Universal programmable waveguide arrays","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T17:30:30.286004Z"},"links":{"cited_paper":"/paper/2112.02040","citing_paper":"/paper/2411.12610"},"observation_digest":"sha256:db9b5b5c94e7a35f8c42bfc1544e2723d47f60ebc4022579a0ae3f8d9ccf6f65","observation_id":"3a3003b7-bbc6-43fd-bd9d-80d8770f2710","resolution":{"observed_at":"2026-08-12T17:30:30.286004Z","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-16T00:15:47.257302Z","submitted_at":"2021-12-03T17:39:41Z","title":"Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm","version":1},"cited_work":{"arxiv_id":"2112.02040","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.02040","snapshot_observed_at":"2026-07-02T11:26:53.677924Z","title":"Giurgica-Tiron, Efficient universal quantum compilation: An inverse-free Solovay-Kitaev al- gorithm (2021), arXiv:2112.02040 [quant-ph]","venue":null,"work_id":"fae7efa1-cfc4-47a1-98e1-8e655a34f304","year":2021},"citing_paper":{"arxiv_id":"2505.00683","last_updated":"2026-05-20T12:12:37Z","snapshot_observed_at":"2026-08-13T04:07:40.078980Z","submitted_at":"2025-05-01T17:43:33Z","title":"Quantum Circuit Overhead","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-22T16:50:46.820750Z"},"links":{"cited_paper":"/paper/2112.02040","citing_paper":"/paper/2505.00683"},"observation_digest":"sha256:fa875aa142322df82804a84dda156f450bee6e5b879ec51a2784520901b2da99","observation_id":"4b3e3740-ee20-41ce-8c52-d03d3e35a212","resolution":{"observed_at":"2026-05-22T16:51:47.843475Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.02040","last_updated":"2021-12-03T17:39:41Z","snapshot_observed_at":"2026-08-16T00:15:47.257302Z","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-15T23:13:26.670366Z","title":"Efficient universal quantum compilation: An inverse-free Solovay- Kitaev algorithm","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.05468","last_updated":"2025-05-08T17:58:07Z","snapshot_observed_at":"2026-08-15T23:00:37.532276Z","submitted_at":"2025-05-08T17:58:07Z","title":"A Solovay-Kitaev theorem for quantum signal processing","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-15T23:13:26.670366Z"},"links":{"cited_paper":"/paper/2112.02040","citing_paper":"/paper/2505.05468"},"observation_digest":"sha256:4ef9996b80efc545e05422494e5690ae35efa60d2de51f12b1f9e6fce44a6be4","observation_id":"c342e1a2-480f-44ef-b1ed-472210b3e710","resolution":{"observed_at":"2026-08-15T23:13:26.670366Z","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-16T00:15:47.257302Z","submitted_at":"2021-12-03T17:39:41Z","title":"Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm","version":1},"cited_work":{"arxiv_id":"2112.02040","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.02040","snapshot_observed_at":"2026-07-02T11:26:53.677924Z","title":"Giurgica-Tiron, Efficient universal quantum compilation: An inverse-free Solovay-Kitaev al- gorithm (2021), arXiv:2112.02040 [quant-ph]","venue":null,"work_id":"fae7efa1-cfc4-47a1-98e1-8e655a34f304","year":2021},"citing_paper":{"arxiv_id":"2605.02051","last_updated":"2026-05-03T20:41:21Z","snapshot_observed_at":"2026-07-06T23:15:11.601042Z","submitted_at":"2026-05-03T20:41:21Z","title":"Sub-Cubic Quantum Gate Synthesis via Stochastic Commutator Decomposition","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-08T19:34:20.542822Z"},"links":{"cited_paper":"/paper/2112.02040","citing_paper":"/paper/2605.02051"},"observation_digest":"sha256:318a712a5a51714b5fe0a7fb2cf1987264556ce1fd02186ea8f0935fa12199ff","observation_id":"bfbb58b4-e9f5-470c-9418-742aa2ccf781","resolution":{"observed_at":"2026-05-09T05:45:23.267988Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.02040","last_updated":"2021-12-03T17:39:41Z","snapshot_observed_at":"2026-08-16T00:15:47.257302Z","submitted_at":"2021-12-03T17:39:41Z","title":"Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm","version":1},"cited_work":{"arxiv_id":"2112.02040","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.02040","snapshot_observed_at":"2026-07-02T11:26:53.677924Z","title":"Giurgica-Tiron, Efficient universal quantum compilation: An inverse-free Solovay-Kitaev al- gorithm (2021), arXiv:2112.02040 [quant-ph]","venue":null,"work_id":"fae7efa1-cfc4-47a1-98e1-8e655a34f304","year":2021},"citing_paper":{"arxiv_id":"2607.01227","last_updated":"2026-07-01T17:58:52Z","snapshot_observed_at":"2026-08-14T12:59:52.398522Z","submitted_at":"2026-07-01T17:58:52Z","title":"Polynomial equivalence of the global transverse-field Ising model and the gate model of quantum computation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-02T11:25:06.408015Z"},"links":{"cited_paper":"/paper/2112.02040","citing_paper":"/paper/2607.01227"},"observation_digest":"sha256:b765281557db3ee3061dadd52d0e78cfd0430f14dcb4c92712b742142569e2e1","observation_id":"467d28d9-2b5b-41b7-93c3-348455c5bcb4","resolution":{"observed_at":"2026-07-02T11:26:53.679334Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.02040","last_updated":"2021-12-03T17:39:41Z","snapshot_observed_at":"2026-08-16T00:15:47.257302Z","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:d2292db690aec2e5b0716ca1e0335132ebf6388bfc7d607fb0a719082baec175","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"}}],"links":{"evidence":"/evidence","html":"/paper/2112.02040/citation-record","integrity":"/paper/2112.02040/integrity","json":"/paper/2112.02040/citation-record.json","paper":"/paper/2112.02040"},"outbound":[],"paper":{"arxiv_id":"2112.02040","last_updated":"2021-12-03T17:39:41Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T00:15:47.257302Z","submitted_at":"2021-12-03T17:39:41Z","title":"Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2112.02040."}