Paper Citation Record · LEDGER

A proof complexity perspective on effectively zero-knowledge proofs

As of 12 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2607.13540.

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

pith.paper-citation-record.v1
2607.13540 v1

Coverage vector

measured 16 of 16 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-02T05:03:39.386291Z

measured 16 of 16 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+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

16 of 16 outbound references displayed

verified exact0
verified fuzzy0
unresolved16
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 84b03891-41fa-41cd-ac4c-9e9366427818 · outbound

This paper cites an unresolved cited work.

A proof complexity perspective on effectively zero-knowledge proofs Unresolved cited work

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-02T05:03:37.243612Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 25136a00-14c8-4537-a899-6159dedc3118 · outbound

This paper cites an unresolved cited work.

A proof complexity perspective on effectively zero-knowledge proofs Unresolved cited work

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-02T05:03:37.355429Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d78dda8c-a519-4c96-a42c-a6b1df2958f9 · outbound

This paper cites an unresolved cited work.

A proof complexity perspective on effectively zero-knowledge proofs Unresolved cited work

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-02T05:03:37.490884Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 795cb606-fe5e-4ef9-922d-fabd598651b2 · outbound

This paper cites an unresolved cited work.

A proof complexity perspective on effectively zero-knowledge proofs Unresolved cited work

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-02T05:03:37.574254Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation db7222b8-7ec7-48dd-9c15-40f0da43ce70 · outbound

This paper cites Ilango, The Oracle Derandomization Hypothesis is False (And More) Assuming No Natural Proofs,Electronic Colloquium on Computational Complexity, Report No.190, (2025).

A proof complexity perspective on effectively zero-knowledge proofs Ilango, The Oracle Derandomization Hypothesis is False (And More) Assuming No Natural Proofs,Electronic Colloquium on Computational Complexity, Report No.190, (2025)

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-02T05:03:37.700410Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3e82c1df-0430-4040-8ada-c40fcfb20c51 · outbound

This paper cites Khaniki, Jump operators, Interactive Proofs and Proof Complex- ity Generators, in:Proc.

A proof complexity perspective on effectively zero-knowledge proofs Khaniki, Jump operators, Interactive Proofs and Proof Complex- ity Generators, in:Proc

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-02T05:03:37.870475Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 160a23ff-e758-4601-be70-189f853f68d1 · outbound

This paper cites Kraj ´ ıˇ cek,Bounded arithmetic, propositional logic, and complexity theory, Encyclopedia of Mathematics and Its Applications, Vol.60, Cambridge University Press, (1995).

A proof complexity perspective on effectively zero-knowledge proofs Kraj ´ ıˇ cek,Bounded arithmetic, propositional logic, and complexity theory, Encyclopedia of Mathematics and Its Applications, Vol.60, Cambridge University Press, (1995)

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-02T05:03:38.027345Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7d15e44c-c8cb-493c-9d16-774346ad6401 · outbound

This paper cites Kraj ´ ıˇ cek, On the computational complexity of finding hard tau- tologies,Bulletin of the London Mathematical Society,46(1), (2014), pp.111-125.

A proof complexity perspective on effectively zero-knowledge proofs Kraj ´ ıˇ cek, On the computational complexity of finding hard tau- tologies,Bulletin of the London Mathematical Society,46(1), (2014), pp.111-125

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-02T05:03:38.131038Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4cd74cca-cd89-4a61-8e7c-bfa5b8557c0a · outbound

This paper cites Kraj ´ ıˇ cek,Proof complexity, Encyclopedia of Mathematics and Its Applications, Vol.170, Cambridge University Press, (2019).

A proof complexity perspective on effectively zero-knowledge proofs Kraj ´ ıˇ cek,Proof complexity, Encyclopedia of Mathematics and Its Applications, Vol.170, Cambridge University Press, (2019)

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-02T05:03:38.272558Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e5616e99-24cf-4d1a-8b60-49341f81b7f1 · outbound

This paper cites Kraj ´ ıˇ cek,Proof complexity generators, London Mathematical Society Lecture Note Series, No.497, Cambridge University Press, (2025).

A proof complexity perspective on effectively zero-knowledge proofs Kraj ´ ıˇ cek,Proof complexity generators, London Mathematical Society Lecture Note Series, No.497, Cambridge University Press, (2025)

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-02T05:03:38.432619Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3fabeb1b-b730-4f5e-aac0-ab2cb9ddb1d5 · outbound

This paper cites Failure of the strong feasible disjunction property.

A proof complexity perspective on effectively zero-knowledge proofs Failure of the strong feasible disjunction property

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-02T05:03:38.614147Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c56ccac7-b130-4d97-8401-b8ca15d5acb9 · outbound

This paper cites Kraj ´ ıˇ cek and P.

A proof complexity perspective on effectively zero-knowledge proofs Kraj ´ ıˇ cek and P

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-02T05:03:38.766105Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 70f56477-c54a-4e2e-9050-e315be3352c6 · outbound

This paper cites Kraj ´ ıˇ cek and P.

A proof complexity perspective on effectively zero-knowledge proofs Kraj ´ ıˇ cek and P

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-02T05:03:38.887978Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e746a34b-1abb-4566-890c-89e8815408ef · outbound

This paper cites Pudl´ ak, Incompleteness in the finite Domain,Bull.

A proof complexity perspective on effectively zero-knowledge proofs Pudl´ ak, Incompleteness in the finite Domain,Bull

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-02T05:03:39.069860Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9c81ab3f-4042-4afc-aa36-bc343fd9491b · outbound

This paper cites an unresolved cited work.

A proof complexity perspective on effectively zero-knowledge proofs Unresolved cited work

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-02T05:03:39.239027Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 52c2f598-5a3e-4372-bdc3-d2fe3e5b8053 · outbound

This paper cites Rudich, Super-bits, demi-bits, and N P/qpoly-natural proofs, in: Proc.

A proof complexity perspective on effectively zero-knowledge proofs Rudich, Super-bits, demi-bits, and N P/qpoly-natural proofs, in: Proc

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-02T05:03:39.386291Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.