{"as_of":"2026-08-21T15:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5503b8dd348d9fd7afadd3d7a1e265bed0b458075d74c295904a3b654911d5ae","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T17:58:56.169551Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-12T17:58:56.243478Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"1810.10637","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.10637","snapshot_observed_at":"2026-08-12T17:58:56.243478Z","title":"Learning to Route Efficiently with End-to-End Feedback: The Value of Networked Structure","venue":"cs.LG","work_id":"1d98d6e2-5d93-419f-829c-e9f03d82821f","year":2018},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.169551Z"},"links":{"cited_paper":"/paper/1810.10637","citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:955f1025a9293f0a5d583d3281eeda923bfbdbd2206adb133bdcd853d39c2bb3","observation_id":"2dbbafbb-0d7a-4ec7-9f7c-b724edc42b58","resolution":{"observed_at":"2026-08-12T17:58:56.250859Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"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"}}],"links":{"evidence":"/evidence","html":"/paper/1810.10637/citation-record","integrity":"/paper/1810.10637/integrity","json":"/paper/1810.10637/citation-record.json","paper":"/paper/1810.10637"},"outbound":[],"paper":{"arxiv_id":"1810.10637","last_updated":"2018-12-19T02:19:20Z","latest_version":2,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1810.10637."}