Pith. sign in

Paper Citation Record · LEDGER

On the query complexity of connectivity with global queries

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

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

pith.paper-citation-record.v1
2109.02115 v1

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-07T05:29:34.608425Z

measured 0 of 1 external citation measurements

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 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.

source=arxiv_source observed=2026-08-07T05:29:34.608425Z digest=sha256:6ee8fbb73a470b063b7893d89996da4043d58239726e27283e688a138efd22c8

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-07-02T04:00:51.707120Z digest=sha256:5681fb76a1ea9479326bc706e946f09fdf7863eaff009f6701c1bdd2af1d52d5