{"as_of":"2026-08-05T13:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:00e679e91e5eb4ae7f55b7c6ad32b01366a4480b9313b3a9a974d174c48ee70c","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-19T06:41:33.811336Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-19T06:42:07.325880Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.01674","last_updated":"2023-06-02T13:50:12Z","snapshot_observed_at":"2026-08-02T16:26:22.793999Z","submitted_at":"2023-05-02T18:00:00Z","title":"Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers","version":2},"cited_work":{"arxiv_id":"2305.01674","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.01674","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Depth-optimal synthesis of Clifford circuits with SAT solvers","venue":null,"work_id":"f15261b7-3a14-4c60-973e-772c6a1ccbea","year":2023},"citing_paper":{"arxiv_id":"2507.04337","last_updated":"2026-04-29T10:20:23Z","snapshot_observed_at":"2026-07-06T21:52:50.858849Z","submitted_at":"2025-07-06T10:48:42Z","title":"Efficient Simulation of High-Level Quantum Gates","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-19T06:41:33.811336Z"},"links":{"cited_paper":"/paper/2305.01674","citing_paper":"/paper/2507.04337"},"observation_digest":"sha256:2637e676fdee17e0f03b621c39a8e7eec472c14886f69be2658512b1af8ab7be","observation_id":"3793ba90-1307-4c3d-bb74-666f161b84b5","resolution":{"observed_at":"2026-05-19T06:42:07.329119Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2305.01674/citation-record","integrity":"/paper/2305.01674/integrity","json":"/paper/2305.01674/citation-record.json","paper":"/paper/2305.01674"},"outbound":[],"paper":{"arxiv_id":"2305.01674","last_updated":"2023-06-02T13:50:12Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-02T16:26:22.793999Z","submitted_at":"2023-05-02T18:00:00Z","title":"Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2305.01674."}