Pith. sign in

Paper Citation Record · LEDGER

Learning to Route Efficiently with End-to-End Feedback: The Value of Networked Structure

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

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

pith.paper-citation-record.v1
1810.10637 v2

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-21T06:32:19.484+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-12T17:58:56.169551Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-12T17:58:56.243478Z

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 2dbbafbb-0d7a-4ec7-9f7c-b724edc42b58 · inbound

Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds cites this paper.

Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds Learning to Route Efficiently with End-to-End Feedback: The Value of Networked Structure

Reference 38

Resolution
verified exact
local_arxiv, observed 2026-08-12T17:58:56.250859Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=arxiv_source observed=2026-08-12T17:58:56.169551Z digest=sha256:955f1025a9293f0a5d583d3281eeda923bfbdbd2206adb133bdcd853d39c2bb3

Observation 9c56b5c4-5a87-4518-92e5-0087281316a7 · inbound

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths cites this paper.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Learning to Route Efficiently with End-to-End Feedback: The Value of Networked Structure

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-01T23:35:17.201516Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T23:35:17.201516Z digest=sha256:a701615ecddcd2f88367a35d79e183d1259d3ea5fd81fc73561ba8eb02f2bdcd