{"as_of":"2026-08-08T22:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1820de8807a983fb44b79720bf4f40c8cb9d5b7669a2d5aa7a42c9ed2f1f3936","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:03:57.337942Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-20T20:59:01.936060Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.00461","last_updated":"2025-04-01T06:35:42Z","snapshot_observed_at":"2026-08-07T16:18:26.369830Z","submitted_at":"2025-04-01T06:35:42Z","title":"Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.00461","snapshot_observed_at":"2026-08-07T13:03:57.337942Z","title":"J., and Farina, G","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23124","last_updated":"2025-08-01T22:17:13Z","snapshot_observed_at":"2026-08-07T12:50:33.760545Z","submitted_at":"2025-05-29T05:46:01Z","title":"Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T13:03:57.337942Z"},"links":{"cited_paper":"/paper/2504.00461","citing_paper":"/paper/2505.23124"},"observation_digest":"sha256:01de7c05cbbbed21320606044a07a843b227312f010faa0dc1c92e1659fdc8db","observation_id":"7419b645-f73e-46af-a77b-5d6f5fff10c8","resolution":{"observed_at":"2026-08-07T13:03:57.337942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.00461","last_updated":"2025-04-01T06:35:42Z","snapshot_observed_at":"2026-08-07T16:18:26.369830Z","submitted_at":"2025-04-01T06:35:42Z","title":"Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries","version":1},"cited_work":{"arxiv_id":"2504.00461","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.00461","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2504.00461 , year=","venue":null,"work_id":"7c761ebc-fb7a-48ef-8e61-95e3f7bc9729","year":2025},"citing_paper":{"arxiv_id":"2605.05266","last_updated":"2026-05-06T09:19:11Z","snapshot_observed_at":"2026-08-07T09:26:08.822312Z","submitted_at":"2026-05-06T09:19:11Z","title":"Differential Privacy in the Extensive-Form Bandit Problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-08T17:31:04.833447Z"},"links":{"cited_paper":"/paper/2504.00461","citing_paper":"/paper/2605.05266"},"observation_digest":"sha256:d2cb8e650dd44337ab574bdfa28adde8eeb0254c29991184576cba17a1beaad6","observation_id":"bd30cf9e-2b15-4d6c-bbcd-b705f288ba6b","resolution":{"observed_at":"2026-05-11T17:31:06.755277Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.00461","last_updated":"2025-04-01T06:35:42Z","snapshot_observed_at":"2026-08-07T16:18:26.369830Z","submitted_at":"2025-04-01T06:35:42Z","title":"Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries","version":1},"cited_work":{"arxiv_id":"2504.00461","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.00461","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2504.00461 , year=","venue":null,"work_id":"7c761ebc-fb7a-48ef-8e61-95e3f7bc9729","year":2025},"citing_paper":{"arxiv_id":"2605.15663","last_updated":"2026-05-15T06:35:31Z","snapshot_observed_at":"2026-07-06T23:26:56.013191Z","submitted_at":"2026-05-15T06:35:31Z","title":"On the Power of Adaptivity for $\\varepsilon$-Best Arm Identification in Linear Bandits","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-20T20:54:31.469086Z"},"links":{"cited_paper":"/paper/2504.00461","citing_paper":"/paper/2605.15663"},"observation_digest":"sha256:816db98d5dcd87f69f0d6cf6641f6e3b8a3bcbf0cd77c506c4d25db031db49b4","observation_id":"3f82cfb3-4dd9-4998-8f6b-9271cf5a1152","resolution":{"observed_at":"2026-05-20T20:59:01.939929Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.00461/citation-record","integrity":"/paper/2504.00461/integrity","json":"/paper/2504.00461/citation-record.json","paper":"/paper/2504.00461"},"outbound":[],"paper":{"arxiv_id":"2504.00461","last_updated":"2025-04-01T06:35:42Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T16:18:26.369830Z","submitted_at":"2025-04-01T06:35:42Z","title":"Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2504.00461."}