Paper Citation Record · LEDGER

Separations above TFNP from Sherali-Adams Lower Bounds

As of 12 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 1 inbound Pith citation observation for arXiv:2602.16810.

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

pith.paper-citation-record.v1
2602.16810 v2

Coverage vector

measured 15 of 15 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-02T22:40:51.391190Z

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 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-06-29T02:18:43.513077Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-01T18:15:58.398389Z

Reference resolution

15 of 15 outbound references displayed

verified exact0
verified fuzzy0
unresolved15
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 0018c37f-d8f5-4c82-bd2a-daa51e5f1121 · outbound

This paper cites Total search problems in ZPP.

Separations above TFNP from Sherali-Adams Lower Bounds Total search problems in ZPP

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-02T22:40:50.181807Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 82b500e5-2c3f-403d-a755-c4421ba87bf6 · outbound

This paper cites Provably Total Functions in the Polynomial Hier- archy.

Separations above TFNP from Sherali-Adams Lower Bounds Provably Total Functions in the Polynomial Hier- archy

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-02T22:40:50.610284Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a73345f9-07d4-4d17-8d8f-827540ddf9c3 · outbound

This paper cites Strong vs.

Separations above TFNP from Sherali-Adams Lower Bounds Strong vs

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-02T22:40:51.153949Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7af3d8be-f58f-44b6-8dd0-597408ce4b72 · outbound

This paper cites Symmetric exponential time requires near-maximum circuit size: Simplified, truly uniform.

Separations above TFNP from Sherali-Adams Lower Bounds Symmetric exponential time requires near-maximum circuit size: Simplified, truly uniform

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-02T22:40:51.283161Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13e386d0-577f-42ac-9111-ac1f97c9995f · outbound

This paper cites TFNP characterizations of proof systems and mono- tone circuits.

Separations above TFNP from Sherali-Adams Lower Bounds TFNP characterizations of proof systems and mono- tone circuits

Reference 1998

Resolution: unresolved; no resolver link, observed 2026-08-02T22:40:49.321131Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2dca93d1-902e-468f-9a00-1789a1634a3b · outbound

This paper cites Symmetric exponential time requires near-maximum circuit size.

Separations above TFNP from Sherali-Adams Lower Bounds Symmetric exponential time requires near-maximum circuit size

Reference 2004

Resolution: unresolved; no resolver link, observed 2026-08-02T22:40:49.648826Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ecf50947-77f6-422a-899c-23b952f75d39 · outbound

This paper cites de Rezende, Aaron Potechin, and Kilian Risse.

Separations above TFNP from Sherali-Adams Lower Bounds de Rezende, Aaron Potechin, and Kilian Risse

Reference 2009

Resolution: unresolved; no resolver link, observed 2026-08-02T22:40:49.996696Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 34a2072f-2fcf-49e7-8018-c87cb2507094 · outbound

This paper cites How to fit large complexity classes into TFNP.

Separations above TFNP from Sherali-Adams Lower Bounds How to fit large complexity classes into TFNP

Reference 2012

Resolution: unresolved; no resolver link, observed 2026-08-02T22:40:51.391190Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b9de5d6e-fc4e-4af3-b676-c4c2a77ffac7 · outbound

This paper cites Separations in Proof Complexity and TFNP.

Separations above TFNP from Sherali-Adams Lower Bounds Separations in Proof Complexity and TFNP

Reference 2019

Resolution: unresolved; no resolver link, observed 2026-08-02T22:40:50.709332Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee664424-5543-4a40-ad6b-c676cf91942a · outbound

This paper cites The hardest explicit construction.

Separations above TFNP from Sherali-Adams Lower Bounds The hardest explicit construction

Reference 2021

Resolution: unresolved; no resolver link, observed 2026-08-02T22:40:51.014515Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c4803ad3-3360-4d10-a12b-aabc3ea8478f · outbound

This paper cites Adventures in monotone complex- ity and TFNP.

Separations above TFNP from Sherali-Adams Lower Bounds Adventures in monotone complex- ity and TFNP

Reference 2022

Resolution: unresolved; no resolver link, observed 2026-08-02T22:40:50.766653Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f74fbc4f-8eb4-4c22-9a3c-21aa41719e82 · outbound

This paper cites Relativized NP search problems and propositional proof systems.

Separations above TFNP from Sherali-Adams Lower Bounds Relativized NP search problems and propositional proof systems

Reference 2023

Resolution: unresolved; no resolver link, observed 2026-08-02T22:40:49.430305Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation beec9344-4455-452c-a080-6557308045d1 · outbound

This paper cites Dantchev, Barnaby Martin, and Mark Nicholas Charles Rhodes.

Separations above TFNP from Sherali-Adams Lower Bounds Dantchev, Barnaby Martin, and Mark Nicholas Charles Rhodes

Reference 2024

Resolution: unresolved; no resolver link, observed 2026-08-02T22:40:49.820690Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a254346a-5998-43ba-b175-12d6f1a4ac6b · outbound

This paper cites Ghenntiyala, L.

Separations above TFNP from Sherali-Adams Lower Bounds Ghenntiyala, L

Reference 2025

Resolution: unresolved; no resolver link, observed 2026-08-02T22:40:50.887999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 272da2f3-baf9-4a2e-b7e5-60094ef03524 · outbound

This paper cites Black-box PPP is not turing-closed.

Separations above TFNP from Sherali-Adams Lower Bounds Black-box PPP is not turing-closed

Reference 2026

Resolution: unresolved; no resolver link, observed 2026-08-02T22:40:50.376972Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation 4813e2c9-377f-48a5-9da0-fa1fcabb997b · inbound

Provable Reductions in TFNP cites this paper.

Provable Reductions in TFNP Separations above TFNP from Sherali-Adams Lower Bounds

Reference 4

Resolution: verified exact; local_arxiv, observed 2026-07-01T18:15:58.400057Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.