Pith. sign in

Paper Citation Record · LEDGER

Leapfrog Triejoin: a worst-case optimal join algorithm

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

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

pith.paper-citation-record.v1
1210.0481 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-07T06:34:17.273281+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-07T14:07:27.415009Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-08T23:05:44.183922Z

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 9d3742ba-f200-421c-959c-ec62668bf3ec · inbound

A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing cites this paper.

A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing Leapfrog Triejoin: a worst-case optimal join algorithm

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-07T14:07:27.415009Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T14:07:27.415009Z digest=sha256:37c39b461f9712db86509835b1e58b31d4a958932eaf3cc511344a2d48002a81

Observation 0944245e-1b9f-48bc-b205-d7ab602a1153 · inbound

BaCon: Efficient Batch Processing of Counting Queries [Full Version] cites this paper.

BaCon: Efficient Batch Processing of Counting Queries [Full Version] Leapfrog Triejoin: a worst-case optimal join algorithm

Reference 71

Resolution
verified exact
local_arxiv, observed 2026-07-08T23:05:44.185815Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-07-08T23:03:48.556087Z digest=sha256:1ad1022e84ae2d5389c119346557d3125a489c20bbfdeb5024cfc1251b4aa1f3