Pith. sign in

Paper Citation Record · LEDGER

Faster Matrix Multiplication via Asymmetric Hashing

As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2210.10173.

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

pith.paper-citation-record.v1
2210.10173 v5

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 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 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-12T14:05:43.405803Z

measured 1 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

9
arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 098b1fa6-dec4-4145-9497-3d9e4c474bea · inbound

Asymptotic tensor rank is characterized by polynomials cites this paper.

Asymptotic tensor rank is characterized by polynomials Faster Matrix Multiplication via Asymmetric Hashing

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-12T14:05:43.405803Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T14:05:43.405803Z digest=sha256:9a86bea71a88321db8e1399dd1648ae9d3aaf703c7155182cd81a7133a8e7b0f

Observation 6a91a73d-9640-4b05-a469-6131883932c2 · inbound

When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs? cites this paper.

When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs? Faster Matrix Multiplication via Asymmetric Hashing

Reference 26

Resolution
verified exact
arxiv_id, observed 2026-05-12T05:16:22.920482Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-12T04:43:41.697992Z digest=sha256:14fa6d904d3a0bfcc26c0481b2864a591d1a9f96659807e8475c871bdee42161