Paper Citation Record · LEDGER

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials

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

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

pith.paper-citation-record.v1
2606.27293 v1

Coverage vector

measured 32 of 32 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-06-26T01:44:09.049816Z

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

32 of 32 outbound references displayed

verified exact3
verified fuzzy0
unresolved29
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 47bb5a8c-7bb7-4af4-848b-05ba268acb9a · outbound

This paper cites Constant-depth arithmetic circuits for linear algebra problems.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Constant-depth arithmetic circuits for linear algebra problems

Reference 1

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 645f67dd-97e5-4804-8dc4-b069a97bce2a · outbound

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

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials A primer on the closure of algebraic complexity classes under factoring

Reference 2

Resolution: verified exact; local_arxiv, observed 2026-07-04T15:19:56.575544Z

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 beeeb690-e79f-490d-9767-ea3f75672f42 · outbound

This paper cites Berlekamp.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Berlekamp

Reference 3

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08a9c4a9-ded2-42ac-ae40-8ff267a3c01c · outbound

This paper cites Constant-depth circuits for polynomial GCD over any characteristic.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Constant-depth circuits for polynomial GCD over any characteristic

Reference 4

Resolution: verified exact; arxiv_id, observed 2026-07-04T15:19:56.578713Z

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 d693f5e0-0fa2-4efb-9555-5490171bc88a · outbound

This paper cites Deterministic factorization of constant-depth algebraic circuits in subexponential time.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Deterministic factorization of constant-depth algebraic circuits in subexponential time

Reference 5

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9ca0fbe7-7e33-4d2d-95bf-c18fd6702f8d · outbound

This paper cites Rai, Varun Ramanathan, Ramprasad Saptharishi, and Shubhangi Saraf.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Rai, Varun Ramanathan, Ramprasad Saptharishi, and Shubhangi Saraf

Reference 6

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f85a7421-538e-4f60-8106-cbfd32418714 · outbound

This paper cites A deterministic algorithm for sparse multivariate polynomial interpolation.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials A deterministic algorithm for sparse multivariate polynomial interpolation

Reference 7

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c9775472-3348-4eed-989f-c179a089c784 · outbound

This paper cites Deterministic factorization of sparse polynomials with bounded individual degree.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Deterministic factorization of sparse polynomials with bounded individual degree

Reference 8

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c5d350f4-dd35-4d52-a42f-ea1164e12f85 · outbound

This paper cites On solving sparse polynomial factorization related problems.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials On solving sparse polynomial factorization related problems

Reference 9

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fcc2c0a3-a85f-49c1-8283-940191f143f1 · outbound

This paper cites On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields

Reference 10

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5f1e8ae7-8117-4649-9dbf-8f63cbbfe2a8 · outbound

This paper cites On factorization of sparse polynomials of bounded individual degree.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials On factorization of sparse polynomials of bounded individual degree

Reference 11

Resolution: verified exact; arxiv_id, observed 2026-07-04T15:19:56.581281Z

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 bc905890-3ece-4804-bf4c-824476618a2a · outbound

This paper cites Derandomizing Multivariate Polynomial Factoring for Low Degree Factors.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Derandomizing Multivariate Polynomial Factoring for Low Degree Factors

Reference 12

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6dc4a37c-fc58-4482-ac01-6b8fac5e49e6 · outbound

This paper cites Commutative Algebra with a View Toward Algebraic Geometry , volume 150 of Graduate Texts in Mathematics.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Commutative Algebra with a View Toward Algebraic Geometry , volume 150 of Graduate Texts in Mathematics

Reference 13

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4e872cd3-59fd-434a-b973-afb458f03087 · outbound

This paper cites an unresolved cited work.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Unresolved cited work

Reference 14

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c3356d9c-cedd-4a60-bb06-d02415118188 · outbound

This paper cites Algebraic functions over finite fields.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Algebraic functions over finite fields

Reference 15

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2f31864c-3004-4ffd-bc0f-17c438b99ae3 · outbound

This paper cites The matching problem for bipartite graphs with polynomially bounded permanents is in nc.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials The matching problem for bipartite graphs with polynomially bounded permanents is in nc

Reference 16

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 89e18979-2898-44a2-939d-23aebb37ad3a · outbound

This paper cites an unresolved cited work.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Unresolved cited work

Reference 17

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 903d3970-3860-453d-8ad7-b44860c920ae · outbound

This paper cites Factorization of Polynomials Given by Straight-Line Programs.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Factorization of Polynomials Given by Straight-Line Programs

Reference 18

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d31bbaa0-fa99-444d-90af-af102a1093e4 · outbound

This paper cites Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits , pages 3901--3918.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits , pages 3901--3918

Reference 19

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 27a145c1-a8aa-4df7-8fc1-f3f1c6a0e8f5 · outbound

This paper cites Towards deterministic algorithms for constant-depth factors of constant-depth circuits.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Towards deterministic algorithms for constant-depth factors of constant-depth circuits

Reference 20

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 979f4b3b-184b-4efd-bf97-a915d56430cb · outbound

This paper cites Klivans and Daniel Spielman.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Klivans and Daniel Spielman

Reference 21

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b0f2c3d6-fc8f-4b2e-aead-9f2181a2bd45 · outbound

This paper cites Equivalence of polynomial identity testing and polynomial factorization.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Equivalence of polynomial identity testing and polynomial factorization

Reference 22

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 292701da-ddae-4585-ae3e-6d88c78319b4 · outbound

This paper cites an unresolved cited work.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Unresolved cited work

Reference 23

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7ccc9a36-d7dc-46ee-9226-9113e15e6f2e · outbound

This paper cites an unresolved cited work.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Unresolved cited work

Reference 24

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fb77e049-3ac6-4c6c-8e7d-9dbdaf577220 · outbound

This paper cites an unresolved cited work.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Unresolved cited work

Reference 25

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 42b8dcc5-a235-44d7-ba43-9c25a7301196 · outbound

This paper cites an unresolved cited work.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Unresolved cited work

Reference 26

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 104d3671-07dd-403e-983b-a9122f83a4c2 · outbound

This paper cites Vermeidung von D ivisionen.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Vermeidung von D ivisionen

Reference 27

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e57bd1fb-c8b5-4e37-ac25-69bf38582c78 · outbound

This paper cites On the relation between polynomial identity testing and finding variable disjoint factors.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials On the relation between polynomial identity testing and finding variable disjoint factors

Reference 28

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9dea44e6-e21c-443c-84c6-b2757aa138e5 · outbound

This paper cites Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials

Reference 29

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 74941e04-bf6a-4743-af8a-648945db02f3 · outbound

This paper cites On Some Computations on Sparse Polynomials.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials On Some Computations on Sparse Polynomials

Reference 30

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8d9f164f-f673-4fb8-81d9-20f25e5463c6 · outbound

This paper cites Modern Computer Algebra.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Modern Computer Algebra

Reference 31

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e48e9af4-0868-425a-b27f-b175f0648d75 · outbound

This paper cites Factoring sparse multivariate polynomials.

Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials Factoring sparse multivariate polynomials

Reference 32

Resolution: unresolved; no resolver link, observed 2026-06-26T01:44:09.049816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.