{"as_of":"2026-08-18T23:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:853fbda171ff3ebbf662d8767c03c6fb9bfc241a17eb05c5f5c8231036f22403","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:26:34.698277Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.10147/citation-record","integrity":"/paper/2505.10147/integrity","json":"/paper/2505.10147/citation-record.json","paper":"/paper/2505.10147"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:26:34.541596Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.541596Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:c83efa2d163db9f126bce44fbd7cc2a9c9333ba1346a12dd2132d388ab47ecef","observation_id":"07bedc36-d916-4421-8d2e-480fa74014fa","resolution":{"observed_at":"2026-08-15T21:26:34.541596Z","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-15T21:26:34.546947Z","title":"and Bubeck, S","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.546947Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:d491742a65e5ab36153f20defd490398868107ea471d7ff4d86f17dd51c30583","observation_id":"e5dca880-8f06-457e-ae32-19b71632ad74","resolution":{"observed_at":"2026-08-15T21:26:34.546947Z","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-15T21:26:35.312068Z","title":"and He, J","venue":null,"work_id":"4dc7b165-b354-46b3-9929-5fac6ce93692","year":2021},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.550313Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:5b930147ae06bbeee04c6742a4dc2376be3f0b9f50b42996718d2759103e1a9c","observation_id":"c5146825-5f65-488b-a4da-f2de626a219c","resolution":{"observed_at":"2026-08-15T21:26:35.315353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:35.301434Z","title":null,"venue":null,"work_id":"e48f77bb-7017-4dfe-956b-b1dc12b69005","year":2017},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.553952Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:1f4fd57eeb44b293876bdad3dffbab3eb6e67153e8c990187098ff1694f2b10d","observation_id":"cc6acf03-e360-4ceb-a904-2052774c3897","resolution":{"observed_at":"2026-08-15T21:26:35.304849Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:35.290405Z","title":null,"venue":null,"work_id":"19626866-8b06-4751-bb1a-72042335cdc4","year":2019},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.557420Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:45b58fc331bf08625a28a70976609dbc052650b25357c408e9b6b7dca299833d","observation_id":"08db87ea-96f5-48a8-96da-c15c3d2469fb","resolution":{"observed_at":"2026-08-15T21:26:35.293987Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:35.278199Z","title":"Collaborative multi-agent heterogeneous multi-armed bandits","venue":null,"work_id":"12d74c59-7a9f-4bc0-a32f-9e6e2914df5c","year":2023},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.561056Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:1c13d8aad144f8ab1167ad0ead2fd22cfe0c4bfa4e19de3903fb543ab9fc4406","observation_id":"c5d0a3b6-e2cd-4ab9-b54d-e4f17369403a","resolution":{"observed_at":"2026-08-15T21:26:35.282455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:35.266863Z","title":"Y., and Chee, Y","venue":null,"work_id":"553726eb-0ba0-4232-864c-4ba1b97518b9","year":2023},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.564629Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:3cf66416d8117187f8af3fbe6b6997e2c831eb85b1d6c7118c102771afd9a26f","observation_id":"fe321a6a-b297-45c4-adb8-26ced6b6713e","resolution":{"observed_at":"2026-08-15T21:26:35.270443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.08710","last_updated":"2025-05-27T15:31:21Z","snapshot_observed_at":"2026-08-16T17:37:19.512199Z","submitted_at":"2023-09-15T19:01:42Z","title":"Adaptive Sample Sharing for Multi Agent Linear Bandits","version":3},"cited_work":{"arxiv_id":"2309.08710","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.08710","snapshot_observed_at":"2026-08-15T21:26:34.914764Z","title":"Adaptive Sample Sharing for Multi Agent Linear Bandits","venue":"cs.LG","work_id":"29af15d1-cb96-4a86-97f6-4e38d6955758","year":2023},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.569424Z"},"links":{"cited_paper":"/paper/2309.08710","citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:7457e8b43e5168a3e82c10cae708ea6edeb4937cf9ab5978dafc2a0d4c6ed2e8","observation_id":"56a6f580-6234-4f65-8644-3666e379c3f3","resolution":{"observed_at":"2026-08-15T21:26:34.917957Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:34.573552Z","title":"and Koolen, W","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.573552Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:09986b20b12f28702aa581c24fd33f0e655b5e9f9845b0d92ce1ef180da96e1c","observation_id":"49d5fb74-8091-4f19-8b4c-85cd8de6c129","resolution":{"observed_at":"2026-08-15T21:26:34.573552Z","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":"stable/4037868","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:26:34.900115Z","title":"93.16 the coupon collector's problem with unequal probabilities","venue":null,"work_id":"d888a775-322a-41db-8e5c-d51ff2665ef7","year":2009},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.577534Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:9fe065488171da6294808855f6814bdd77a8c24fa31690017c0879f399155811","observation_id":"ec2081ac-7339-4a49-8ee8-64154653b2e5","resolution":{"observed_at":"2026-08-15T21:26:34.905693Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:35.247137Z","title":"Pac bounds for multi-armed bandit and markov decision processes","venue":null,"work_id":"acad5a10-a4d4-4d0d-aaf2-c9719d88e849","year":2002},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.581903Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:22b286321b0ceabff32a924bc50ba379815946ffcf37bead409ff329b709434b","observation_id":"713835d4-4f32-41c6-954f-96a9bf016778","resolution":{"observed_at":"2026-08-15T21:26:35.251028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:34.587005Z","title":"and Kaufmann, E","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.587005Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:0c206aec5df5cf708f515042d5126b005585a8cf74f132d0585ac144d5402dd2","observation_id":"a905b83d-0009-49c8-b348-e24d1d65b970","resolution":{"observed_at":"2026-08-15T21:26:34.587005Z","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-15T21:26:35.227969Z","title":"Online clustering of bandits","venue":null,"work_id":"63a60471-dc40-4f09-a1bd-5910789a78e5","year":2014},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.590519Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:5750f0b68e4db85bd48f07a78831a47fa37fb6a20d6c32f4d9d884b434c7cc4c","observation_id":"9048e7f6-c2f9-4608-955c-11506d63b7b3","resolution":{"observed_at":"2026-08-15T21:26:35.231691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.14195","last_updated":"2024-08-26T11:47:52Z","snapshot_observed_at":"2026-08-16T13:23:51.368806Z","submitted_at":"2024-08-26T11:47:52Z","title":"Representative Arm Identification: A fixed confidence approach to identify cluster representatives","version":1},"cited_work":{"arxiv_id":"2408.14195","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.14195","snapshot_observed_at":"2026-08-15T21:26:34.784408Z","title":"Representative Arm Identification: A fixed confidence approach to identify cluster representatives","venue":"cs.LG","work_id":"acdc1929-7ecc-4550-a5ea-4de0eee8c70a","year":2024},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.594262Z"},"links":{"cited_paper":"/paper/2408.14195","citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:09b4744cadd4020eb07b635a737621432c2683f88f0e1aab9344c2426ab386db","observation_id":"7fb0e16b-39ed-4412-bf93-1e047ec2e063","resolution":{"observed_at":"2026-08-15T21:26:34.788663Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:35.217208Z","title":"Collaborative learning and personalization in multi-agent stochastic linear bandits","venue":null,"work_id":"716d0f43-2c4d-474c-94ee-bf2c52666b3e","year":2021},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.598089Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:68393c3c033ecd1599c56cd17153bf48614fa42c081801f8bab7ff425a96cd1f","observation_id":"46734866-1b1a-459c-b83a-2f8b834d6f12","resolution":{"observed_at":"2026-08-15T21:26:35.220840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:35.205794Z","title":"S., Koren, T., Lempel, R., and Somekh, O","venue":null,"work_id":"8024f10b-1d60-4cb5-a359-8d467aeb1f1f","year":2013},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.601557Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:567eeb3d83fb3b3d26627820794ae7b37331858e25552db1215b1178600d6178","observation_id":"76bdb308-568d-4fbe-83e0-d853db59ce07","resolution":{"observed_at":"2026-08-15T21:26:35.209473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:35.193723Z","title":"and Nowak, R","venue":null,"work_id":"3a4e375b-33f2-4ee3-a841-db4413d21cff","year":2014},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.605341Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:2c0376eabbecbdcfdaa950b0b6ffbfd6e2eaf6b74739e506e1c79a7e744ac721","observation_id":"779f0204-e506-4664-a48d-e09b92f36325","resolution":{"observed_at":"2026-08-15T21:26:35.197679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:34.608613Z","title":"Pac subset selection in stochastic multi-armed bandits","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.608613Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:6b734584e70241ff312e5d3dab47de8faf75c13adbf903df97f1df4cc345126a","observation_id":"24c999b1-79fb-4683-a69b-794ae646f81a","resolution":{"observed_at":"2026-08-15T21:26:34.608613Z","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-15T21:26:34.611974Z","title":"Almost optimal exploration in multi-armed bandits","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.611974Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:7174b7da9a7f072577bee1c381ad2f0cbe1ff3b9fe80bfb7f5dbcbe4d20fc791","observation_id":"e4d73e83-0bdf-4fd1-bb5b-ba9249fbe788","resolution":{"observed_at":"2026-08-15T21:26:34.611974Z","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-15T21:26:35.164631Z","title":"and Zhang, Q","venue":null,"work_id":"9c21964c-c7db-408f-9ef4-d92d473801d9","year":2020},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.615748Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:b5307f285e1b016fa78462f87f34590f888fd12c39af69f23e71f86fe11826e3","observation_id":"9e890138-23df-4079-a058-3379a222018d","resolution":{"observed_at":"2026-08-15T21:26:35.168705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:35.151725Z","title":"and Zhang, Q","venue":null,"work_id":"6dd3e7ff-f047-4525-9278-ff0b3acf6a32","year":2023},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.619193Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:e6c3ea57e5b51e5ed3500984286da89446e00a238d84085b9cab399d7551611b","observation_id":"0b83795c-367a-44ad-9052-eb748cd39526","resolution":{"observed_at":"2026-08-15T21:26:35.156089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:35.139608Z","title":"and Zhang, Q","venue":null,"work_id":"1b3af026-36d7-487a-99db-18a88f079f45","year":2024},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.622758Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:2d11ae6ea95295b08839bbf9b50df28e89be164905e63e2d6d56fedcc687acc3","observation_id":"298b75e8-c5dc-48d4-913b-45069e42a9ba","resolution":{"observed_at":"2026-08-15T21:26:35.143632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:35.126445Z","title":"Collaborative top distribution identifications with limited interaction","venue":null,"work_id":"e33c1fb5-8dc4-47e3-8111-5486aade844e","year":2020},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.626363Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:d5664401ba1e51f257249592d178ca8f1fba7c6481275a974be92dd19d17631b","observation_id":"a72371dc-893e-489e-839b-f777d700ee0f","resolution":{"observed_at":"2026-08-15T21:26:35.130263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:35.115657Z","title":"On the complexity of a/b testing","venue":null,"work_id":"40a055e5-cb62-426e-9568-5b0b8e599a60","year":2014},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.629680Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:2daef3ddf70b6723ad6357a8295cb4c5e9b384fa0501ae75d06b4ebcbe6b9380","observation_id":"79567aba-bfb3-4f47-a609-1ac627a23d22","resolution":{"observed_at":"2026-08-15T21:26:35.118907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:34.632742Z","title":"On the complexity of best-arm identification in multi-armed bandit models","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.632742Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:980a77359154cf76e1a54bc9dfa9a747642f0cedfd01fe8d54508513dedd638f","observation_id":"c735a8b9-1438-46e3-8d5e-7ab25775352a","resolution":{"observed_at":"2026-08-15T21:26:34.632742Z","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-15T21:26:35.095879Z","title":"Distributed clustering of linear bandits in peer to peer networks","venue":null,"work_id":"ea013d02-98aa-4f0f-8580-2da406996032","year":2016},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.635760Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:a41450b7a26e32896a1227e03cbf8e14434ac70a3227504c878505b1ef6328bb","observation_id":"dc24a4a2-20fb-4b12-b488-f7a568eadf87","resolution":{"observed_at":"2026-08-15T21:26:35.099837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:35.083949Z","title":"R., Karthik, P., and Tan, V","venue":null,"work_id":"a77a5ccf-6b15-458b-805e-01ff901ff6b8","year":2023},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.638514Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:2212d83a15d844b8e3228c3906643b67fe470d39499799686c362d7fd1afdd57","observation_id":"05b4d01c-3691-4f7b-b722-117cf6298dad","resolution":{"observed_at":"2026-08-15T21:26:35.087712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:35.072391Z","title":null,"venue":null,"work_id":"29fcaca2-06b2-4973-80b7-400c8745a805","year":1985},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.641345Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:62aff5b8b63ec2d66eb314baef5174c2b916457c57c2fbc16a04ffe2038fd2c9","observation_id":"4d018fdd-34bf-49be-a1c5-7845f1eed657","resolution":{"observed_at":"2026-08-15T21:26:35.075867Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:34.643828Z","title":"and Szepesv \\'a ri, C","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.643828Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:d695135afe02946fb19dd31f70a82b24db1cfffb53f9475457b9db2ff96edfd2","observation_id":"f6ecea1f-54ce-4eb4-9231-d2d583d71ffb","resolution":{"observed_at":"2026-08-15T21:26:34.643828Z","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-15T21:26:35.053447Z","title":"and Song, L","venue":null,"work_id":"2eb6c203-f498-4ecf-8d59-6af8c049282d","year":2022},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.646788Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:24c48f743a5989dc586b92f0af36bea5c7d2cdf8069aa388daccf3cca4eb70bb","observation_id":"961a63ef-dedf-483e-b22d-78c9be633f9d","resolution":{"observed_at":"2026-08-15T21:26:35.056948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:35.041271Z","title":"An optimal algorithm for the thresholding bandit problem","venue":null,"work_id":"757af101-dd9f-4506-8d23-193b802ada00","year":2016},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.649557Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:7f657acf622877acf360d204527276618d06e7372b466a88a213f4ff9986204d","observation_id":"3ad3ab7c-624a-453a-adf8-a4c88fea3553","resolution":{"observed_at":"2026-08-15T21:26:35.045330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05700","last_updated":"2021-09-15T15:24:33Z","snapshot_observed_at":"2026-08-16T17:57:08.804531Z","submitted_at":"2021-09-13T04:22:21Z","title":"Exploiting Heterogeneity in Robust Federated Best-Arm Identification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.05700","snapshot_observed_at":"2026-08-15T21:26:34.652111Z","title":"Exploiting heterogeneity in robust federated best-arm identification","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.652111Z"},"links":{"cited_paper":"/paper/2109.05700","citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:9008cfbbd6b48dc23e720bb118f2dcf3b7080f9c3384735caef7ec1d973aba1c","observation_id":"20d55f91-2ef6-4dcd-b3c4-1bb912d4b4e3","resolution":{"observed_at":"2026-08-15T21:26:34.652111Z","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-15T21:26:35.029900Z","title":"S., Shanmugam, K., and Jain, P","venue":null,"work_id":"b9587fb7-d8b0-4650-8973-59604616c84d","year":2023},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.655491Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:dfc9248bc1b3694ddb0ff95b14e0c9be2656289bc9e9b47ad772e8219dfc297d","observation_id":"e61d1c34-5b42-4ba5-91b1-c834c4307e86","resolution":{"observed_at":"2026-08-15T21:26:35.034074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:35.019618Z","title":"Near-optimal collaborative learning in bandits","venue":null,"work_id":"7392caf6-e0f5-4c3a-830b-316d4d901f87","year":2022},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.658766Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:cade46ef0981a80f1cb8d27799090c5903ca1fed49f3124c38a768a68d352e57","observation_id":"d1430962-b56c-408b-b2b2-5b35a65d0c75","resolution":{"observed_at":"2026-08-15T21:26:35.023020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.04134","last_updated":"2025-02-17T13:31:17Z","snapshot_observed_at":"2026-08-16T17:01:41.997648Z","submitted_at":"2022-05-09T09:06:42Z","title":"Federated Multi-Armed Bandits Under Byzantine Attacks","version":3},"cited_work":{"arxiv_id":"2205.04134","doi":null,"metadata_source":"pith","pith_arxiv_id":"2205.04134","snapshot_observed_at":"2026-08-15T21:26:34.753927Z","title":"Federated Multi-Armed Bandits Under Byzantine Attacks","venue":"cs.LG","work_id":"a195cac7-574a-4350-a783-c6288fc1dc0f","year":2022},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.662616Z"},"links":{"cited_paper":"/paper/2205.04134","citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:fd462faedb89cca02189e4a3d1b2209619a06d014038bd35bf4f038f6562d8bb","observation_id":"d133f859-64ee-4634-8bcf-ea7213283ef7","resolution":{"observed_at":"2026-08-15T21:26:34.760060Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:35.006840Z","title":"and Shen, C","venue":null,"work_id":"c8beb871-016d-4f3f-8c28-cb3e708493c7","year":2021},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.666809Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:3134ef641ff0e85f00ed8dd05f0c5aa9447e6fff220660777c0e4efb3a603f71","observation_id":"2df43ec7-857f-4267-8825-50cf2f31cec6","resolution":{"observed_at":"2026-08-15T21:26:35.011263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:34.995331Z","title":"Federated multi-armed bandits with personalization","venue":null,"work_id":"22c5b16f-07df-40c8-aeff-5616818e049a","year":2021},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.670142Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:6746046e0e2f7124fd4138b871fcab5b919e023ac99791286080fe7cb952ad8f","observation_id":"7e347d24-a6d5-4bcb-9e4f-27bd7bd0714a","resolution":{"observed_at":"2026-08-15T21:26:34.999182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:34.983544Z","title":"Collaborative learning with limited interaction: Tight bounds for distributed exploration in multi-armed bandits","venue":null,"work_id":"7186cf8f-c48c-4a3d-bfc8-e9cce27f6e6f","year":2019},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.673628Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:134780b3240af4c3846055d00bab6a066e07a36a3d06c78f9439aa6c3874e0a3","observation_id":"8be40016-79fd-43cb-829b-88be4188d175","resolution":{"observed_at":"2026-08-15T21:26:34.987519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11485","last_updated":"2024-06-17T12:52:19Z","snapshot_observed_at":"2026-08-16T13:42:17.080653Z","submitted_at":"2024-06-17T12:52:19Z","title":"Active clustering with bandit feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11485","snapshot_observed_at":"2026-08-15T21:26:34.677206Z","title":"Active clustering with bandit feedback","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.677206Z"},"links":{"cited_paper":"/paper/2406.11485","citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:0ac67ff9d253d76967e0b66ef095b5d1952904ba8d2516bca0b963ad242e6928","observation_id":"adb2c483-1bb3-4c0d-b753-94754a57b9e0","resolution":{"observed_at":"2026-08-15T21:26:34.677206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11015","last_updated":"2024-09-30T00:21:39Z","snapshot_observed_at":"2026-08-16T17:36:59.064772Z","submitted_at":"2023-10-17T06:04:00Z","title":"Pure Exploration in Asynchronous Federated Bandits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11015","snapshot_observed_at":"2026-08-15T21:26:34.680789Z","title":"Pure exploration in asynchronous federated bandits","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.680789Z"},"links":{"cited_paper":"/paper/2310.11015","citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:56ef0da6cf3e93f6e75180e1fa85ab48773dc138449f794541df08492dbd6b2b","observation_id":"0d8c1af7-f002-4ad8-951a-12b652b806e5","resolution":{"observed_at":"2026-08-15T21:26:34.680789Z","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-15T21:26:34.972576Z","title":null,"venue":null,"work_id":"7d5f53bc-a412-458c-8e97-191ceab01b5d","year":2024},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.684551Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:6d060ceebebd146ebcb74bdde922cab04dc34d418c4b55a0e8e6bd4edb95b0a6","observation_id":"942102b1-b3fd-4f23-b213-8a5d3fb25e91","resolution":{"observed_at":"2026-08-15T21:26:34.976038Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:34.961287Z","title":"C., Huang, Y., Tan, V","venue":null,"work_id":"c357d17a-a6f0-4134-ae98-0190170781f9","year":2025},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.687942Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:782aa104b8c382479783eb6feee208fed2a3d6f82a7694d61448c1e417b9713d","observation_id":"e95e8a9d-e057-4541-9023-f46d1a66e853","resolution":{"observed_at":"2026-08-15T21:26:34.964913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:34.949124Z","title":"Ie 498: Online learning and decision making, fall 2019 sep","venue":null,"work_id":"40ba271b-5caa-467a-9d2b-0cdb8956910d","year":2019},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.691283Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:c2dec45def922296b4f2a438bc84d0824251d75456e3cec1ffb0133927aedd7d","observation_id":"d7e7773e-8713-4bd1-b0cc-ef6f53bfda48","resolution":{"observed_at":"2026-08-15T21:26:34.953345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:34.937252Z","title":"and Liu, J","venue":null,"work_id":"bb2b455d-58ad-40fb-8204-f0bae0b6f051","year":2023},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.694925Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:55f88302994ba6e636cd52fffa3e963cc4c77a98c520f4bf48aa2454b44555c5","observation_id":"1d0d4aa3-7770-4631-a671-ec0f748e5a03","resolution":{"observed_at":"2026-08-15T21:26:34.941128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:26:34.925605Z","title":"Federated bandit: A gossiping approach","venue":null,"work_id":"a6446475-ca91-4525-bc66-8dfdba3a5913","year":2021},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.698277Z"},"links":{"citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:539451cda573fe294027c609a98b6335895d523843d06b8cf44e2d7e3a87b7d4","observation_id":"a9bbbe59-8482-4399-ac70-b0ece2ff8794","resolution":{"observed_at":"2026-08-15T21:26:34.928995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":4,"verified_fuzzy":26},"total_outbound_references":45},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2505.10147."}