Pith. sign in

Paper Citation Record · LEDGER

Optimal distance query reconstruction for graphs without long induced cycles

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

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

pith.paper-citation-record.v1
2306.05979 v4

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-09T06:31:02.800959+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.645998Z

measured 0 of 1 external citation measurements

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

source=arxiv_source observed=2026-08-07T05:29:34.645998Z digest=sha256:a3947ff86346d0acccfd890c38418bd8fe50e7d7c48609aa326810099599c045

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-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T20:34:40.083523Z digest=sha256:8a45b2324ccd2ba46922ea1933991f69b20cec92f6841e7ec04caa1131a24c83