Pith. sign in

Paper Citation Record · LEDGER

Graph Searching with Predictions

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

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

pith.paper-citation-record.v1
2212.14220 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-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-07T00:49:22.229353Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-06T15:45:55.637886Z

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 2f9dd4c5-962b-48d6-80d7-b864736e5bc1 · inbound

Efficient Approximate Temporal Triangle Counting in Streaming with Predictions cites this paper.

Efficient Approximate Temporal Triangle Counting in Streaming with Predictions Graph Searching with Predictions

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-07T00:49:22.229353Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:49:22.229353Z digest=sha256:36e84073adbaa7663ce7e487c3fb894f968aed3e0a87e7411e6d4e7b6246d041

Observation 997e955a-84f9-4489-b256-63225d6a4a05 · inbound

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound cites this paper.

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound Graph Searching with Predictions

Reference 3

Resolution
verified exact
local_arxiv, observed 2026-08-06T15:45:55.644719Z

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-06T15:45:55.447631Z digest=sha256:a572fb94e3f0324e41895e99c69450766c039aa8a831ea78bebd3763a8572b9c