Pith. sign in

Paper Citation Record · LEDGER

Learned LSM-trees: Two Approaches Using Learned Bloom Filters

As of 22 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 0 inbound Pith citation observations for arXiv:2508.00882.

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

pith.paper-citation-record.v1
2508.00882 v1

Coverage vector

measured 9 of 9 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T14:43:03.895253Z

measured 9 of 9 standing notices

One-hop event checks from named stored sources.

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

9 of 9 outbound references displayed

  • verified exact0
  • verified fuzzy6
  • unresolved2
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation d378f10a-1864-4514-b00d-3d0e58ead555 · outbound

This paper cites Space/time trade-offs in hash coding with allowable errors.

Learned LSM-trees: Two Approaches Using Learned Bloom Filters Space/time trade-offs in hash coding with allowable errors

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-06T14:43:03.804499Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T14:43:03.804499Z digest=sha256:cf190d093ba584b6ad43468ac8b044f86335dda3510ef236bb3dc5d2530de4d8

Observation 62a60f60-c0c5-4dda-acec-66283a710396 · outbound

This paper cites Ada-bf: Adaptive bloom filter with learned model.

Learned LSM-trees: Two Approaches Using Learned Bloom Filters Ada-bf: Adaptive bloom filter with learned model

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:43:04.237076Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T14:43:03.814687Z digest=sha256:2cb4bf23af4ac66a2cf7164790cd6a804a4502a686c4bd7d5997570400dbdbaf

Observation 38870f40-fdc7-4d2d-bf15-630e6bca12c9 · outbound

This paper cites Monkey: Optimal navigable key-value store.

Learned LSM-trees: Two Approaches Using Learned Bloom Filters Monkey: Optimal navigable key-value store

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:43:04.206078Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T14:43:03.823615Z digest=sha256:d76045c81473dd5b5bfce18add0f032b69ab65c764c4e50438df44161bf28ff0

Observation d5987f01-ffad-4397-bfaf-ae4466ef00e4 · outbound

This paper cites Learned cardinalities: Estimating correlated joins with deep learning.

Learned LSM-trees: Two Approaches Using Learned Bloom Filters Learned cardinalities: Estimating correlated joins with deep learning

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:43:04.149153Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T14:43:03.839109Z digest=sha256:3279cfecf82392a72f07925e48db143163a2e4ca9598d8df0250039552ad3ab4

Observation 6bc91ed7-6619-4fd9-9bd1-49133b666b76 · outbound

This paper cites The case for learned index structures.

Learned LSM-trees: Two Approaches Using Learned Bloom Filters The case for learned index structures

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:43:04.111506Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T14:43:03.851737Z digest=sha256:39a42e832ac126830f0c5644bb22e2b6e639cdc866c7a983d517259373be61e7

Observation c66e2ba1-5060-4f87-8722-869a0e53a051 · outbound

This paper cites A model for learned bloom filters and optimizing by sandwiching.

Learned LSM-trees: Two Approaches Using Learned Bloom Filters A model for learned bloom filters and optimizing by sandwiching

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:43:04.084231Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T14:43:03.862022Z digest=sha256:c0f1c394f0f8764145a1979897ea378381aee8989dd2e13b377a645dbd019137

Observation f974e7eb-8bb4-4c6e-ba2d-d7220c2a953d · outbound

This paper cites Algorithms with Predictions.

Learned LSM-trees: Two Approaches Using Learned Bloom Filters Algorithms with Predictions

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-06T14:43:03.870747Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T14:43:03.870747Z digest=sha256:9f0b752b366cd65f8bb13338e06ec25fbca47e60c457d8006fccd0cc5cff7b78

Observation 2e57457e-ce0e-4331-9294-3e22656ddee5 · outbound

This paper cites Abelian subgroups, nilpotent subgroups, and the largest character degree of a finite group.

Learned LSM-trees: Two Approaches Using Learned Bloom Filters Abelian subgroups, nilpotent subgroups, and the largest character degree of a finite group

Reference 8

Resolution
metadata mismatch
local_arxiv, observed 2026-08-06T14:43:04.001184Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T14:43:03.885797Z digest=sha256:d535b4435df5abccb029eb2f1d264bcd863fe293e1373560309abc3530545db7

Observation 64d1d491-0eba-4a3c-ae58-80fbb70280e9 · outbound

This paper cites Learning to index for nearest neighbor search.

Learned LSM-trees: Two Approaches Using Learned Bloom Filters Learning to index for nearest neighbor search

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:43:04.063636Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T14:43:03.895253Z digest=sha256:db5a9649144af64ce9122b9963c77277d5484872d7b457e363cf802e6261e40d

Pith citing papers

No inbound Pith citation observations are available.