Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
The Sketching Complexity of Graph and Hypergraph Counting
As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1808.04995.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-07-10T06:05:38.945129Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-07-10T06:06:50.419228Z
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 ec05132b-55bb-49e2-9f71-a7b6a7c00a5b · inbound
Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy cites this paper.
Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy The Sketching Complexity of Graph and Hypergraph Counting
Reference 19
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-07-10T06:06:50.423588Z
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.