Pith. sign in

Paper Citation Record · LEDGER

Search Games with Predictions

As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2401.01149.

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

pith.paper-citation-record.v1
2401.01149 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 3 of 3 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-10T17:00:54.279914Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-20T02:22:59.354206Z

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 64ab6155-2be9-47ce-99ec-d11bc7c2bb80 · inbound

On Tradeoffs in Learning-Augmented Algorithms cites this paper.

On Tradeoffs in Learning-Augmented Algorithms Search Games with Predictions

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-10T17:00:54.279914Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T17:00:54.279914Z digest=sha256:a41bb25d678ad473f76318c9485e16e15bc640ee8c174e0334df364b14d3df56

Observation 57a465b0-ee7d-4c8c-92af-53f1f710ec37 · 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 Search Games with Predictions

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-06T15:45:55.442396Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T15:45:55.442396Z digest=sha256:c8e4763b964d006c516e2ef883bb209c8cf9e059d8db52a4af8e733757a70ead

Observation d618265e-1727-48e4-8941-c8ea8b932363 · inbound

Competitive Search with a Faulty Satnav (GPS): When Probability Matching is Rational cites this paper.

Competitive Search with a Faulty Satnav (GPS): When Probability Matching is Rational Search Games with Predictions

Reference 6

Resolution
verified exact
arxiv_id, observed 2026-05-20T02:22:59.356849Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-20T02:18:33.172934Z digest=sha256:47f4e652d6d675001a1d99ef3cd7af660456e0582f2748d261b804a0ee4f0a5e