Paper Citation Record · LEDGER

Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields

As of 10 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 1 inbound Pith citation observation for arXiv:2607.00476.

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

pith.paper-citation-record.v1
2607.00476 v1

Coverage vector

measured 13 of 13 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-02T02:08:58.723289Z

measured 14 of 14 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+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-07-11T19:30:43.940487Z

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

13 of 13 outbound references displayed

verified exact10
verified fuzzy1
unresolved1
parse uncertain0
malformed identifier0
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 978b16d4-d69f-4015-bc04-52b223acee5e · outbound

This paper cites Fieker, W.

Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields Fieker, W

Reference 1

Resolution: metadata mismatch; arxiv_id, observed 2026-07-02T02:16:25.681669Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 23f619c5-ac39-49b2-abea-8e05eb0fb92c · outbound

This paper cites A quasi-optimal lower bound for skew polynomial multiplication.

Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields A quasi-optimal lower bound for skew polynomial multiplication

Reference 2

Resolution: verified exact; arxiv_id, observed 2026-07-02T02:16:25.675328Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation d6d7d1cc-69f7-4f16-88e0-a714aa0dc20f · outbound

This paper cites The equivariant complexity of multiplication in finite field ex- tensions.Journal of Algebra, 622:694–720, 2023.

Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields The equivariant complexity of multiplication in finite field ex- tensions.Journal of Algebra, 622:694–720, 2023

Reference 3

Resolution: verified exact; doi, observed 2026-07-02T02:16:25.683850Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation ab3f8fc3-8897-4193-865b-6bd4b5119f1d · outbound

This paper cites Coding with skew polynomial rings.Journal of Symbolic Compu- tation, 44(12):1644–1656, 2009.

Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields Coding with skew polynomial rings.Journal of Symbolic Compu- tation, 44(12):1644–1656, 2009

Reference 4

Resolution: verified exact; doi, observed 2026-07-02T02:16:25.681016Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 4df22a01-e591-49af-be03-d5523255c2bd · outbound

This paper cites Designs, Codes and Cryptography70(3), 405–431 (2014).https: //doi.org/10.1007/s10623-012-9704-4.

Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields Designs, Codes and Cryptography70(3), 405–431 (2014).https: //doi.org/10.1007/s10623-012-9704-4

Reference 5

Resolution: verified exact; doi, observed 2026-07-02T02:16:25.678491Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 16fb115a-00a2-4836-b9f4-37b611ceeb8a · outbound

This paper cites Factoringinskew-polynomialringsoverfinitefields.Journal of Symbolic Computation, 26(4):463–486, 1998.

Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields Factoringinskew-polynomialringsoverfinitefields.Journal of Symbolic Computation, 26(4):463–486, 1998

Reference 6

Resolution: verified exact; arxiv_id, observed 2026-07-02T02:16:25.677983Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation fd3c3f12-e72d-41a6-a8c8-3bf609d08e45 · outbound

This paper cites Sparse multiplication for skew polynomials.

Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields Sparse multiplication for skew polynomials

Reference 7

Resolution: verified exact; arxiv_id, observed 2026-07-02T02:16:25.630159Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 9a2f6822-2c1d-4b4f-9bb9-4abfbecdf948 · outbound

This paper cites Skew-polynomial-sparse matrix multiplication.Journal of Symbolic Computation, 121:Paper No.

Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields Skew-polynomial-sparse matrix multiplication.Journal of Symbolic Computation, 121:Paper No

Reference 8

Resolution: verified exact; arxiv_id, observed 2026-07-02T02:16:25.639104Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation bf75bf73-8afd-4f59-950e-ba064d56465d · outbound

This paper cites an unresolved cited work.

Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields Unresolved cited work

Reference 9

Resolution: unresolved; raw_fallback, observed 2026-07-06T09:12:10.790836Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 0c3a5d81-0773-4e90-b4b0-0e8409586394 · outbound

This paper cites Skew polynomial rings, Gröbner bases and the letter- place embedding of the free associative algebra.Journal of Symbolic Computation, 48:110–131, 2013.

Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields Skew polynomial rings, Gröbner bases and the letter- place embedding of the free associative algebra.Journal of Symbolic Computation, 48:110–131, 2013

Reference 10

Resolution: verified exact; doi, observed 2026-07-02T02:16:25.673253Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 210541dd-b0c0-44a1-959d-dc37c72ba435 · outbound

This paper cites Sub-quadratic decoding of Gabidulin codes.

Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields Sub-quadratic decoding of Gabidulin codes

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-07-06T09:12:10.789006Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 64a5c1d6-2f17-4bfe-8dbd-537c695d74e6 · outbound

This paper cites Fast operations on linearized polynomials and their applications in coding theory.Journal of Symbolic Computation, 89:194–215, 2018.

Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields Fast operations on linearized polynomials and their applications in coding theory.Journal of Symbolic Computation, 89:194–215, 2018

Reference 12

Resolution: verified exact; doi, observed 2026-07-02T02:16:25.633182Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 206fefbe-0066-4494-85ac-bda3bff0f519 · outbound

This paper cites The Annals of Mathematics 34(3), 480–508 (1933).https://doi.org/10.2307/1968173.

Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields The Annals of Mathematics 34(3), 480–508 (1933).https://doi.org/10.2307/1968173

Reference 13

Resolution: verified exact; doi, observed 2026-07-02T02:16:25.630792Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Pith citing papers

Observation d81dee67-510d-41ab-a8c9-99eac19167f9 · inbound

MechMath Agent Team: LLM Driven Agents for Mathematical Research cites this paper.

MechMath Agent Team: LLM Driven Agents for Mathematical Research Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields

Reference 51

Resolution: unresolved; no resolver link, observed 2026-07-11T19:30:43.940487Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.