Pith. sign in

Paper Citation Record · LEDGER

Distributing Graph States Over Arbitrary Quantum Networks

As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1811.05445.

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

pith.paper-citation-record.v1
1811.05445 v3

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-07T06:34:17.273281+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-03T20:00:06.718708Z

measured 0 of 1 external citation measurements

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

Source: cited_works

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 c3a76089-49f4-4a79-94e5-1b1afe9c66fb · inbound

Local Equivalences of Graph States cites this paper.

Local Equivalences of Graph States Distributing Graph States Over Arbitrary Quantum Networks

Reference 37

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T20:00:06.718708Z digest=sha256:19e78aab9ce919f58d030de1cb382c1133295cee3d4987dd703c465b45037cd8

Observation fbe577d4-1d48-47da-8057-8a93edffbe16 · inbound

A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity cites this paper.

A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity Distributing Graph States Over Arbitrary Quantum Networks

Reference 75

Resolution
unresolved
no resolver link, observed 2026-07-13T02:48:08.655303Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-13T02:48:08.655303Z digest=sha256:d5a8d5c52b8098b4785aed22912599a37d9cde5bf8e9fe2b00bd13d9345fead9