Paper Citation Record · LEDGER

QMA Lower Bounds for Batch Verification via Approximate Degree

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

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

pith.paper-citation-record.v1
2607.08888 v1

Coverage vector

measured 42 of 42 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-13T06:00:58.842641Z

measured 42 of 42 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

42 of 42 outbound references displayed

verified exact0
verified fuzzy0
unresolved42
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 324ef86e-1f99-4d81-8e67-d7610314f5e2 · outbound

This paper cites Impossibility of succinct quantum proofs for collision-freeness.

QMA Lower Bounds for Batch Verification via Approximate Degree Impossibility of succinct quantum proofs for collision-freeness

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4bda98d5-7c00-4346-aa73-98918c53f408 · outbound

This paper cites Quantum lower bounds for approximate counting via Laurent polynomials.

QMA Lower Bounds for Batch Verification via Approximate Degree Quantum lower bounds for approximate counting via Laurent polynomials

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cce2ac2b-706d-4f51-8969-bc7fec730abf · outbound

This paper cites Polynomial degree and lower bounds in quantum complexity: Collision and element distinctness with small range.

QMA Lower Bounds for Batch Verification via Approximate Degree Polynomial degree and lower bounds in quantum complexity: Collision and element distinctness with small range

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2e6fa37f-d9ae-4c05-8ca6-325ca5f5c911 · outbound

This paper cites Quantum lower bounds for the collision and the element distinctness problems.

QMA Lower Bounds for Batch Verification via Approximate Degree Quantum lower bounds for the collision and the element distinctness problems

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9265197a-24b4-4976-a86e-a5cea90fb282 · outbound

This paper cites Quantum lower bounds by polynomials.

QMA Lower Bounds for Batch Verification via Approximate Degree Quantum lower bounds by polynomials

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 593de891-f272-4b03-8008-9462106df0a2 · outbound

This paper cites Bounds for small-error and zero-error quantum algorithms.

QMA Lower Bounds for Batch Verification via Approximate Degree Bounds for small-error and zero-error quantum algorithms

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ecb3d88-075a-46a3-9d4a-8400fe40ccc2 · outbound

This paper cites Batch proofs are statistically hiding.

QMA Lower Bounds for Batch Verification via Approximate Degree Batch proofs are statistically hiding

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 369e8b98-b0a8-4ca5-ace2-bf12e8f90d92 · outbound

This paper cites The polynomial method strikes back: Tight quantum query bounds via dual polynomials.

QMA Lower Bounds for Batch Verification via Approximate Degree The polynomial method strikes back: Tight quantum query bounds via dual polynomials

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bf28397d-b9ef-4076-9b2d-e105c94654fb · outbound

This paper cites Dual lower bounds for approximate degree and M arkov-- B ernstein inequalities.

QMA Lower Bounds for Batch Verification via Approximate Degree Dual lower bounds for approximate degree and M arkov-- B ernstein inequalities

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 64b76637-883a-4e68-b7a9-4be2095f025a · outbound

This paper cites Hardness amplification and the approximate degree of constant-depth circuits.

QMA Lower Bounds for Batch Verification via Approximate Degree Hardness amplification and the approximate degree of constant-depth circuits

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f7a98e64-ad4b-46df-a5da-98989682c867 · outbound

This paper cites The large-error approximate degree of AC^0.

QMA Lower Bounds for Batch Verification via Approximate Degree The large-error approximate degree of AC^0

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 529c0e4f-6476-444a-935a-7b9323eb1599 · outbound

This paper cites Approximate degree in classical and quantum computing.

QMA Lower Bounds for Batch Verification via Approximate Degree Approximate degree in classical and quantum computing

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aed46dd8-9312-4a6d-b95e-2d69269965cb · outbound

This paper cites Non-interactive batch arguments for NP from standard assumptions.

QMA Lower Bounds for Batch Verification via Approximate Degree Non-interactive batch arguments for NP from standard assumptions

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 92907515-b297-4b2c-95ed-a26fb9afdab5 · outbound

This paper cites Snargs for P from LWE.

QMA Lower Bounds for Batch Verification via Approximate Degree Snargs for P from LWE

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 625c9071-d7b7-4894-a78d-336f346f0b99 · outbound

This paper cites Non-interactive zero-knowledge from non-interactive batch arguments.

QMA Lower Bounds for Batch Verification via Approximate Degree Non-interactive zero-knowledge from non-interactive batch arguments

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 23a6664e-e66d-4f9c-8322-3d9f8e273943 · outbound

This paper cites Rate-1 non-interactive arguments for batch- NP and applications.

QMA Lower Bounds for Batch Verification via Approximate Degree Rate-1 non-interactive arguments for batch- NP and applications

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7db44cf8-04d7-4dbc-8dfc-f4dfa73eebff · outbound

This paper cites Quantum proofs of proximity.

QMA Lower Bounds for Batch Verification via Approximate Degree Quantum proofs of proximity

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f297dfb2-1a15-4ebf-819b-8ef5952f4e4b · outbound

This paper cites Succinct arguments for batch qma and friends under 8 rounds.

QMA Lower Bounds for Batch Verification via Approximate Degree Succinct arguments for batch qma and friends under 8 rounds

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 047f333a-aa2c-483d-a205-f3052dec71b7 · outbound

This paper cites Sherstov.

QMA Lower Bounds for Batch Verification via Approximate Degree Sherstov

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 68ed2fdf-defb-4d7c-af4b-885450e6fee0 · outbound

This paper cites Quantum search on bounded-error inputs.

QMA Lower Bounds for Batch Verification via Approximate Degree Quantum search on bounded-error inputs

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 99a6a2a1-ba7f-47a4-af0d-c3405602d0ab · outbound

