Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Predicting Signed Edges with $O(n^{1+o(1)} \log{n})$ Queries
As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1609.00750.
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-08T06:32:00.761636+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-07T05:29:34.822187Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-07T05:29:34.882872Z
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 2bab7895-e125-4991-8f8e-94c19857a465 · inbound
Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs cites this paper.
Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Predicting Signed Edges with $O(n^{1+o(1)} \log{n})$ Queries
Reference 49
- Resolution
- verified exact
- local_arxiv, observed 2026-08-07T05:29:34.890293Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation ee6505ab-7fcf-4cd4-b6ad-a12430861a7d · inbound
Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds cites this paper.
Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds Predicting Signed Edges with $O(n^{1+o(1)} \log{n})$ Queries
Reference 24
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T13:24:27.562527Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.