Paper Citation Record · LEDGER

A Survey on Code Equivalence: The State-of-the-Art and Open Questions

As of 14 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2607.12870.

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

pith.paper-citation-record.v1
2607.12870 v2

Coverage vector

measured 44 of 44 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-02T06:24:54.175440Z

measured 44 of 44 standing notices

One-hop event checks from named stored sources.

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

44 of 44 outbound references displayed

verified exact0
verified fuzzy0
unresolved44
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation c45ab0dc-574b-43c0-ac2a-70072782ac50 · outbound

This paper cites an unresolved cited work.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Unresolved cited work

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:49.993144Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f41d5ce7-b329-4958-be4d-ddef329e87ab · outbound

This paper cites Albrecht, Benjamin Benčina, and Russell W.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Albrecht, Benjamin Benčina, and Russell W

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:50.082200Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 40a62d48-3e15-42c3-91d8-326cf88ccf3a · outbound

This paper cites Graph isomorphism in quasipolynomial time.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Graph isomorphism in quasipolynomial time

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:50.148725Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eb224dcb-b687-47bc-9cae-236ddf618e1a · outbound

This paper cites Grochow, and Youming Qiao.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Grochow, and Youming Qiao

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:50.241784Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8aadb79b-0993-4a4f-8579-23ca90ffe536 · outbound

This paper cites SPECK: Signatures from Permu- tation Equivalence of Codes and Kernels.Cryptology ePrint Archive, 2025.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions SPECK: Signatures from Permu- tation Equivalence of Codes and Kernels.Cryptology ePrint Archive, 2025

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:50.293920Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation afac2cd2-2eae-4845-b802-96ff5464d0b1 · outbound

This paper cites Solving the linear code equivalence problem from single code- word matching.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Solving the linear code equivalence problem from single code- word matching

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:50.359202Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b62f57b7-9ba4-4d74-a761-4a813ec9f478 · outbound

This paper cites Permutation code equivalence is not harder than graph isomorphism when hulls are trivial.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Permutation code equivalence is not harder than graph isomorphism when hulls are trivial

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:50.391606Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f45ef048-5b61-4ecf-bcc7-8fc977540d18 · outbound

This paper cites Advancedsignaturefunctionalitiesfromthecodeequiva- lence problem.International Journal of Computer Mathematics: Computer Systems Theory, 7(2):112–128, 2022.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Advancedsignaturefunctionalitiesfromthecodeequiva- lence problem.International Journal of Computer Mathematics: Computer Systems Theory, 7(2):112–128, 2022

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:50.396171Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9f30a7ee-1866-4169-9b4c-fa10f06c7ad5 · outbound

This paper cites On the computational hardness of the code equivalence problem in cryptography.Advances in Mathematics of Communications, 17(1):23–55, 2023.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions On the computational hardness of the code equivalence problem in cryptography.Advances in Mathematics of Communications, 17(1):23–55, 2023

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:50.532121Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6859e1d5-d9df-4270-b301-c421322fcdae · outbound

This paper cites The power of power codes: New classes of easy instances for the linear equivalence problem, 2026.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions The power of power codes: New classes of easy instances for the linear equivalence problem, 2026

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:50.636995Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e9573ce8-11b5-4fac-930e-9a2c5246d959 · outbound

This paper cites VOLE-in-the- Head Signatures Based on the Linear Code Equivalence Problem.Cryptol- ogy ePrint Archive, 2025.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions VOLE-in-the- Head Signatures Based on the Linear Code Equivalence Problem.Cryptol- ogy ePrint Archive, 2025

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:50.761301Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ad978587-620d-4fc2-a110-28bb699ed962 · outbound

This paper cites Using the Schur prod- uct to solve the code equivalence problem.ePrint, 2025.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Using the Schur prod- uct to solve the code equivalence problem.ePrint, 2025

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:50.974211Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bec731d5-d649-406e-8ca1-41546b13e3a2 · outbound

This paper cites Asymp- totic improvements to provable algorithms for the code equivalence prob- lem.IEEE Transactions on Information Theory, 72(2):1093–1108, 2025.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Asymp- totic improvements to provable algorithms for the code equivalence prob- lem.IEEE Transactions on Information Theory, 72(2):1093–1108, 2025

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:51.122313Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08903126-566b-4436-8db4-898582f672f6 · outbound

