Paper Citation Record · LEDGER

How hard is it to verify a classical shadow?

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

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

pith.paper-citation-record.v1
2510.08515 v3

Coverage vector

measured 10 of 10 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-04T10:50:50.926183Z

measured 10 of 10 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-06T06:34:29.942622+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

10 of 10 outbound references displayed

verified exact0
verified fuzzy0
unresolved10
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation dab81dae-84ee-4321-92fd-3b8071660a22 · outbound

This paper cites an unresolved cited work.

How hard is it to verify a classical shadow? Unresolved cited work

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-04T10:50:50.292582Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 67045daf-3230-4c87-944e-9659638854a2 · outbound

This paper cites an unresolved cited work.

How hard is it to verify a classical shadow? Unresolved cited work

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-04T10:50:50.407976Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 69908f10-0e58-4e06-8d3a-0e197d501e26 · outbound

This paper cites We have that TrE(ρ(x, t, S)) = TrE eUt · · ·eUtd+1 Enc(|1⟩ ⟨1|) eU † td+1 · · ·eU † t.

How hard is it to verify a classical shadow? We have that TrE(ρ(x, t, S)) = TrE eUt · · ·eUtd+1 Enc(|1⟩ ⟨1|) eU † td+1 · · ·eU † t

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-04T10:50:50.487168Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8fe4fe00-adff-443d-8c28-7292f6220e6b · outbound

This paper cites an unresolved cited work.

How hard is it to verify a classical shadow? Unresolved cited work

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-04T10:50:50.561473Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1aeae157-ecfd-41b2-9128-700262f1be3f · outbound

This paper cites an unresolved cited work.

How hard is it to verify a classical shadow? Unresolved cited work

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-04T10:50:50.649040Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 99b93ccf-7505-4f60-84a2-888a16036ba3 · outbound

This paper cites Then for every x ∈ A, Tr(Hi bX(x, Si)) = 0.

How hard is it to verify a classical shadow? Then for every x ∈ A, Tr(Hi bX(x, Si)) = 0

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-04T10:50:50.736017Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e264162c-b8ea-4886-b11a-3dac5b9dd294 · outbound

This paper cites The power of unentan- glement.

How hard is it to verify a classical shadow? The power of unentan- glement

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-04T10:50:50.169772Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e428c53a-e8d9-4bd9-98b3-d4c776f8f938 · outbound

This paper cites 37 Proof of Theorem 4.4 Since the containment is straightforward we only show hardness explicitly.

How hard is it to verify a classical shadow? 37 Proof of Theorem 4.4 Since the containment is straightforward we only show hardness explicitly

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-04T10:50:50.817402Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c4bc1353-9bc4-4e72-a7c3-24803a381257 · outbound

This paper cites normalized Hi so ∥Hi∥∞ ≤ 1.

How hard is it to verify a classical shadow? normalized Hi so ∥Hi∥∞ ≤ 1

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-04T10:50:50.926183Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d528d6d2-4b56-4ccc-a29f-7f8f1dc09091 · outbound

This paper cites Parallel approximation of non-interactive zero-sum quantum games.

How hard is it to verify a classical shadow? Parallel approximation of non-interactive zero-sum quantum games

Reference 2008

Resolution: unresolved; no resolver link, observed 2026-08-04T10:50:50.228182Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.