Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-07-14T14:17:34.821409Z
Paper Citation Record · LEDGER
Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries
As of 12 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 0 inbound Pith citation observations for arXiv:2607.09963.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
9 of 9 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved9
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation a0ef85bd-9f98-4e26-8874-a4caa4e1dc26 · outbound
This paper cites Derandomizing Arthur- Merlin games and approximate counting implies exponential-size lower bounds.
Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries Derandomizing Arthur- Merlin games and approximate counting implies exponential-size lower bounds
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-07-14T14:17:34.821409Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 9e486f36-bc11-4ada-a43d-bb6d6a0b95a1 · outbound
This paper cites Symmetric exponential time requires near-maximum circuit size.
Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries Symmetric exponential time requires near-maximum circuit size
Reference 2
- Resolution
- unresolved
- no resolver link, observed 2026-07-14T14:17:34.821409Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ddf8c167-2763-439a-967d-177ef5012951 · outbound
This paper cites Maximum circuit lower bounds for exponential-time Arthur Merlin.
Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries Maximum circuit lower bounds for exponential-time Arthur Merlin
Reference 3
- Resolution
- unresolved
- no resolver link, observed 2026-07-14T14:17:34.821409Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation cea7185f-ea61-4ca7-8ae3-cdb94cd4bd38 · outbound
This paper cites On promise problems: A survey.
Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries On promise problems: A survey
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-07-14T14:17:34.821409Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1cbd8b1a-3d9a-4c66-aae4-b99d241b8424 · outbound
This paper cites Highly resilient correctors for polynomials.
Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries Highly resilient correctors for polynomials
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-07-14T14:17:34.821409Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 89843aba-117b-4658-907c-a2099d0e80da · outbound
This paper cites In search of an easy witness: expo- nential time vs. probabilistic polynomial time.
Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries In search of an easy witness: expo- nential time vs. probabilistic polynomial time
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-07-14T14:17:34.821409Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1d752354-4792-4db4-a0eb-0065e82d40a2 · outbound
This paper cites P = BPP if E requires exponential circuits: derandomizing the XOR lemma.
Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries P = BPP if E requires exponential circuits: derandomizing the XOR lemma
Reference 7
- Resolution
- unresolved
- no resolver link, observed 2026-07-14T14:17:34.821409Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 8236914d-7510-4fed-9969-1a8b1c442cc7 · outbound
This paper cites Circuit lower bounds for nondeterministic quasi-polytime from a new easy witness lemma.
Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries Circuit lower bounds for nondeterministic quasi-polytime from a new easy witness lemma
Reference 8
- Resolution
- unresolved
- no resolver link, observed 2026-07-14T14:17:34.821409Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d031d4d8-cf8a-4b75-be08-c13505c2fafb · outbound
This paper cites NP is as easy as detecting unique solutions.
Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries NP is as easy as detecting unique solutions
Reference 9
- Resolution
- unresolved
- no resolver link, observed 2026-07-14T14:17:34.821409Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.