This paper cites Relating code equivalence to other isomorphism problems.Designs, Codes and Cryptography, 93(3):701– 723, 2025.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Relating code equivalence to other isomorphism problems.Designs, Codes and Cryptography, 93(3):701– 723, 2025

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:51.297158Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 76c47b57-6ef9-46b9-a6fa-59c3d8fc2225 · outbound

This paper cites Not enough LESS: an improved algorithm for solving code equivalence problems overFq.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Not enough LESS: an improved algorithm for solving code equivalence problems overFq

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:51.395552Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4b828f78-ef57-4fc9-a498-9969569344f2 · outbound

This paper cites A search-to-decision reduction for the permutation code equivalence problem.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions A search-to-decision reduction for the permutation code equivalence problem

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:51.552670Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 30d0ee4e-bdaa-4364-bf92-e4ff378e2be0 · outbound

This paper cites LESS is more: code-based signatures without syndromes.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions LESS is more: code-based signatures without syndromes

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:51.595564Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9b9aac16-4f63-4cef-a99c-d17cc1c66f33 · outbound

This paper cites Don’t use it twice! Solving relaxed linear equivalence problems.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Don’t use it twice! Solving relaxed linear equivalence problems

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:51.654273Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0e72939c-01e8-4c75-8cc0-5199e3c293e6 · outbound

This paper cites Onepairtorulethemall: Anoptimal algorithm for solving code equivalence via codeword search.ePrint, 2026.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Onepairtorulethemall: Anoptimal algorithm for solving code equivalence via codeword search.ePrint, 2026

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:51.719793Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5e944198-1e8e-4dd2-a636-e5ea3ea3cfb9 · outbound

This paper cites Two is all it takes: Asymptotic and concrete improvements for solving code equivalence.ePrint, 2025.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Two is all it takes: Asymptotic and concrete improvements for solving code equivalence.ePrint, 2025

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:51.784342Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3d519b27-779e-48ea-9e31-4b820b2dc907 · outbound

This paper cites Linear codes overF q are equivalent to LCD codes forq >3.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Linear codes overF q are equivalent to LCD codes forq >3

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:51.850714Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 117522d1-c554-497c-a18a-7c9a1e753d40 · outbound

This paper cites Reductions between code equivalence problems.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Reductions between code equivalence problems

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:51.917659Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f3a60d67-781b-4342-8d27-51467aa435a0 · outbound

This paper cites On linear equivalence, canonical forms, and digital signatures.Designs, Codes and Cryptography, pages 1–43, 2025.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions On linear equivalence, canonical forms, and digital signatures.Designs, Codes and Cryptography, pages 1–43, 2025

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:51.996287Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cb6681eb-8c00-44ad-bf2c-4235f770155a · outbound

This paper cites On the hardness of code equivalence problems in rank metric.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions On the hardness of code equivalence problems in rank metric

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:52.207723Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8a133f95-8cb7-4995-b214-0de6f84402ee · outbound

This paper cites Hull attacks on the lattice isomorphism problem.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Hull attacks on the lattice isomorphism problem

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:52.341519Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 76213978-0900-4eb1-bb8d-6c2680bbd11f · outbound

This paper cites Monomial isomorphism for tensors and applica- tions to code equivalence problems.Designs, Codes and Cryptography, 92(7):1961–1982, 2024.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Monomial isomorphism for tensors and applica- tions to code equivalence problems.Designs, Codes and Cryptography, 92(7):1961–1982, 2024

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:52.509947Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4c530582-75d6-47b2-b2e7-d7c42db9d7e3 · outbound

This paper cites On the hardness of the decoding and the minimum distance problems for rank codes.IEEE Transactions on Information Theory, 62(12):7245–7252, 2016.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions On the hardness of the decoding and the minimum distance problems for rank codes.IEEE Transactions on Information Theory, 62(12):7245–7252, 2016

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:52.544581Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 54f27ea5-c52e-41d1-bacc-d98f2a0be479 · outbound

This paper cites Complexity of finding automorphism group of code.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Complexity of finding automorphism group of code

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:52.632380Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 784dc5f4-b13b-46e7-90a1-b80a3caaff32 · outbound

This paper cites Matrix isomorphism of matrix lie algebras.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Matrix isomorphism of matrix lie algebras

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:52.713771Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 870fc566-c9e6-4e8c-aa8a-a0b5cbb1c959 · outbound

