Pith. sign in

Paper Citation Record · LEDGER

Complexity of graph-state preparation by Clifford circuits

As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2402.05874.

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

pith.paper-citation-record.v1
2402.05874 v4

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 6 of 6 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 6 of 6 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T10:33:10.809254Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-03T02:27:35.266747Z

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 349787e7-d51e-4990-892f-486881e5d916 · inbound

Orbit classification and analysis of qutrit graph states under local complementation and local scaling cites this paper.

Orbit classification and analysis of qutrit graph states under local complementation and local scaling Complexity of graph-state preparation by Clifford circuits

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-07T10:33:10.809254Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T10:33:10.809254Z digest=sha256:5f28c608fa5a31f66b9536c9588af16b9b3e320b194f44250ab97f951379b246

Observation 5ecd51bf-7203-4cd1-9376-1cb2444fe8aa · inbound

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks cites this paper.

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks Complexity of graph-state preparation by Clifford circuits

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-05T16:40:22.925985Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T16:40:22.925985Z digest=sha256:05d383d1d999886c1a503234576612669b2cad50c8c3b8c920bdb50896e6254b

Observation 94a20fd3-27b4-4572-961e-78eaa46011e7 · inbound

Local Equivalences of Graph States cites this paper.

Local Equivalences of Graph States Complexity of graph-state preparation by Clifford circuits

Reference 95

Resolution
unresolved
no resolver link, observed 2026-08-03T20:00:06.873581Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T20:00:06.873581Z digest=sha256:75df480f4264fc8bb74f13320d6dc0a903982c14d1c3d9b00fb33b8f791b578c

Observation e8e58b61-8af5-4d90-98f1-67ae52d96ac2 · inbound

Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations cites this paper.

Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations Complexity of graph-state preparation by Clifford circuits

Reference 56

Resolution
verified exact
arxiv_id, observed 2026-07-16T01:22:21.965584Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-05-11T00:58:54.120349Z digest=sha256:1b5e27191271026caa15f46c0ef2f52cf267ea5005a7a6470ccfcc25ee961699

Observation 3ef991d7-4f45-4c35-8fde-9066798c0764 · inbound

Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations cites this paper.

Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations Complexity of graph-state preparation by Clifford circuits

Reference 56

Resolution
verified exact
arxiv_id, observed 2026-07-16T01:22:21.965584Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-05-14T21:00:18.271186Z digest=sha256:bbd677df1da76137aa5c50e09ae4c9c8f401af7d171521351876152ae45269b8

Observation 47687f01-6a4f-4e91-a907-80e250ebe039 · inbound

Biclique decompositions from Welzl orders cites this paper.

Biclique decompositions from Welzl orders Complexity of graph-state preparation by Clifford circuits

Reference 17

Resolution
verified exact
arxiv_id, observed 2026-07-16T01:22:21.965584Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-06-27T15:54:06.194541Z digest=sha256:57a9600a62f749ee86f0261fe4e3c1e92623e30ec60378b39cde2b3b7ce59188