Pith. sign in

Paper Citation Record · LEDGER

Pauli Network Circuit Synthesis with Reinforcement Learning

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2503.14448 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-16T00:43:17.842624Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-12T06:46:43.749347Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation b5173a5f-da6e-48bf-b128-07048bfefb73 · inbound

Equivariant Reinforcement Learning for Clifford Quantum Circuit Synthesis cites this paper.

Equivariant Reinforcement Learning for Clifford Quantum Circuit Synthesis Pauli Network Circuit Synthesis with Reinforcement Learning

Reference 17

Resolution
verified exact
arxiv_id, observed 2026-05-12T06:46:43.777343Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-05-12T03:58:55.389930Z digest=sha256:51f9745f580ed129ae54e990e481c120e32fed2f2f07ea986a652f89d1c06c02

Observation 3155c9d2-3d6e-41ff-ba01-a27d853318ad · inbound

Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification cites this paper.

Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification Pauli Network Circuit Synthesis with Reinforcement Learning

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-16T00:43:17.842624Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T00:43:17.842624Z digest=sha256:59e733ef207411d2c44d9b978e0d445d8944ad7c227e793a4b7ad5f85bcf271a