Paper Citation Record · LEDGER

Completeness classes in algebraic complexity theory

As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2406.06217.

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

pith.paper-citation-record.v1
2406.06217 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 5 of 5 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 5 of 5 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-15T18:39:16.032454Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-04T19:20:07.194246Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 73f414b6-ede9-4ce8-bbd0-7f0dfa047bc4 · inbound

A primer on the closure of algebraic complexity classes under factoring cites this paper.

A primer on the closure of algebraic complexity classes under factoring Completeness classes in algebraic complexity theory

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-15T18:39:16.032454Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 126cb685-95b6-4ca3-8a5c-f201ddfb7247 · inbound

Field-independent Kronecker-plethysm isomorphisms cites this paper.

Field-independent Kronecker-plethysm isomorphisms Completeness classes in algebraic complexity theory

Reference 5

Resolution: verified exact; arxiv_id, observed 2026-05-18T18:01:43.782230Z

Source-reported events for the cited work

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

Observation 2e707104-35e2-494d-a302-2eb410de0950 · inbound

Planar Perfect Matching Counting is as Hard as Determinants cites this paper.

Planar Perfect Matching Counting is as Hard as Determinants Completeness classes in algebraic complexity theory

Reference 7

Resolution: verified exact; arxiv_id, observed 2026-07-02T07:06:43.916439Z

Source-reported events for the cited work

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

Observation d4f3e1eb-78db-49e1-a463-07a354c3de8d · inbound

Intractability of Hilbert's Nullstellensatz implies algebraic hardness of permanent cites this paper.

Intractability of Hilbert's Nullstellensatz implies algebraic hardness of permanent Completeness classes in algebraic complexity theory

Reference 4

Resolution: metadata mismatch; arxiv_id, observed 2026-07-04T19:20:07.195921Z

Source-reported events for the cited work

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

Observation bf4fda9b-5110-41c8-b532-e08c3ca44d6d · inbound

Quantum determinants in polynomial time cites this paper.

Quantum determinants in polynomial time Completeness classes in algebraic complexity theory

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-02T06:06:30.894786Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.