{"as_of":"2026-08-10T14:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:511aa339fd040ac4e42f4539fa2689254d16e63f6dd8e75fee0da37d693f345e","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-10T06:31:04.303077+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-01T21:14:41.956959Z","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-20T05:58:05.038031Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.14660","last_updated":"2025-03-18T19:09:58Z","snapshot_observed_at":"2026-08-07T16:53:53.747822Z","submitted_at":"2025-03-18T19:09:58Z","title":"Heuristic and Optimal Synthesis of CNOT and Clifford Circuits","version":1},"cited_work":{"arxiv_id":"2503.14660","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.14660","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Webster, S","venue":null,"work_id":"b7d73afb-9f3c-41b5-b2c6-b3fc2312fbc2","year":2025},"citing_paper":{"arxiv_id":"2605.10910","last_updated":"2026-05-11T17:49:28Z","snapshot_observed_at":"2026-07-06T23:22:47.781940Z","submitted_at":"2026-05-11T17:49:28Z","title":"Equivariant Reinforcement Learning for Clifford Quantum Circuit Synthesis","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-12T03:58:55.389930Z"},"links":{"cited_paper":"/paper/2503.14660","citing_paper":"/paper/2605.10910"},"observation_digest":"sha256:763d4a774c5aa8dae5111a758adbe55f86ee5dff3999ed4d894b99ed81d1c538","observation_id":"0b2abe06-34ef-4543-a538-8afb94ebc8ad","resolution":{"observed_at":"2026-05-12T06:46:43.737774Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.14660","last_updated":"2025-03-18T19:09:58Z","snapshot_observed_at":"2026-08-07T16:53:53.747822Z","submitted_at":"2025-03-18T19:09:58Z","title":"Heuristic and Optimal Synthesis of CNOT and Clifford Circuits","version":1},"cited_work":{"arxiv_id":"2503.14660","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.14660","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Webster, S","venue":null,"work_id":"b7d73afb-9f3c-41b5-b2c6-b3fc2312fbc2","year":2025},"citing_paper":{"arxiv_id":"2605.15266","last_updated":"2026-05-14T18:00:01Z","snapshot_observed_at":"2026-07-06T23:26:37.362117Z","submitted_at":"2026-05-14T18:00:01Z","title":"Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-19T16:23:28.488465Z"},"links":{"cited_paper":"/paper/2503.14660","citing_paper":"/paper/2605.15266"},"observation_digest":"sha256:9aea27b485c30d27bfc9a80b46f6c37a6f5293ffc267a27fae61802896bf6c62","observation_id":"4058c798-50bb-4f5a-9492-b4904db0ab99","resolution":{"observed_at":"2026-05-19T16:27:39.741588Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.14660","last_updated":"2025-03-18T19:09:58Z","snapshot_observed_at":"2026-08-07T16:53:53.747822Z","submitted_at":"2025-03-18T19:09:58Z","title":"Heuristic and Optimal Synthesis of CNOT and Clifford Circuits","version":1},"cited_work":{"arxiv_id":"2503.14660","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.14660","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Webster, S","venue":null,"work_id":"b7d73afb-9f3c-41b5-b2c6-b3fc2312fbc2","year":2025},"citing_paper":{"arxiv_id":"2605.19471","last_updated":"2026-05-19T07:22:47Z","snapshot_observed_at":"2026-08-02T10:09:26.035384Z","submitted_at":"2026-05-19T07:22:47Z","title":"Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-20T05:57:28.304470Z"},"links":{"cited_paper":"/paper/2503.14660","citing_paper":"/paper/2605.19471"},"observation_digest":"sha256:8576c2fcbac0c52c1793eb469c50e2d0394d89cf89a6e400ebd48bb60f37525d","observation_id":"78f40d6a-f666-4349-86bc-290056949de5","resolution":{"observed_at":"2026-05-20T05:58:05.039966Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.14660","last_updated":"2025-03-18T19:09:58Z","snapshot_observed_at":"2026-08-07T16:53:53.747822Z","submitted_at":"2025-03-18T19:09:58Z","title":"Heuristic and Optimal Synthesis of CNOT and Clifford Circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.14660","snapshot_observed_at":"2026-07-11T18:58:48.117546Z","title":"Heuristic and optimal synthesis of cnot and clifford circuits.arXiv preprint arXiv:2503.14660, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04462","last_updated":"2026-07-05T19:07:48Z","snapshot_observed_at":"2026-08-05T17:24:49.594719Z","submitted_at":"2026-07-05T19:07:48Z","title":"Noise-Aware Synthesis of Quantum LDPC Encoder Circuits via Two-Sided Hamming Descent","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-11T18:58:48.117546Z"},"links":{"cited_paper":"/paper/2503.14660","citing_paper":"/paper/2607.04462"},"observation_digest":"sha256:d1fcac3ed7e3dfe9b0ff7b3e1d1ec08e7c18489fb63e03ca8a0bc755404afbeb","observation_id":"1158d0a5-641e-4ccc-8f3d-fa537cbdd37a","resolution":{"observed_at":"2026-07-11T18:58:48.117546Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.14660","last_updated":"2025-03-18T19:09:58Z","snapshot_observed_at":"2026-08-07T16:53:53.747822Z","submitted_at":"2025-03-18T19:09:58Z","title":"Heuristic and Optimal Synthesis of CNOT and Clifford Circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.14660","snapshot_observed_at":"2026-08-01T21:14:41.956959Z","title":"Webster, S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16166","last_updated":"2026-07-30T09:46:30Z","snapshot_observed_at":"2026-08-09T08:14:17.428338Z","submitted_at":"2026-07-17T17:46:54Z","title":"Fast logical operations in quantum LDPC codes using simple resource states","version":2},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-01T21:14:41.956959Z"},"links":{"cited_paper":"/paper/2503.14660","citing_paper":"/paper/2607.16166"},"observation_digest":"sha256:0d03d113bc8edefae4e1630abab79be1db52bcae922a4f61bd90ae5def43f56d","observation_id":"186424a0-b43c-4561-a3ef-131ca8ca1507","resolution":{"observed_at":"2026-08-01T21:14:41.956959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.14660","last_updated":"2025-03-18T19:09:58Z","snapshot_observed_at":"2026-08-07T16:53:53.747822Z","submitted_at":"2025-03-18T19:09:58Z","title":"Heuristic and Optimal Synthesis of CNOT and Clifford Circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.14660","snapshot_observed_at":"2026-08-01T05:28:48.444849Z","title":"Heuristic and optimal synthesis of CNOT and Clifford circuits","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22248","last_updated":"2026-07-24T12:31:18Z","snapshot_observed_at":"2026-08-01T05:28:44.964746Z","submitted_at":"2026-07-24T12:31:18Z","title":"Lower bounds for the CNOT-complexity of linear reversible operators","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T05:28:48.444849Z"},"links":{"cited_paper":"/paper/2503.14660","citing_paper":"/paper/2607.22248"},"observation_digest":"sha256:e3f523380009a22d12256bfde42878b74edf2e242f6ff6d475924acef498f069","observation_id":"d4b568d7-6968-474a-a08f-2b59bd41d2e3","resolution":{"observed_at":"2026-08-01T05:28:48.444849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2503.14660/citation-record","integrity":"/paper/2503.14660/integrity","json":"/paper/2503.14660/citation-record.json","paper":"/paper/2503.14660"},"outbound":[],"paper":{"arxiv_id":"2503.14660","last_updated":"2025-03-18T19:09:58Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T16:53:53.747822Z","submitted_at":"2025-03-18T19:09:58Z","title":"Heuristic and Optimal Synthesis of CNOT and Clifford Circuits"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2503.14660."}