Pith. sign in

Paper Citation Record · LEDGER

Approximate Top-$k$ for Increased Parallelism

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

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

pith.paper-citation-record.v1
2412.04358 v1

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-10T06:31:04.303077+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-09T15:48:57.300444Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-11T20:11:12.491036Z

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 0495ef66-ac52-4368-8bcb-20f2bbfd8e87 · inbound

Accelerating Linear Recurrent Neural Networks for the Edge with Unstructured Sparsity cites this paper.

Accelerating Linear Recurrent Neural Networks for the Edge with Unstructured Sparsity Approximate Top-$k$ for Increased Parallelism

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-09T15:48:57.300444Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-09T15:48:57.300444Z digest=sha256:04f0e29a82a1eb0aaf90b58dd2f3cde260f0832626867cd7dc8c547b30b95d27

Observation e03806d8-a926-47eb-b431-376e960302b8 · inbound

Guess-Verify-Refine: Data-Aware Top-K for Sparse-Attention Decoding on Blackwell via Temporal Correlation cites this paper.

Guess-Verify-Refine: Data-Aware Top-K for Sparse-Attention Decoding on Blackwell via Temporal Correlation Approximate Top-$k$ for Increased Parallelism

Reference 4

Resolution
verified exact
arxiv_id, observed 2026-05-11T20:11:12.494204Z

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.

source=pdf_text observed=2026-05-08T09:58:45.903396Z digest=sha256:1d9d6d4a3417cd744c81a5bbdc43c3d712461575dbb5f1d7f806e8df549b6122