This paper cites On the complexity of isomorphism problems for tensors, groups, and polynomials i: tensor isomorphism- completeness.SIAM Journal on Computing, 52(2):568–617, 2023.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions On the complexity of isomorphism problems for tensors, groups, and polynomials i: tensor isomorphism- completeness.SIAM Journal on Computing, 52(2):568–617, 2023

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:52.806588Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 23f14cb7-3811-4ee8-8d13-a06d23c7fda6 · outbound

This paper cites Tanuki: New Frameworks for (Concurrently Se- cure)BlindSignaturesfromPost-QuantumGroupActions.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Tanuki: New Frameworks for (Concurrently Se- cure)BlindSignaturesfromPost-QuantumGroupActions

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:52.882495Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 203ddb20-9100-4853-80ea-381bb06d426c · outbound

This paper cites Springer, 2006.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Springer, 2006

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:52.980610Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 734237fb-330e-4f1d-af70-76b194219432 · outbound

This paper cites Code equivalence, point set equivalence, and polynomial isomorphism.arXiv:2511.06843, 2025.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Code equivalence, point set equivalence, and polynomial isomorphism.arXiv:2511.06843, 2025

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:53.118791Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0943280b-e317-487e-8e8a-0136e73b597e · outbound

This paper cites Rigid linear binary codes.Journal of Combinatorial Theory, Series A, 63(1):110–128, 1993.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Rigid linear binary codes.Journal of Combinatorial Theory, Series A, 63(1):110–128, 1993

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:53.205508Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aa14c374-1298-466e-bd9d-87c9658b2321 · outbound

This paper cites Computing automorphism groups of error-correcting codes.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Computing automorphism groups of error-correcting codes

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:53.324784Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 564099eb-7aa7-42e7-a8d5-a6b27d1aa69d · outbound

This paper cites A note on the graph isomorphism counting problem.Inf.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions A note on the graph isomorphism counting problem.Inf

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:53.385734Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f768f7cd-d41e-4a34-8110-cbe391fff2d4 · outbound

This paper cites An improved algorithm for code equivalence.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions An improved algorithm for code equivalence

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:53.486758Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f12822aa-93cc-41df-83f6-f0b6c1580cf8 · outbound

This paper cites Codes, cryptology and curves with computer algebra, volume 1.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Codes, cryptology and curves with computer algebra, volume 1

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:53.574577Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 07da175b-5052-47c6-90a4-18bfd9400649 · outbound

This paper cites Is code equivalence easy to decide?IEEE Transactions on Information Theory, 43(5):1602–1604, 1997.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Is code equivalence easy to decide?IEEE Transactions on Information Theory, 43(5):1602–1604, 1997

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:53.660321Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d443a58f-d463-49c2-992e-80d8791b4e1b · outbound

This paper cites PhD thesis, Normandie Université; University of Khartoum, 2017.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions PhD thesis, Normandie Université; University of Khartoum, 2017

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:53.746451Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a4de58e5-1f73-4062-a3cb-e25aa6c4f57c · outbound

This paper cites Computational hard- ness of the permuted kernel and subcode equivalence problems.IEEE Transactions on Information Theory, 2023.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Computational hard- ness of the permuted kernel and subcode equivalence problems.IEEE Transactions on Information Theory, 2023

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:53.824549Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 11d06b21-1f54-48e3-902c-26deabec5611 · outbound

This paper cites Finding the permutation between equivalent linear codes: The support splitting algorithm.IEEE Transactions on Information The- ory, 46(4):1193–1203, 2000.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions Finding the permutation between equivalent linear codes: The support splitting algorithm.IEEE Transactions on Information The- ory, 46(4):1193–1203, 2000

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:53.900807Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b52b1703-d037-492a-8a36-9dc5bc19698a · outbound

This paper cites The hardness of code equivalence overF q and its application to code-based cryptography.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions The hardness of code equivalence overF q and its application to code-based cryptography

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:54.026726Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1e8381c9-9a8b-4fda-9241-2e660c8e5e8e · outbound

This paper cites How easy is code equivalence over Fq? InInternational Workshop on Coding and Cryptography-WCC 2013, 2013.

A Survey on Code Equivalence: The State-of-the-Art and Open Questions How easy is code equivalence over Fq? InInternational Workshop on Coding and Cryptography-WCC 2013, 2013

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-02T06:24:54.175440Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.