Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
On the query complexity of connectivity with global queries
As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2109.02115.
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-19T06:32:44.657259+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-15T23:23:48.567948Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-02T04:06:34.632759Z
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 8459ad07-2c91-41aa-bee4-3d25b9e21270 · inbound
Learning Partitions with Optimal Query and Round Complexities cites this paper.
Learning Partitions with Optimal Query and Round Complexities On the query complexity of connectivity with global queries
Reference 9
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T23:23:48.567948Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b12858ba-b8b0-43c9-af63-fc054416dbdc · inbound
Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs cites this paper.
Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs On the query complexity of connectivity with global queries
Reference 8
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:29:34.608425Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 50ca7307-287e-4379-addf-40dbf8908582 · inbound
Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles cites this paper.
Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles On the query complexity of connectivity with global queries
Reference 5
- Resolution
- verified exact
- arxiv_id, observed 2026-07-02T04:06:34.634273Z
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.