Paper Citation Record · LEDGER

Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection

As of 19 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2608.12573.

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

pith.paper-citation-record.v1
2608.12573 v1

Coverage vector

measured 16 of 16 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-16T00:10:55.084026Z

measured 16 of 16 standing notices

One-hop event checks from named stored sources.

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

16 of 16 outbound references displayed

verified exact0
verified fuzzy10
unresolved6
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 1c086fbc-fbfe-4c7d-8e98-2b5b9cf48e94 · outbound

This paper cites Best position al- gorithms for efficient top-k query processing.Information Systems, 36(6): 973–989, 2011.

Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection Best position al- gorithms for efficient top-k query processing.Information Systems, 36(6): 973–989, 2011

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:10:55.283510Z

Source-reported events for the cited work

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

Observation 3eba05bf-e3d3-48d0-bf08-90fb101d7f25 · outbound

This paper cites Efficient top-k query processing on massively parallel hardware.

Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection Efficient top-k query processing on massively parallel hardware

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:10:55.272641Z

Source-reported events for the cited work

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

Observation 77fe530e-dcb6-4439-9e2c-8fd538c6e39a · outbound

This paper cites The sparsely-gated mixture-of-experts layer.Outrageously large neural networks, 2:2, 2017.

Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection The sparsely-gated mixture-of-experts layer.Outrageously large neural networks, 2:2, 2017

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:10:55.260423Z

Source-reported events for the cited work

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

Observation ad9bce5a-146c-4a8e-b19d-6a098200b9c9 · outbound

This paper cites GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding.

Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-16T00:10:55.037454Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d44bed4f-5bb1-461d-8486-356be4d38769 · outbound

This paper cites Switch transformers: Scaling to trillion parameter models with simple and efficient sparsity.

Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection Switch transformers: Scaling to trillion parameter models with simple and efficient sparsity

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-16T00:10:55.042215Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a9591f00-6135-4051-b16d-70faecf76dcd · outbound

This paper cites BatchTopK Sparse Autoencoders.

Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection BatchTopK Sparse Autoencoders

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-16T00:10:55.045966Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4951e4b0-08d5-474f-aa46-4bcae0a104c2 · outbound

This paper cites Fast k-selection algorithms for graphics processing units.Journal of Experimental Algorithmics (JEA), 17:4–1, 2012.

Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection Fast k-selection algorithms for graphics processing units.Journal of Experimental Algorithmics (JEA), 17:4–1, 2012

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:10:55.241787Z

Source-reported events for the cited work

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

Observation 15432273-3c4d-4c74-a570-f3e622bf3f2f · outbound

This paper cites an unresolved cited work.

Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection Unresolved cited work

Reference 8

Resolution: unresolved; raw_fallback, observed 2026-08-16T00:10:55.229313Z

Source-reported events for the cited work

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

Observation ace886d7-5c02-48f1-ae39-41a4ad0389d8 · outbound

This paper cites Parallel top-k algorithms on gpu: A comprehensive study and new methods.

Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection Parallel top-k algorithms on gpu: A comprehensive study and new methods

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:10:55.217116Z

Source-reported events for the cited work

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

Observation 0d6b83bb-2eb9-4289-8660-9ef7752775b9 · outbound

This paper cites Rtop-k: Ultra-fast row-wise top-k selection for neural network acceleration on gpus.

Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection Rtop-k: Ultra-fast row-wise top-k selection for neural network acceleration on gpus

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:10:55.205484Z

Source-reported events for the cited work

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

Observation 53a5643b-49c2-4976-9e46-5a8be2193542 · outbound

This paper cites Radik: scalable and optimized gpu-parallel radix top-k selection.

Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection Radik: scalable and optimized gpu-parallel radix top-k selection

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:10:55.194173Z

Source-reported events for the cited work

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

Observation 34ab12f0-c54b-4c60-aaa9-933d4583e0e9 · outbound

This paper cites Language models are unsupervised multitask learners.

Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection Language models are unsupervised multitask learners

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-16T00:10:55.068413Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7bc52018-a70c-4e09-8d92-02a80ad2d7df · outbound

This paper cites Gemma 2: Improving Open Language Models at a Practical Size.

Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection Gemma 2: Improving Open Language Models at a Practical Size

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-16T00:10:55.071840Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6c9ff8b5-5b85-43bb-b7ba-2fd09c54d5c5 · outbound

This paper cites Space-efficient online computation of quantile summaries.ACM SIGMOD Record, 30(2):58–66, 2001.

Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection Space-efficient online computation of quantile summaries.ACM SIGMOD Record, 30(2):58–66, 2001

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:10:55.175917Z

Source-reported events for the cited work

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

Observation 3c963204-5ca2-487e-8c65-6e5db47dda77 · outbound

This paper cites dictionary_learning.

Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection dictionary_learning

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:10:55.162959Z

Source-reported events for the cited work

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

Observation b128d1f0-f84b-40d2-b311-3a695dd57f31 · outbound

This paper cites John Wiley & Sons, 2004.

Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection John Wiley & Sons, 2004

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:10:55.149506Z

Source-reported events for the cited work

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

Pith citing papers

No inbound Pith citation observations are available.