Pith. sign in

Paper Citation Record · LEDGER

On the hardness of code equivalence problems in rank metric

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

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

pith.paper-citation-record.v1
2011.04611 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 3 of 3 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-05T21:00:13.998239Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-25T03:56:36.482741Z

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 2caa03eb-3141-4a51-ae40-e050a837e4bc · inbound

New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 cites this paper.

New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 On the hardness of code equivalence problems in rank metric

Reference 7

Resolution
verified exact
arxiv_id, observed 2026-05-25T03:56:36.485229Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-25T03:55:56.878631Z digest=sha256:02e76f4d4029f8b36477e0071c5c7a140a2f094c8ac7377a34b0db2e12017ff5

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

A Survey on Code Equivalence: The State-of-the-Art and Open Questions cites this paper.

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.

source=pdf_text observed=2026-08-02T06:24:52.207723Z digest=sha256:9abfde4da5861831024650a37d6d7c62719c9df9ddb51bf9435c0802be2344c7

Observation df1c7d9e-1037-462c-ac8f-43073ad0442a · inbound

Breaking ACDGV MinRank Gabidulin encryption schemes over matrix codes cites this paper.

Breaking ACDGV MinRank Gabidulin encryption schemes over matrix codes On the hardness of code equivalence problems in rank metric

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-05T21:00:13.998239Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T21:00:13.998239Z digest=sha256:32326ff0033362b7a10f9cd8308ea5c155ae9cefce382eb6bdfb3d43049ce289