{"as_of":"2026-08-07T22:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fb19dede93200e40bf754916004519d79e183d990ae84bfb41690d5e7cb13359","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-07T06:34:17.273281+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-06T00:33:17.724749Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":11,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1807.07623","last_updated":"2022-03-02T09:02:05Z","snapshot_observed_at":"2026-07-06T06:51:17.036351Z","submitted_at":"2018-07-19T19:42:19Z","title":"Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits","version":6},"cited_work":{"arxiv_id":"1807.07623","doi":"10.48550/arxiv.1807.07623","metadata_source":"arxiv_reference","pith_arxiv_id":"1807.07623","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tsallis-","venue":"arXiv (Cornell University)","work_id":"ab6ce4ff-ba86-4268-ba0c-c5be5b8dbff5","year":null},"citing_paper":{"arxiv_id":"2606.04931","last_updated":"2026-06-03T14:23:41Z","snapshot_observed_at":"2026-07-06T23:44:57.208389Z","submitted_at":"2026-06-03T14:23:41Z","title":"Mean-based algorithms: A lower bound and regret","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-06-28T07:17:24.957957Z"},"links":{"cited_paper":"/paper/1807.07623","citing_paper":"/paper/2606.04931"},"observation_digest":"sha256:ae70bbd537f924333c7b096043811303c2f45947a884197459166e6293fa0002","observation_id":"1b2dc726-4eee-4a61-86ea-e3738d796be1","resolution":{"observed_at":"2026-06-28T07:21:44.801103Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.07623","last_updated":"2022-03-02T09:02:05Z","snapshot_observed_at":"2026-07-06T06:51:17.036351Z","submitted_at":"2018-07-19T19:42:19Z","title":"Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.07623","snapshot_observed_at":"2026-08-06T00:33:17.724749Z","title":"Zimmert, Y","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.01223","last_updated":"2026-08-02T13:12:16Z","snapshot_observed_at":"2026-08-07T12:30:39.033613Z","submitted_at":"2026-08-02T13:12:16Z","title":"Perspectives on Tsallis Statistics for Artificial Intelligence","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T00:33:17.724749Z"},"links":{"cited_paper":"/paper/1807.07623","citing_paper":"/paper/2608.01223"},"observation_digest":"sha256:76b5251ed3e4c8b39478a18b5d50405ef2e6e227dceec56949c230a0eccd635c","observation_id":"ea36e03d-4eec-4a65-a8fc-d1c7ec0e5962","resolution":{"observed_at":"2026-08-06T00:33:17.724749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1807.07623/citation-record","integrity":"/paper/1807.07623/integrity","json":"/paper/1807.07623/citation-record.json","paper":"/paper/1807.07623"},"outbound":[],"paper":{"arxiv_id":"1807.07623","last_updated":"2022-03-02T09:02:05Z","latest_version":6,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T06:51:17.036351Z","submitted_at":"2018-07-19T19:42:19Z","title":"Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial 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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1807.07623."}