Pith. sign in

Paper Citation Record · LEDGER

Tight bounds on depth-2 QAC-circuits computing parity

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

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

pith.paper-citation-record.v1
2504.06433 v1

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-19T06:32:44.657259+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-11T04:27:24.070049Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-04T01:39:23.511921Z

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 5da8f862-ef7f-4901-8f2a-8e9f29d60a47 · inbound

On the Computational Complexity of Geometrically Local QAC0 circuits cites this paper.

On the Computational Complexity of Geometrically Local QAC0 circuits Tight bounds on depth-2 QAC-circuits computing parity

Reference 4

Resolution
verified exact
arxiv_id, observed 2026-05-11T06:10:59.374172Z

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-10T17:46:52.590198Z digest=sha256:089eec1d4b30cb168e171509bb48e09f2aacdfd4fdaca0193cc06ac90cfb46c6

Observation 28308ce8-249c-4014-8d7c-99b079eda7b9 · inbound

Hard-to-Sample Distributions from Robust Extractors cites this paper.

Hard-to-Sample Distributions from Robust Extractors Tight bounds on depth-2 QAC-circuits computing parity

Reference 3

Resolution
metadata mismatch
arxiv_id, observed 2026-05-11T00:50:50.032831Z

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-11T00:48:12.816705Z digest=sha256:8478f59a48b5e3a10a52c5a00d309e44d66ad7edec43c383d2a4d79809ed1367

Observation 95551fc6-b94c-4443-aa46-88c4a4dd4dfd · inbound

Hard-to-Sample Distributions from Robust Extractors cites this paper.

Hard-to-Sample Distributions from Robust Extractors Tight bounds on depth-2 QAC-circuits computing parity

Reference 2022

Resolution
unresolved
no resolver link, observed 2026-08-02T15:31:47.909795Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T15:31:47.909795Z digest=sha256:ab29fe7f5aa800b4b693257a1f58c82a184c9edda84999a7ba6df01d2f4daa64

Observation ec46f1a3-e0be-466f-bb91-068a7b5f4bda · inbound

Evergreen: Efficient Claim Verification for Semantic Aggregates cites this paper.

Evergreen: Efficient Claim Verification for Semantic Aggregates Tight bounds on depth-2 QAC-circuits computing parity

Reference 3

Resolution
metadata mismatch
arxiv_id, observed 2026-07-04T01:39:23.514346Z

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-07-04T01:37:42.753691Z digest=sha256:eed2181b7f1e7a514fc34857d8aa4626ae2689d599efe8001dad4f61d619cc3c

Observation 8f3050a7-5231-4110-bfbd-64a5d809b341 · inbound

Shor's algorithm requires Fanout cites this paper.

Shor's algorithm requires Fanout Tight bounds on depth-2 QAC-circuits computing parity

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-10T22:24:16.304360Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T22:24:16.304360Z digest=sha256:c7a150c82ba2dd03ae26b4520244170aa95dfe7037336569f2c84737f1d8efc5

Observation da8c2e8c-a7bb-41e7-9028-50cc3de9a09f · inbound

Shor's algorithm requires Fanout cites this paper.

Shor's algorithm requires Fanout Tight bounds on depth-2 QAC-circuits computing parity

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-11T04:27:24.070049Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T04:27:24.070049Z digest=sha256:3ab0855769a89dfc4dbf9e22e7872cfb8615afa6930e60c2d34ff6762161aee4