{"as_of":"2026-08-16T10:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b49cca3f27ff46c95e27453e11137043a74597bae4efb2ad362ee6db039c287c","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:18:53.086089Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-13T07:12:06.759848Z","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-13T07:12:27.873604Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"cited_work":{"arxiv_id":"1908.05814","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.05814","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Linear stochastic bandits under safety constraints","venue":null,"work_id":"761b0710-09b2-49bf-8dcb-f99746806537","year":1908},"citing_paper":{"arxiv_id":"2605.12176","last_updated":"2026-05-12T14:22:03Z","snapshot_observed_at":"2026-08-13T18:40:31.028918Z","submitted_at":"2026-05-12T14:22:03Z","title":"Multi-Task Representation Learning for Conservative Linear Bandits","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-13T07:12:06.759848Z"},"links":{"cited_paper":"/paper/1908.05814","citing_paper":"/paper/2605.12176"},"observation_digest":"sha256:abd52c9b9027152d9fb4fc5c891826b12275f89088d025bbb2eca95f9c7bc5cd","observation_id":"2fbcdca8-02ab-4f3c-bf2e-4549ac0122bb","resolution":{"observed_at":"2026-05-13T07:12:27.876622Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.05814/citation-record","integrity":"/paper/1908.05814/integrity","json":"/paper/1908.05814/citation-record.json","paper":"/paper/1908.05814"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:52.895707Z","title":"Stochastic linear optimization under bandit feedback","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:52.895707Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:013c0a1b59d2585d3cd59186e956d668c1a76aa2f77564b4a5867a19d466ebe4","observation_id":"1fb5470c-d6ab-40eb-a912-093fc9261c9e","resolution":{"observed_at":"2026-08-14T13:18:52.895707Z","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-14T13:18:52.901993Z","title":"Improved algorithms for linear stochastic bandits","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:52.901993Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:adfbec906d34297c88eeae45382970613751f8ee9c59dd35abee43474b4339a6","observation_id":"e7bed439-9cee-49c9-a464-804747c22fda","resolution":{"observed_at":"2026-08-14T13:18:52.901993Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.680537Z","title":"Tsitsiklis","venue":null,"work_id":"fd41dbab-3de9-43f8-9cc1-96b7b99626fa","year":2010},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:52.907247Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:98b4b7602654652d978d3e1eaf927fc0b103160ec7e20396dcdc713c960027a7","observation_id":"58591520-9387-4d11-8133-b149d8764891","resolution":{"observed_at":"2026-08-14T13:18:53.685710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.662733Z","title":"Exploration–exploitation tradeoff using variance estimates in multi-armed bandits.Theoretical Computer Science, 410(19):1876–1902, 2009","venue":null,"work_id":"eebb1621-8901-4d2e-aac4-c98534c5822e","year":1902},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:52.912330Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:7dc65e67c153c7e9f883441b7cc2e1ee9efcbee624d1dd519fa68d41ccf6ba2f","observation_id":"e3527a84-0625-42a8-8714-c3282e433227","resolution":{"observed_at":"2026-08-14T13:18:53.668727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.642311Z","title":"Finite-time analysis of the multiarmed bandit problem","venue":null,"work_id":"105ac4c7-6d07-4082-84a6-a659b8b0268c","year":2002},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:52.918656Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:8155cde5bd5165880b4480b81eef9ef67e729468f0e554627c837bdf8ebc3ad2","observation_id":"a86d9bcc-ddc6-4ccb-bb01-929d47251fb9","resolution":{"observed_at":"2026-08-14T13:18:53.649745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:52.923564Z","title":"Learning to optimize via posterior sampling.Mathematics of Operations Research, 39(4):1221–1243, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:52.923564Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:6e7b42053583d4717928fdfce21097cfb05acd923c964b0c1975b370a3a342f3","observation_id":"175a2daf-c775-4100-b8ee-cffbfed861cf","resolution":{"observed_at":"2026-08-14T13:18:52.923564Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.610404Z","title":"Contextual bandits with linear payoff functions","venue":null,"work_id":"e79440ea-8209-4d1b-8024-909f37d9e1aa","year":2011},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:52.929479Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:b922467a126f7b0c0a7ae17f0151aeca90794e7d94fe5bc8a65bd5a1ed6a6917","observation_id":"d1484021-8137-4739-a4bc-b9b2bc71bba1","resolution":{"observed_at":"2026-08-14T13:18:53.616280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.592830Z","title":"Parametric bandits: The generalized linear case","venue":null,"work_id":"6d127acf-da68-4b39-aa98-a494eadebe9d","year":2010},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:52.934135Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:4970538a2dec1aa9236c6dab34a3a98bbc2e1be559f07e6326bb847fb74daf61","observation_id":"470c8934-0b02-4735-b9c8-d0baefe233d8","resolution":{"observed_at":"2026-08-14T13:18:53.598059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.575577Z","title":"Provably optimal algorithms for generalized linear contextual bandits","venue":null,"work_id":"14909690-2c9b-45de-80eb-a74697b96ddb","year":2017},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:52.939109Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:1a4f01407c974b1a28addc85c400999748d465bbb9a1177464b28f939d548e52","observation_id":"6a53f729-ad5d-4c0a-8b08-7ba62e58e2e8","resolution":{"observed_at":"2026-08-14T13:18:53.581307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.554903Z","title":"Badanidiyuru, R","venue":null,"work_id":"f0f66c94-5fc2-4dae-b69a-12e29f371183","year":2013},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:52.944657Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:1dc7d594563ce81efd6cbe7582e7d8ae4fb7a9fe8d97cf00254e2453d64de547","observation_id":"c98a689c-d13b-4ada-bf2f-76599969d913","resolution":{"observed_at":"2026-08-14T13:18:53.560323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.538535Z","title":"Linear contextual bandits with knapsacks","venue":null,"work_id":"dce3c150-42c7-4e55-8890-b13cb587223e","year":2016},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:52.950645Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:533146f2651be5c9bba12c42284ff72c597d951d2e4502cfc7f7b08b3841f743","observation_id":"79409e60-2ef8-4c33-bc0e-1fb23aa6c23d","resolution":{"observed_at":"2026-08-14T13:18:53.543362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.522842Z","title":"Srikant, Xin Liu, and Chong Jiang","venue":null,"work_id":"c12e1a9d-f1a3-4b9e-a45a-85a2479bfdb3","year":2015},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:52.955429Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:ca2f1e50beb91267289503451eb5accb7a23ff647b7b4a9b34517919e4b9486b","observation_id":"41955f8e-c55b-40bd-b5ea-c26306768e0e","resolution":{"observed_at":"2026-08-14T13:18:53.527529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.506621Z","title":"Resourceful contextual bandits","venue":null,"work_id":"8c62fa56-36ce-4040-97f8-10cd89f7a1f8","year":2014},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:52.960988Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:1b749fe2d2e46b8459d94bd66d759cabfed290a96d3f64e222e1c667f2dab49c","observation_id":"2b026ff7-7568-4079-a846-760d62fba736","resolution":{"observed_at":"2026-08-14T13:18:53.511327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.485578Z","title":"Conserva- tive contextual linear bandits","venue":null,"work_id":"2c20e670-8677-4ec0-b77d-5b40a79aa624","year":2017},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:52.965953Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:e29e3c59a8bc3ca0eb50083fa838c6918fcce9032a25e6b886781245e5a2dd2a","observation_id":"5274d693-88b5-4201-9565-fe3235f700d3","resolution":{"observed_at":"2026-08-14T13:18:53.491728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.466311Z","title":"Conservative bandits","venue":null,"work_id":"ad48bc26-f2e3-47cd-8e7f-ecf9b9b712a3","year":2016},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:52.970967Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:88c955c07798ab49cafc118286fdb95256b86a1ebefbfc32f1d082754bfe4a1d","observation_id":"22e75b17-0dc6-4f14-b568-f10c66252f05","resolution":{"observed_at":"2026-08-14T13:18:53.472743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1205.4810","last_updated":"2012-07-06T20:56:23Z","snapshot_observed_at":"2026-08-15T00:59:22.243502Z","submitted_at":"2012-05-22T06:02:09Z","title":"Safe Exploration in Markov Decision Processes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1205.4810","snapshot_observed_at":"2026-08-14T13:18:52.976020Z","title":"Safe exploration in markov decision processes.arXiv preprint arXiv:1205.4810, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:52.976020Z"},"links":{"cited_paper":"/paper/1205.4810","citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:235d742519ad972dd2082afcd358f3111b451effb50e2770479514f28d61f1bf","observation_id":"80f1d2f3-a15d-42f5-93b7-289daea4e017","resolution":{"observed_at":"2026-08-14T13:18:52.976020Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.447071Z","title":"Constrained policy optimization","venue":null,"work_id":"257d4178-dd50-47d1-a7d9-e66f2452a86e","year":2017},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:52.991426Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:637ece8b95c49fcc34ceb642de5d3238b022fb9bd5bfd340e3d31ebcb15e885d","observation_id":"2d058a57-404d-4650-a962-ea3120b9e7f6","resolution":{"observed_at":"2026-08-14T13:18:53.453494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.429538Z","title":"Safe exploration for active learning with gaussian processes","venue":null,"work_id":"e42e94de-6a60-45b7-91be-695927a348d7","year":2015},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:53.031084Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:d662bf1d55e6daee1b86f682171e1111342795d2039edbdf286d96851441bfae","observation_id":"eb99bf2c-5e29-4553-baab-456717d84ce2","resolution":{"observed_at":"2026-08-14T13:18:53.434893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.04450","last_updated":"2020-04-07T15:07:12Z","snapshot_observed_at":"2026-08-14T22:10:25.067236Z","submitted_at":"2016-02-14T13:30:43Z","title":"Bayesian Optimization with Safety Constraints: Safe and Automatic Parameter Tuning in Robotics","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.04450","snapshot_observed_at":"2026-08-14T13:18:53.042765Z","title":"Bayesian optimization with safety constraints: safe and automatic parameter tuning in robotics.arXiv preprint arXiv:1602.04450, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:53.042765Z"},"links":{"cited_paper":"/paper/1602.04450","citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:908417efd0f6d31382e758c5ba9fc7657a8fcd11e2bb8d1edf2f6a02acd2e113","observation_id":"631b45fe-67dc-4368-9e20-d67861cb32d5","resolution":{"observed_at":"2026-08-14T13:18:53.042765Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.409726Z","title":"Burdick, and Andreas Krause","venue":null,"work_id":"82fc9b73-d6d2-4e64-8e79-b7775914548c","year":2015},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:53.048174Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:cefa70281722be37f30540dd64dddc5330b52dc521248495560208b0e92eaca9","observation_id":"dfc67122-3fd1-47ef-9d68-806aa46f244d","resolution":{"observed_at":"2026-08-14T13:18:53.415212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.390991Z","title":"Stagewise safe bayesian optimization with gaussian processes","venue":null,"work_id":"2726e2cc-a6f3-4694-b5c4-9e0cb30308f7","year":2018},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:53.053068Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:fa943cf28bef831f8bbe9e8554a9ace9cb71ac9067e6fa882092e10dd1abaf82","observation_id":"d10dfcbf-39f4-445f-b838-b197e577fc80","resolution":{"observed_at":"2026-08-14T13:18:53.396581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.373537Z","title":"Gaussian process optimization in the bandit setting: no regret and experimental design","venue":null,"work_id":"f1576558-a025-44bc-b979-5a16c01be343","year":2010},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:53.057494Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:a3ae266c09ae882485df4d4c10c4a936b7635b5057e512bc2a91a4bc57c63637","observation_id":"d047b5d9-6593-42fe-9a5d-b92b16dcfdbc","resolution":{"observed_at":"2026-08-14T13:18:53.379008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.355867Z","title":"Robust constrained learning- based nmpc enabling reliable mobile robot path tracking.The International Journal of Robotics Research, 35(13):1547–1563, 2016","venue":null,"work_id":"131077af-f326-4683-89c1-7e3932d6ee0d","year":2016},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:53.062206Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:ecec9a6654d970d8ebea9f63211dc160b745eca1c767c786a434caf881252244","observation_id":"25bdc09d-5ed7-4cc6-9e0e-61aeb3f2e8f6","resolution":{"observed_at":"2026-08-14T13:18:53.361196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.337842Z","title":null,"venue":null,"work_id":"8868d6db-27e8-4086-81c4-11b4d0933438","year":2014},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:53.066713Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:0bdef78cd9e816c77bc419a97966031e3fe3a361da25dacc3ef29f3ef0920db7","observation_id":"e230a84b-76fe-4085-bcd0-b8dc17ffbe55","resolution":{"observed_at":"2026-08-14T13:18:53.343342Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.206473Z","title":null,"venue":null,"work_id":"483e3071-cb4c-4940-953c-91e711505e68","year":2011},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:53.071951Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:33583bbb7e2198ce842b395b37b76dd3c9853cfd15cb0c4ef73ca277711a3c79","observation_id":"bf0bffda-8b46-428c-ad9e-8e2f2096aa6c","resolution":{"observed_at":"2026-08-14T13:18:53.211784Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.076719Z","title":"Provably safe and robust learning-based model predictive control.Automatica, 49(5):1216–1226, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:53.076719Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:3c24e4b46fe6b9565de37e79130e8683ee25c2242dad5b2bb0a794d569a12d93","observation_id":"8c5670b7-38ee-429f-b305-448d0e983da6","resolution":{"observed_at":"2026-08-14T13:18:53.076719Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.176464Z","title":"Safe convex learning under uncertain constraints","venue":null,"work_id":"f9a4b9e7-d8ef-4c41-9e21-1a5c5c3e8b2a","year":2019},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:53.081463Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:d660f47d8d4fb7160c2edcce2756b233aba99bf8f45e87ff62752c426a67c31a","observation_id":"04031874-320b-486c-9c13-f9cb81c76b57","resolution":{"observed_at":"2026-08-14T13:18:53.182255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:18:53.158226Z","title":"distance","venue":null,"work_id":"cced30b7-6471-4610-bff1-7da69882b20e","year":2015},"citing_paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:53.086089Z"},"links":{"citing_paper":"/paper/1908.05814"},"observation_digest":"sha256:44110ebf5edd7efe53ad96038d50b599947d2dab16aecd3b11eac83646f45de3","observation_id":"12f804a9-ed7e-44af-87c9-f427ef68bda3","resolution":{"observed_at":"2026-08-14T13:18:53.164067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.05814","last_updated":"2019-08-16T02:08:24Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T03:37:48.773974Z","submitted_at":"2019-08-16T02:08:24Z","title":"Linear Stochastic Bandits Under Safety Constraints"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":20},"total_outbound_references":28},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 1 inbound Pith citation observation for arXiv:1908.05814."}