Paper Citation Record · LEDGER

Faster Convolutions: Yates and Strassen Revisited

As of 8 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2505.22410.

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

pith.paper-citation-record.v1
2505.22410 v1

Coverage vector

measured 17 of 17 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T13:21:03.408142Z

measured 17 of 17 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+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

17 of 17 outbound references displayed

verified exact5
verified fuzzy2
unresolved9
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e0f2a420-f9ea-4577-b7a8-0e5cdb8dcdb4 · outbound

This paper cites Bodlaender, Henning Fernau, Ton Kloks, and Rolf Niedermeier.

Faster Convolutions: Yates and Strassen Revisited Bodlaender, Henning Fernau, Ton Kloks, and Rolf Niedermeier

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-07T13:21:01.815481Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4fcc72eb-55b3-4734-86d1-8a4d32881396 · outbound

This paper cites Fast deterministic chromatic number under the asymptotic rank conjecture.

Faster Convolutions: Yates and Strassen Revisited Fast deterministic chromatic number under the asymptotic rank conjecture

Reference 2

Resolution: verified exact; doi, observed 2026-08-07T13:21:04.609239Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation ff8b0bab-76a3-450d-aaf0-67d8dfb88e4a · outbound

This paper cites Fourier meets M¨ obius: Fast subset convolution.

Faster Convolutions: Yates and Strassen Revisited Fourier meets M¨ obius: Fast subset convolution

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-07T13:21:02.085150Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02675c89-a0a6-493e-9d43-87892bca80ad · outbound

This paper cites Fomin, Lukasz Kowalik, Daniel Lokshtanov, D´ aniel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms.

Faster Convolutions: Yates and Strassen Revisited Fomin, Lukasz Kowalik, Daniel Lokshtanov, D´ aniel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-07T13:21:02.291946Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b9882a7-fe7b-4d69-8998-08ade91b09ae · outbound

This paper cites Computing generalized convolutions faster than brute force.Algorithmica, 86(1):334–366, 2024.doi:10.1007/S00453-023-01176-2.

Faster Convolutions: Yates and Strassen Revisited Computing generalized convolutions faster than brute force.Algorithmica, 86(1):334–366, 2024.doi:10.1007/S00453-023-01176-2

Reference 6

Resolution: verified exact; doi, observed 2026-08-07T13:21:04.496564Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 8351a952-0761-4179-a87c-12d1f863cc68 · outbound

This paper cites Faster algebraic algorithms for path and packing problems.

Faster Convolutions: Yates and Strassen Revisited Faster algebraic algorithms for path and packing problems

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-07T13:21:02.528644Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7775e5ba-7638-4be9-a00e-1fefb0a38425 · outbound

This paper cites Limits and applications of group algebras for parame- terized problems.ACM Trans.

Faster Convolutions: Yates and Strassen Revisited Limits and applications of group algebras for parame- terized problems.ACM Trans

Reference 8

Resolution: verified exact; doi, observed 2026-08-07T13:21:04.316247Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 4081dc30-8217-4705-b534-0b2e903cc0e0 · outbound

This paper cites Known algorithms on graphs of bounded treewidth are probably optimal.ACM Trans.

Faster Convolutions: Yates and Strassen Revisited Known algorithms on graphs of bounded treewidth are probably optimal.ACM Trans

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-07T13:21:02.851200Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bfc30998-2869-420d-8285-57cb3fcc4891 · outbound

This paper cites A stronger connection between the asymptotic rank conjecture and the set cover conjecture.

Faster Convolutions: Yates and Strassen Revisited A stronger connection between the asymptotic rank conjecture and the set cover conjecture

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-07T13:21:02.971129Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 99301869-a888-4b7c-bb34-dde61053785e · outbound

This paper cites The Burnside algebra of a finite group.Journal of Combinatorial Theory, 2(4):603–615, 1967.doi:10.1016/S0021-9800(67)80064-4.

Faster Convolutions: Yates and Strassen Revisited The Burnside algebra of a finite group.Journal of Combinatorial Theory, 2(4):603–615, 1967.doi:10.1016/S0021-9800(67)80064-4

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-07T13:21:02.973801Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 41048563-d55d-4c89-8358-2aa140180774 · outbound

This paper cites Strassen.

Faster Convolutions: Yates and Strassen Revisited Strassen

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T13:21:05.747760Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 0263f7da-9e18-45d5-bd4d-df3fdf163bf5 · outbound

This paper cites Strassen.Algebra and Complexity, pages 429–446.

Faster Convolutions: Yates and Strassen Revisited Strassen.Algebra and Complexity, pages 429–446

Reference 13

Resolution: verified exact; doi, observed 2026-08-07T13:21:04.015850Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 18c6429c-2f19-4a2d-b2b4-00ebe270aff0 · outbound

This paper cites Algorithms for vertex partitioning prob- lems on partialk-trees.SIAM J.

Faster Convolutions: Yates and Strassen Revisited Algorithms for vertex partitioning prob- lems on partialk-trees.SIAM J

Reference 14

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T13:21:05.485371Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 5e24cdde-123f-4770-b21c-dfc5696e9292 · outbound

This paper cites Fast generalized DFTs for all finite groups.

Faster Convolutions: Yates and Strassen Revisited Fast generalized DFTs for all finite groups

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-07T13:21:03.138213Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e11d2a44-edef-49d9-b9aa-767f3b697f09 · outbound

This paper cites an unresolved cited work.

Faster Convolutions: Yates and Strassen Revisited Unresolved cited work

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-07T13:21:03.204943Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 91f60f19-b897-455f-a8b1-3743c6333573 · outbound

This paper cites Finding paths of length k in O∗(2k) time.Inf.

Faster Convolutions: Yates and Strassen Revisited Finding paths of length k in O∗(2k) time.Inf

Reference 17

Resolution: verified exact; doi, observed 2026-08-07T13:21:03.730196Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation f85593e3-82a8-4029-ac3d-ca0744d2e173 · outbound

This paper cites The design and analysis of factorial experiments.

Faster Convolutions: Yates and Strassen Revisited The design and analysis of factorial experiments

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T13:21:05.255803Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Pith citing papers

No inbound Pith citation observations are available.