Paper Citation Record · LEDGER

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths

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

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

pith.paper-citation-record.v1
2607.15440 v1

Coverage vector

measured 32 of 32 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T23:35:17.201516Z

measured 32 of 32 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 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

32 of 32 outbound references displayed

verified exact0
verified fuzzy0
unresolved32
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 51b10b91-16c7-4170-9323-ebd9e3e92c32 · outbound

This paper cites Finite-time analysis of the multiarmed bandit problem.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Finite-time analysis of the multiarmed bandit problem

Reference 1

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e005fc6c-8ced-4f4a-b0fa-c07ed0d722ec · outbound

This paper cites Learning to act using real-time dynamic programming.Artificial Intelligence, 72:81–138, 02 1993.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Learning to act using real-time dynamic programming.Artificial Intelligence, 72:81–138, 02 1993

Reference 2

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 87c08095-5aa4-4942-8ee3-296589652951 · outbound

This paper cites Labeled rtdp: improving the convergence of real-time dynamic programming.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Labeled rtdp: improving the convergence of real-time dynamic programming

Reference 3

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2e542c77-789e-4405-8168-227871380623 · outbound

This paper cites Entanglement distribution in a quantum network: A multicommodity flow-based approach.IEEE Transactions on Quantum Engineering, 1:1–21, 2020.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Entanglement distribution in a quantum network: A multicommodity flow-based approach.IEEE Transactions on Quantum Engineering, 1:1–21, 2020

Reference 4

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a264be83-7392-46a5-8e60-150cf032159b · outbound

This paper cites An empirical evaluation of thompson sampling.Advances in neural information processing systems, 24, 2011.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths An empirical evaluation of thompson sampling.Advances in neural information processing systems, 24, 2011

Reference 5

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4bae6962-2b9b-42c1-a261-8af6b53d92a7 · outbound

This paper cites A thompson sampling algorithm for cascading bandits.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths A thompson sampling algorithm for cascading bandits

Reference 6

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8dc26c7f-ebec-4e98-9cca-2516e222ae94 · outbound

This paper cites Near-optimal regret bounds for stochastic shortest path.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Near-optimal regret bounds for stochastic shortest path

Reference 7

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5744d792-ac98-44c7-b68a-7c96d83fc34b · outbound

This paper cites A tutorial on thompson sampling.Foundations and Trends® in Machine Learning, 11(1):1–99, 2018.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths A tutorial on thompson sampling.Foundations and Trends® in Machine Learning, 11(1):1–99, 2018

Reference 8

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a9a6f6c8-15b9-457a-9790-92b84b829e00 · outbound

This paper cites John Wiley & Sons, 2005.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths John Wiley & Sons, 2005

Reference 9

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a98696e6-a718-4e03-abe6-449ca6525ae2 · outbound

This paper cites A note on two problems in connexion with graphs.Numerische Mathematik, 1(1):269–271, 1959.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths A note on two problems in connexion with graphs.Numerische Mathematik, 1(1):269–271, 1959

Reference 10

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation da400d01-369a-48d6-a330-e724c7b6d62b · outbound

This paper cites Srikant, and Wei Chen.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Srikant, and Wei Chen

Reference 11

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b5e8c3fd-0a6b-40f1-8a8c-58f19ae7b8bc · outbound

This paper cites Erdös and A.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Erdös and A

Reference 12

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98393629-e2a4-40c2-b33d-680a837216b3 · outbound

This paper cites Posterior sampling-based online learning for the stochastic shortest path model.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Posterior sampling-based online learning for the stochastic shortest path model

Reference 13

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2e26748f-0897-4a2c-bec7-50cf1eaea02c · outbound

This paper cites Stochastic shortest path with sparse adversarial costs.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Stochastic shortest path with sparse adversarial costs

Reference 14

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 36d5513d-e8ee-41e2-b296-377fcc1e5051 · outbound

This paper cites The internet topology zoo.IEEE Journal on Selected Areas in Communications, 29(9):1765–1775, 2011.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths The internet topology zoo.IEEE Journal on Selected Areas in Communications, 29(9):1765–1775, 2011

