Paper Citation Record · LEDGER

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem

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

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

pith.paper-citation-record.v1
2412.19623 v2

Coverage vector

measured 12 of 12 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-11T00:16:02.895423Z

measured 12 of 12 standing notices

One-hop event checks from named stored sources.

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

12 of 12 outbound references displayed

verified exact1
verified fuzzy11
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 8a2a7a8c-4649-4ee6-af18-0d40c9d5c1a5 · outbound

This paper cites On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz.

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T00:16:03.233581Z

Source-reported events for the cited work

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

Observation 5cea2ecb-ed30-4e14-9f64-b5edb0d87be3 · outbound

This paper cites Quantum 3-SAT Is QMA1-Complete.

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem Quantum 3-SAT Is QMA1-Complete

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T00:16:03.112352Z

Source-reported events for the cited work

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

Observation 2a53f0cb-7adb-461d-ae1d-381cc353bc28 · outbound

This paper cites [BH16] Fernando G.

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem [BH16] Fernando G

Reference 262

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T00:16:03.254287Z

Source-reported events for the cited work

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

Observation cf5abc49-e086-4b4b-ac17-346b69cdebd5 · outbound

This paper cites Efficiently Computing Real Roots of Sparse Polyno- mials.

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem Efficiently Computing Real Roots of Sparse Polyno- mials

Reference 1988

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T00:16:03.071274Z

Source-reported events for the cited work

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

Observation 4cfacea7-7ca0-4da7-a50a-6f7b53153b73 · outbound

This paper cites Further Collapses in TFNP.

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem Further Collapses in TFNP

Reference 2003

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T00:16:03.203150Z

Source-reported events for the cited work

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

Observation 51ac1720-4e0d-44b2-a639-849f9292e65b · outbound

This paper cites Bounds on the quantum satisfiability threshold.

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem Bounds on the quantum satisfiability threshold

Reference 2007

Resolution: verified exact; local_arxiv, observed 2026-08-11T00:16:02.976630Z

Source-reported events for the cited work

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

Observation bb2a5265-3d46-4dde-bd3b-2845c4ae0236 · outbound

This paper cites A Linear Time Algorithm for Quantum 2-SAT.

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem A Linear Time Algorithm for Quantum 2-SAT

Reference 2009

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T00:16:03.307873Z

Source-reported events for the cited work

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

Observation 04111d07-a9f0-419d-9e6d-aae08d803cb9 · outbound

This paper cites Intersection Classes in TFNP and Proof Complexity.

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem Intersection Classes in TFNP and Proof Complexity

Reference 2010

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T00:16:03.040425Z

Source-reported events for the cited work

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

Observation bc9fc027-6c2f-4e03-8d4e-cad16d30811e · outbound

This paper cites On the Com- plexity of Modulo-q Arguments and the Chevalley - Warning Theorem.

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem On the Com- plexity of Modulo-q Arguments and the Chevalley - Warning Theorem

Reference 2012

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T00:16:03.153329Z

Source-reported events for the cited work

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

Observation cc78327e-e4a5-460b-b0d5-d801efb8fda4 · outbound

This paper cites [BEKT22] Evangelos Bartzos, Ioannis Z.

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem [BEKT22] Evangelos Bartzos, Ioannis Z

Reference 2016

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T00:16:03.282244Z

Source-reported events for the cited work

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

Observation d261773e-7229-49fa-84c5-b7d16a9f5634 · outbound

This paper cites Linear Time Algo- rithm for Quantum 2SAT.

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem Linear Time Algo- rithm for Quantum 2SAT

Reference 2020

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T00:16:03.335835Z

Source-reported events for the cited work

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

Observation b4c73c78-d007-4e91-ab8e-370c400d39f8 · outbound

This paper cites Computing Minimal Multi-homogeneous Bézout Numbers Is Hard.

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem Computing Minimal Multi-homogeneous Bézout Numbers Is Hard

Reference 2024

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T00:16:03.008888Z

Source-reported events for the cited work

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

Pith citing papers

No inbound Pith citation observations are available.