{"as_of":"2026-08-16T15:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:80405475f7a3a9b36d764b77bd392a1a992e1c902c63087a23e0f39aaa36e714","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-16T06:30:59.297886+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-14T12:33:19.698692Z","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-20T14:38:21.519267Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1704.09011","last_updated":"2020-04-19T02:21:25Z","snapshot_observed_at":"2026-08-16T12:13:34.032507Z","submitted_at":"2017-04-28T17:15:56Z","title":"Mostly Exploration-Free Algorithms for Contextual Bandits","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.09011","snapshot_observed_at":"2026-08-14T12:33:19.698692Z","title":"Mostly exploration-free algorithms for contextual bandits,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.07088","last_updated":"2020-08-01T00:47:21Z","snapshot_observed_at":"2026-08-16T09:31:34.293799Z","submitted_at":"2019-08-19T22:36:45Z","title":"Adaptive Robot-Assisted Feeding: An Online Learning Framework for Acquiring Previously Unseen Food Items","version":4},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T12:33:19.698692Z"},"links":{"cited_paper":"/paper/1704.09011","citing_paper":"/paper/1908.07088"},"observation_digest":"sha256:23250209a70c730a3dbf17a358478ef1acd77e251ff2ff8b69edddd3bdd7f74c","observation_id":"3d5b0c9c-6bb0-4810-8eb9-01d799ad7d43","resolution":{"observed_at":"2026-08-14T12:33:19.698692Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.09011","last_updated":"2020-04-19T02:21:25Z","snapshot_observed_at":"2026-08-16T12:13:34.032507Z","submitted_at":"2017-04-28T17:15:56Z","title":"Mostly Exploration-Free Algorithms for Contextual Bandits","version":8},"cited_work":{"arxiv_id":"1704.09011","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1704.09011","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:1704.09011 , year=","venue":null,"work_id":"e5e7291f-ed22-419c-ac08-6bb1cd1b484f","year":null},"citing_paper":{"arxiv_id":"2604.19672","last_updated":"2026-04-21T16:51:57Z","snapshot_observed_at":"2026-08-15T10:37:42.834332Z","submitted_at":"2026-04-21T16:51:57Z","title":"Budgeted Online Influence Maximization","version":1},"reference_index":109,"source":"arxiv_source","source_observed_at":"2026-05-10T03:39:32.852934Z"},"links":{"cited_paper":"/paper/1704.09011","citing_paper":"/paper/2604.19672"},"observation_digest":"sha256:a526c10376193434ef520e02b1c37c74f2aee7ef2eafa92b6fc39c8c69386f6f","observation_id":"6b0d07b5-68f8-4fd4-95a6-bdfb3363161a","resolution":{"observed_at":"2026-05-11T12:26:08.825063Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1704.09011","last_updated":"2020-04-19T02:21:25Z","snapshot_observed_at":"2026-08-16T12:13:34.032507Z","submitted_at":"2017-04-28T17:15:56Z","title":"Mostly Exploration-Free Algorithms for Contextual Bandits","version":8},"cited_work":{"arxiv_id":"1704.09011","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1704.09011","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:1704.09011 , year=","venue":null,"work_id":"e5e7291f-ed22-419c-ac08-6bb1cd1b484f","year":null},"citing_paper":{"arxiv_id":"2605.17126","last_updated":"2026-05-29T08:34:47Z","snapshot_observed_at":"2026-08-15T00:54:23.685162Z","submitted_at":"2026-05-16T19:06:54Z","title":"Multi-task Linear Regression without Eigenvalue Lower Bounds: Adaptivity, Robustness, and Safety","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-20T14:37:24.057523Z"},"links":{"cited_paper":"/paper/1704.09011","citing_paper":"/paper/2605.17126"},"observation_digest":"sha256:8eaf9f2a32d5ebcefbf7a17691d84f397b02d327f81792bc1818f93b04ddad17","observation_id":"e524677a-3040-4182-b117-075a799f4721","resolution":{"observed_at":"2026-05-20T14:38:21.520929Z","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/1704.09011/citation-record","integrity":"/paper/1704.09011/integrity","json":"/paper/1704.09011/citation-record.json","paper":"/paper/1704.09011"},"outbound":[],"paper":{"arxiv_id":"1704.09011","last_updated":"2020-04-19T02:21:25Z","latest_version":8,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-16T12:13:34.032507Z","submitted_at":"2017-04-28T17:15:56Z","title":"Mostly Exploration-Free Algorithms for Contextual Bandits"},"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-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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1704.09011."}