Reference 15

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c43606d-d06a-40bb-bff1-60909d86f7d6 · outbound

This paper cites Cascading bandits: learning to rank in the cascade model.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Cascading bandits: learning to rank in the cascade model

Reference 16

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6caeb6d4-0d45-48fb-a0e6-db78866045bf · outbound

This paper cites Combinatorial cascading bandits.Advances in Neural Information Processing Systems, 28, 2015.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Combinatorial cascading bandits.Advances in Neural Information Processing Systems, 28, 2015

Reference 17

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 195cc147-c5f1-4b48-8901-93a9de04cebb · outbound

This paper cites Asymptotically efficient adaptive allocation rules.Ad- vances in applied mathematics, 6(1):4–22, 1985.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Asymptotically efficient adaptive allocation rules.Ad- vances in applied mathematics, 6(1):4–22, 1985

Reference 18

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b30caa9d-d687-4904-aa40-fa1c0dcaac1f · outbound

This paper cites Cambridge University Press, 2020.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Cambridge University Press, 2020

Reference 19

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 91298532-156a-4553-abc6-82a9e1eb259e · outbound

This paper cites Contextual combinatorial cascading bandits.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Contextual combinatorial cascading bandits

Reference 20

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b771719a-7a6b-4ad2-bbf5-3b3f8d6a9ab3 · outbound

This paper cites Maheshwari.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Maheshwari

Reference 21

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2e095413-d2c9-4a6a-bd9a-b1ee9623e94e · outbound

This paper cites Bounded real-time dynamic programming: Rtdp with monotone upper bounds and performance guarantees.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Bounded real-time dynamic programming: Rtdp with monotone upper bounds and performance guarantees

Reference 22

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 047a1bd1-d8c8-4c51-ab93-366558497e57 · outbound

This paper cites Optimally Reliable & Cheap Payment Flows on the Lightning Network.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Optimally Reliable & Cheap Payment Flows on the Lightning Network

Reference 23

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f353998a-8ea9-43a4-b3e6-b18e8be669e7 · outbound

This paper cites John Wiley & Sons, 2014.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths John Wiley & Sons, 2014

Reference 24

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9725aa0f-7395-4561-9b09-e0ac7165854f · outbound

This paper cites Stochastic online shortest path routing: The value of feedback.IEEE Transactions on Automatic Control, 63(4):915–930, 2018.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Stochastic online shortest path routing: The value of feedback.IEEE Transactions on Automatic Control, 63(4):915–930, 2018

Reference 25

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 04e764fd-5d8b-4325-b9be-4e10b656218f · outbound

This paper cites Sample complexity bounds for stochastic shortest path with a generative model.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Sample complexity bounds for stochastic shortest path with a generative model

Reference 26

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 951b1b84-7c44-4c33-bec2-3b10cd5d9aa0 · outbound

This paper cites On the likelihood that one unknown probability exceeds another in view of the evidence of two samples.Biometrika, 25(3/4):285–294, 1933.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths On the likelihood that one unknown probability exceeds another in view of the evidence of two samples.Biometrika, 25(3/4):285–294, 1933

Reference 27

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8e08fd4c-be75-4d0e-9e5b-4207e7f1ee8e · outbound

This paper cites an unresolved cited work.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Unresolved cited work

Reference 28

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ad734f1a-8828-4cd9-ae24-6badbe294a78 · outbound

This paper cites Thompson sampling for combinatorial semi-bandits.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Thompson sampling for combinatorial semi-bandits

Reference 29

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c2f4ad9b-06d6-4be4-9699-ab15fc13d232 · outbound

This paper cites Quantum internet: A vision for the road ahead.Science, 362:eaam9288, 10 2018.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Quantum internet: A vision for the road ahead.Science, 362:eaam9288, 10 2018

Reference 30

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 78b77a6f-486f-4979-9886-b73ad167ade1 · outbound

This paper cites Cascading bandits robust to adversarial corruptions, 2025.

Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths Cascading bandits robust to adversarial corruptions, 2025

Reference 31

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

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

This paper cites Learning to Route Efficiently with End-to-End Feedback: The Value of Networked Structure.

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.

Pith citing papers

No inbound Pith citation observations are available.