This paper cites On A rthur M erlin games in communication complexity.

QMA Lower Bounds for Batch Verification via Approximate Degree On A rthur M erlin games in communication complexity

Reference 21

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1d5b298d-5ef6-49a6-a14e-a25cf904f893 · outbound

This paper cites Boosting batch arguments and ram delegation.

QMA Lower Bounds for Batch Verification via Approximate Degree Boosting batch arguments and ram delegation

Reference 22

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c0ec939b-96cc-4b6c-bcf6-12668d12344d · outbound

This paper cites How to delegate computations publicly.

QMA Lower Bounds for Batch Verification via Approximate Degree How to delegate computations publicly

Reference 23

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 87221750-ccd2-47db-b31c-123b08786196 · outbound

This paper cites Batch verification for statistical zero knowledge proofs.

QMA Lower Bounds for Batch Verification via Approximate Degree Batch verification for statistical zero knowledge proofs

Reference 24

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 69f0c45e-e89c-441b-8d14-89a5521ac681 · outbound

This paper cites Public-coin statistical zero-knowledge batch verification against malicious verifiers.

QMA Lower Bounds for Batch Verification via Approximate Degree Public-coin statistical zero-knowledge batch verification against malicious verifiers

Reference 25

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a76d43ae-3834-47b0-860d-2459f8f528ae · outbound

This paper cites Doubly-efficient batch verification in statistical zero-knowledge.

QMA Lower Bounds for Batch Verification via Approximate Degree Doubly-efficient batch verification in statistical zero-knowledge

Reference 26

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 480fccb3-dfa3-44e7-9bed-9795c525119a · outbound

This paper cites Somewhere statistical soundness, post-quantum security, and SNARGs.

QMA Lower Bounds for Batch Verification via Approximate Degree Somewhere statistical soundness, post-quantum security, and SNARGs

Reference 27

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ae4a027-a7f4-4413-8ce7-210975aed508 · outbound

This paper cites Lower bounds in communication complexity based on factorization norms.

QMA Lower Bounds for Batch Verification via Approximate Degree Lower bounds in communication complexity based on factorization norms

Reference 28

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 34b5d91d-624c-4bd7-b65c-5a2a917661b6 · outbound

This paper cites Strong batching for non-interactive statistical zero-knowledge.

QMA Lower Bounds for Batch Verification via Approximate Degree Strong batching for non-interactive statistical zero-knowledge

Reference 29

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 867dbb05-ad15-4ef4-afa2-e9a16a833922 · outbound

This paper cites Mande, Justin Thaler, and Shuchen Zhu.

QMA Lower Bounds for Batch Verification via Approximate Degree Mande, Justin Thaler, and Shuchen Zhu

Reference 30

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fccf4c28-1e0c-45ec-869c-94f838424018 · outbound

This paper cites Quantum A rthur- M erlin games.

QMA Lower Bounds for Batch Verification via Approximate Degree Quantum A rthur- M erlin games

Reference 31

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 262d2c92-5e8b-4d8d-8ef9-73b26dae5ad4 · outbound

This paper cites Quantum Statistical Witness Indistinguishability.

QMA Lower Bounds for Batch Verification via Approximate Degree Quantum Statistical Witness Indistinguishability

Reference 32

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 37276557-e86f-4dc6-a133-0f092699096f · outbound

This paper cites Batch verification and proofs of proximity with polylog overhead.

QMA Lower Bounds for Batch Verification via Approximate Degree Batch verification and proofs of proximity with polylog overhead

Reference 33

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ca803d29-0a88-4823-9b3c-722932bea59a · outbound

This paper cites Constant-round interactive proofs for delegating computation.

QMA Lower Bounds for Batch Verification via Approximate Degree Constant-round interactive proofs for delegating computation

Reference 34

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e61c68b6-38ee-4376-9341-26d58286c6b3 · outbound

This paper cites Rothblum, and Ron D.

QMA Lower Bounds for Batch Verification via Approximate Degree Rothblum, and Ron D

Reference 35

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c4d3634d-66b1-4810-9c8f-0c9e88157680 · outbound

This paper cites On the power of quantum proofs.

QMA Lower Bounds for Batch Verification via Approximate Degree On the power of quantum proofs

Reference 36

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f2c5ef03-0b21-4a5e-a945-5ef34e46843d · outbound

This paper cites Sherstov.

QMA Lower Bounds for Batch Verification via Approximate Degree Sherstov

Reference 37

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b0b28bc0-b71e-4bf4-a676-a6a8f050c427 · outbound

This paper cites Sherstov.

QMA Lower Bounds for Batch Verification via Approximate Degree Sherstov

Reference 38

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a5c1d4ab-ff5d-4163-917d-e877222bb469 · outbound

This paper cites Sherstov.

QMA Lower Bounds for Batch Verification via Approximate Degree Sherstov

Reference 39

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ca1c4df8-2236-4751-b0ac-ef5c63cf3c74 · outbound

This paper cites Sherstov.

QMA Lower Bounds for Batch Verification via Approximate Degree Sherstov

Reference 40

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b39a5547-c949-4f33-afd9-a92e9fbfc10b · outbound

This paper cites Sherstov and Justin Thaler.

QMA Lower Bounds for Batch Verification via Approximate Degree Sherstov and Justin Thaler

Reference 41

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2680acd1-6c56-4c64-a4bf-b69d7783a759 · outbound

This paper cites Batch arguments for NP and more from standard bilinear group assumptions.

QMA Lower Bounds for Batch Verification via Approximate Degree Batch arguments for NP and more from standard bilinear group assumptions

Reference 42

Resolution: unresolved; no resolver link, observed 2026-07-13T06:00:58.842641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.