{"as_of":"2026-08-21T09:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:45e26989206a7222e1ef3cef156dc85efb92e7783f602a796a33b1031008f2fc","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T23:35:17.201516Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.15440/citation-record","integrity":"/paper/2607.15440/integrity","json":"/paper/2607.15440/citation-record.json","paper":"/paper/2607.15440"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:13.249861Z","title":"Finite-time analysis of the multiarmed bandit problem","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:13.249861Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:8909ecaae5734a10315ef1adb2cb6cf9f4befacc910fd87a52384de0f7cd6454","observation_id":"51b10b91-16c7-4170-9323-ebd9e3e92c32","resolution":{"observed_at":"2026-08-01T23:35:13.249861Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:13.378325Z","title":"Learning to act using real-time dynamic programming.Artificial Intelligence, 72:81–138, 02 1993","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:13.378325Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:87e7c7ab8bff6f7139fe5fdb09de5d9260eeeeaeeef2d583c5a59672f8ca2352","observation_id":"e005fc6c-8ced-4f4a-b0fa-c07ed0d722ec","resolution":{"observed_at":"2026-08-01T23:35:13.378325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:13.465048Z","title":"Labeled rtdp: improving the convergence of real-time dynamic programming","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:13.465048Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:ebcc219dfc95a6406821fbdeb6e9f5e9a867902f3a51be90de14c01b07ecb448","observation_id":"87c08095-5aa4-4942-8ee3-296589652951","resolution":{"observed_at":"2026-08-01T23:35:13.465048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:13.592622Z","title":"Entanglement distribution in a quantum network: A multicommodity flow-based approach.IEEE Transactions on Quantum Engineering, 1:1–21, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:13.592622Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:b9e73816236aa23558e278f9834b4d3a1d7bd94b3c0a4438de67f3f50ae64f48","observation_id":"2e542c77-789e-4405-8168-227871380623","resolution":{"observed_at":"2026-08-01T23:35:13.592622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:13.820316Z","title":"An empirical evaluation of thompson sampling.Advances in neural information processing systems, 24, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:13.820316Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:97c05118f7976a642369e1e44a3266a36f0ef1701cd2c429cbc1b71ba7ad2a63","observation_id":"a264be83-7392-46a5-8e60-150cf032159b","resolution":{"observed_at":"2026-08-01T23:35:13.820316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:14.008847Z","title":"A thompson sampling algorithm for cascading bandits","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:14.008847Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:47e40bce4452a9615810d99db88be470dfb6bdb3a6d643e2052d8642ece37b04","observation_id":"4bae6962-2b9b-42c1-a261-8af6b53d92a7","resolution":{"observed_at":"2026-08-01T23:35:14.008847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:14.130733Z","title":"Near-optimal regret bounds for stochastic shortest path","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:14.130733Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:24cb6811d63dc7f434cf27ab36abcadfc84d9da07f4e48af567acac9549844f0","observation_id":"8dc26c7f-ebec-4e98-9cca-2516e222ae94","resolution":{"observed_at":"2026-08-01T23:35:14.130733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:14.246403Z","title":"A tutorial on thompson sampling.Foundations and Trends® in Machine Learning, 11(1):1–99, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:14.246403Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:15e28e2e96a6b575363440d455b998dbe9cc051a6bc33254f56259493cad8a9a","observation_id":"5744d792-ac98-44c7-b68a-7c96d83fc34b","resolution":{"observed_at":"2026-08-01T23:35:14.246403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:14.367518Z","title":"John Wiley & Sons, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:14.367518Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:ebd54bea26f818edffd854b47968afbaf7c4538795d2b47f1d9815472a451549","observation_id":"a9a6f6c8-15b9-457a-9790-92b84b829e00","resolution":{"observed_at":"2026-08-01T23:35:14.367518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:14.433805Z","title":"A note on two problems in connexion with graphs.Numerische Mathematik, 1(1):269–271, 1959","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:14.433805Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:2d925b27c2505360a1d71c0c37a91f1e12b729a4dffb2b97fe57bf82a0404bc4","observation_id":"a98696e6-a718-4e03-abe6-449ca6525ae2","resolution":{"observed_at":"2026-08-01T23:35:14.433805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:14.502832Z","title":"Srikant, and Wei Chen","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:14.502832Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:008508848bd0891a69eeef158023493875ddac1007f39067931d27eaba66c367","observation_id":"da400d01-369a-48d6-a330-e724c7b6d62b","resolution":{"observed_at":"2026-08-01T23:35:14.502832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:14.587561Z","title":"Erdös and A","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:14.587561Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:d376c2536d8aa9e3ef44d061bbb663b144a01df2499d8ef0dbf3bce0ddbae566","observation_id":"b5e8c3fd-0a6b-40f1-8a8c-58f19ae7b8bc","resolution":{"observed_at":"2026-08-01T23:35:14.587561Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:14.683284Z","title":"Posterior sampling-based online learning for the stochastic shortest path model","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:14.683284Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:c6da4f4f3f8c22c73549ac3717de13d33b41876f7dc79eb3d0a61939568be6af","observation_id":"98393629-e2a4-40c2-b33d-680a837216b3","resolution":{"observed_at":"2026-08-01T23:35:14.683284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:14.761500Z","title":"Stochastic shortest path with sparse adversarial costs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:14.761500Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:64faf64c8603bb9dd9eded72c3a321f950ec9f7c461a5efce69b53c45508a581","observation_id":"2e26748f-0897-4a2c-bec7-50cf1eaea02c","resolution":{"observed_at":"2026-08-01T23:35:14.761500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:14.824504Z","title":"The internet topology zoo.IEEE Journal on Selected Areas in Communications, 29(9):1765–1775, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:14.824504Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:663f5495a15824dcfda0b7eb07c31bf6ac207518441daaf49d84b6ca7f2e38a0","observation_id":"36d5513d-e8ee-41e2-b296-377fcc1e5051","resolution":{"observed_at":"2026-08-01T23:35:14.824504Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:14.895758Z","title":"Cascading bandits: learning to rank in the cascade model","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:14.895758Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:79a1aa0565ed4c1a16b5ade4a4a2d5629cf39c0298fcb1f9b6547e2d3502bc8b","observation_id":"8c43606d-d06a-40bb-bff1-60909d86f7d6","resolution":{"observed_at":"2026-08-01T23:35:14.895758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:15.036302Z","title":"Combinatorial cascading bandits.Advances in Neural Information Processing Systems, 28, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:15.036302Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:447c5ab0cbdd3aefce028404357c76db476b60b130f74ac4345495fa8d438fb3","observation_id":"6caeb6d4-0d45-48fb-a0e6-db78866045bf","resolution":{"observed_at":"2026-08-01T23:35:15.036302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:15.174007Z","title":"Asymptotically efficient adaptive allocation rules.Ad- vances in applied mathematics, 6(1):4–22, 1985","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:15.174007Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:e8a11202ed5b1990c130612161414c3ce8988857583bb6dfec9ed9a51a78bb00","observation_id":"195cc147-c5f1-4b48-8901-93a9de04cebb","resolution":{"observed_at":"2026-08-01T23:35:15.174007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:15.336380Z","title":"Cambridge University Press, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:15.336380Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:2833d054f5dec0af66d08ba6a64477d2f75bc35ab490ac09f408b5c60e4501ed","observation_id":"b30caa9d-d687-4904-aa40-fa1c0dcaac1f","resolution":{"observed_at":"2026-08-01T23:35:15.336380Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:15.467742Z","title":"Contextual combinatorial cascading bandits","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:15.467742Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:fbd691b1acc70538413746b0d4b282ac4dea5ec325454abb2ddcec23b08a292c","observation_id":"91298532-156a-4553-abc6-82a9e1eb259e","resolution":{"observed_at":"2026-08-01T23:35:15.467742Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:15.535979Z","title":"Maheshwari","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:15.535979Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:ce954f22a979b466cd938deb7be299499d0e03e635c010a87ea6889ed8b64d27","observation_id":"b771719a-7a6b-4ad2-bbf5-3b3f8d6a9ab3","resolution":{"observed_at":"2026-08-01T23:35:15.535979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:15.670326Z","title":"Bounded real-time dynamic programming: Rtdp with monotone upper bounds and performance guarantees","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:15.670326Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:a96569496324f4012629f5c7b45e5fb6723a136b39c61822708b44cd8c2c9fde","observation_id":"2e095413-d2c9-4a6a-bd9a-b1ee9623e94e","resolution":{"observed_at":"2026-08-01T23:35:15.670326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.05322","last_updated":"2021-07-12T11:19:31Z","snapshot_observed_at":"2026-08-18T11:27:51.570604Z","submitted_at":"2021-07-12T11:19:31Z","title":"Optimally Reliable & Cheap Payment Flows on the Lightning Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.05322","snapshot_observed_at":"2026-08-01T23:35:15.827031Z","title":"Optimally reliable & cheap payment flows on the lightning network.arXiv preprint arXiv:2107.05322, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:15.827031Z"},"links":{"cited_paper":"/paper/2107.05322","citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:be0b3651548ed5f88d970ec9e22ddc4d4ecf83f41891c628224e055bd5feae33","observation_id":"047a1bd1-d8c8-4c51-ab93-366558497e57","resolution":{"observed_at":"2026-08-01T23:35:15.827031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:15.943640Z","title":"John Wiley & Sons, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:15.943640Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:9317a77d2da9627e2f75cc32ddc46329a9b8a00ae2a9a15e7345e0b4ee295c42","observation_id":"f353998a-8ea9-43a4-b3e6-b18e8be669e7","resolution":{"observed_at":"2026-08-01T23:35:15.943640Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:16.010865Z","title":"Stochastic online shortest path routing: The value of feedback.IEEE Transactions on Automatic Control, 63(4):915–930, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:16.010865Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:f8d089253dcfdd66d634ce67cfbab3ef76ca380c215909bd8311eefb2da7a701","observation_id":"9725aa0f-7395-4561-9b09-e0ac7165854f","resolution":{"observed_at":"2026-08-01T23:35:16.010865Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:16.248223Z","title":"Sample complexity bounds for stochastic shortest path with a generative model","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:16.248223Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:a9e34eaee2362e69d1d2d228ac65c9916816102ee8cfad45f82aa3f3bc620c28","observation_id":"04e764fd-5d8b-4325-b9be-4e10b656218f","resolution":{"observed_at":"2026-08-01T23:35:16.248223Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:16.490500Z","title":"On the likelihood that one unknown probability exceeds another in view of the evidence of two samples.Biometrika, 25(3/4):285–294, 1933","venue":null,"work_id":null,"year":1933},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:16.490500Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:d8081e9ce2127d01d0e0cb1c4dbc2206b40315c3020279921458583cf5ce2516","observation_id":"951b1b84-7c44-4c33-bec2-3b10cd5d9aa0","resolution":{"observed_at":"2026-08-01T23:35:16.490500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:16.669866Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:16.669866Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:acc144e3a459fb77eb65a20d9fe4b822c97ee30fe1016165ec2510eabcfe6a04","observation_id":"8e08fd4c-be75-4d0e-9e5b-4207e7f1ee8e","resolution":{"observed_at":"2026-08-01T23:35:16.669866Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:16.799281Z","title":"Thompson sampling for combinatorial semi-bandits","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:16.799281Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:ff28e0be2121cd93a9b6eceb5aafa8d88357a0922e0827fd45eb2ffa8765257a","observation_id":"ad734f1a-8828-4cd9-ae24-6badbe294a78","resolution":{"observed_at":"2026-08-01T23:35:16.799281Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:16.894179Z","title":"Quantum internet: A vision for the road ahead.Science, 362:eaam9288, 10 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:16.894179Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:39942be7beefb1d6038ade9acfabe2ac975682d0880335b9b41cf4a41487b0bf","observation_id":"c2f4ad9b-06d6-4be4-9699-ab15fc13d232","resolution":{"observed_at":"2026-08-01T23:35:16.894179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:35:17.026812Z","title":"Cascading bandits robust to adversarial corruptions, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:17.026812Z"},"links":{"citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:f7eba73c58f10c03d37886e0429dd4d15fd028771e003a93470bac0bc9a92d96","observation_id":"78b77a6f-486f-4979-9886-b73ad167ade1","resolution":{"observed_at":"2026-08-01T23:35:17.026812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.10637","last_updated":"2018-12-19T02:19:20Z","snapshot_observed_at":"2026-08-14T18:09:43.344759Z","submitted_at":"2018-10-24T21:47:19Z","title":"Learning to Route Efficiently with End-to-End Feedback: The Value of Networked Structure","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.10637","snapshot_observed_at":"2026-08-01T23:35:17.201516Z","title":"off-the- shelf","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T23:35:17.201516Z"},"links":{"cited_paper":"/paper/1810.10637","citing_paper":"/paper/2607.15440"},"observation_digest":"sha256:a701615ecddcd2f88367a35d79e183d1259d3ea5fd81fc73561ba8eb02f2bdcd","observation_id":"9c56b5c4-5a87-4518-92e5-0087281316a7","resolution":{"observed_at":"2026-08-01T23:35:17.201516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.15440","last_updated":"2026-07-16T20:20:18Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T04:46:14.974579Z","submitted_at":"2026-07-16T20:20:18Z","title":"Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":32},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"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."}