{"as_of":"2026-08-19T14:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dbe7589aacaded927d62d0dc66f4cf3a4d24ec8192a1dcff368d3464b85bfd45","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:43:17.842624Z","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-12T06:46:43.749347Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.14448","last_updated":"2025-03-18T17:27:50Z","snapshot_observed_at":"2026-08-19T03:10:07.347064Z","submitted_at":"2025-03-18T17:27:50Z","title":"Pauli Network Circuit Synthesis with Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2503.14448","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.14448","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pauli network circuit synthesis with reinforcement learning","venue":null,"work_id":"46ad899b-f16a-42f4-a521-1d2bdf61bec7","year":2025},"citing_paper":{"arxiv_id":"2605.10910","last_updated":"2026-05-11T17:49:28Z","snapshot_observed_at":"2026-08-13T06:57:37.492751Z","submitted_at":"2026-05-11T17:49:28Z","title":"Equivariant Reinforcement Learning for Clifford Quantum Circuit Synthesis","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-12T03:58:55.389930Z"},"links":{"cited_paper":"/paper/2503.14448","citing_paper":"/paper/2605.10910"},"observation_digest":"sha256:51f9745f580ed129ae54e990e481c120e32fed2f2f07ea986a652f89d1c06c02","observation_id":"b5173a5f-da6e-48bf-b128-07048bfefb73","resolution":{"observed_at":"2026-05-12T06:46:43.777343Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.14448","last_updated":"2025-03-18T17:27:50Z","snapshot_observed_at":"2026-08-19T03:10:07.347064Z","submitted_at":"2025-03-18T17:27:50Z","title":"Pauli Network Circuit Synthesis with Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.14448","snapshot_observed_at":"2026-08-16T00:43:17.842624Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11579","last_updated":"2026-08-12T02:38:42Z","snapshot_observed_at":"2026-08-19T02:15:36.525267Z","submitted_at":"2026-08-12T02:38:42Z","title":"Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T00:43:17.842624Z"},"links":{"cited_paper":"/paper/2503.14448","citing_paper":"/paper/2608.11579"},"observation_digest":"sha256:59e733ef207411d2c44d9b978e0d445d8944ad7c227e793a4b7ad5f85bcf271a","observation_id":"3155c9d2-3d6e-41ff-ba01-a27d853318ad","resolution":{"observed_at":"2026-08-16T00:43:17.842624Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2503.14448/citation-record","integrity":"/paper/2503.14448/integrity","json":"/paper/2503.14448/citation-record.json","paper":"/paper/2503.14448"},"outbound":[],"paper":{"arxiv_id":"2503.14448","last_updated":"2025-03-18T17:27:50Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-19T03:10:07.347064Z","submitted_at":"2025-03-18T17:27:50Z","title":"Pauli Network Circuit Synthesis with Reinforcement Learning"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2503.14448."}