Pith. sign in

Paper Citation Record · LEDGER

Complexity of graph-state preparation by Clifford circuits

As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 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 5 of 5 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 5 of 5 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-05T16:40:22.925985Z

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 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:422ca830d2e9c2cb49627f8a25c7daabf4f96401bf9c3ba8a7ad24c9593eb7c9

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-05-11T00:58:54.120349Z digest=sha256:8b412d577179fbd40846866559cd9be612b52d0f5393483e8059fe61050f46a9

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-06-27T15:54:06.194541Z digest=sha256:7248a70d0eb3625618da73db75755b508e0ac87d19eb66c76c3b18f6621f28c9