Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Time-Efficient and High-Quality Graph Partitioning for Graph Dynamic Scaling
As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2101.07026.
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-06T06:34:29.942622+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-06-27T05:29:18.121439Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-06-27T05:30:35.660937Z
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 72b8d276-d86d-4025-8b55-0113851ef848 · inbound
Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling cites this paper.
Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Time-Efficient and High-Quality Graph Partitioning for Graph Dynamic Scaling
Reference 35
- Resolution
- verified exact
- arxiv_id, observed 2026-06-27T05:30:35.662769Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.