Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Optimal distance query reconstruction for graphs without long induced cycles
As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2306.05979.
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-15T21:12:09.139118Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-06T20:34:42.037125Z
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 43088184-9088-4720-acb5-3bb07d7be862 · inbound
Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing cites this paper.
Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing Optimal distance query reconstruction for graphs without long induced cycles
Reference 2024
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T21:12:09.139118Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 3c24af9a-74e8-4676-afd0-7cca55b53131 · inbound
Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs cites this paper.
Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs Optimal distance query reconstruction for graphs without long induced cycles
Reference 15
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:29:34.645998Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 516cef24-3337-4fdd-8876-ea33865def3b · inbound
Complexity of learning matchings and half graphs via edge queries cites this paper.
Complexity of learning matchings and half graphs via edge queries Optimal distance query reconstruction for graphs without long induced cycles
Reference 11
- Resolution
- verified exact
- local_arxiv, observed 2026-08-06T20:34:42.100188Z
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.