{"as_of":"2026-08-10T00:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:31e47e8e6afc1451add13832329072ea37ad0ab5caae9c48abfa0fb618414ac8","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:13:54.422096Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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-08-04T10:08:32.141050Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03324","snapshot_observed_at":"2026-08-04T10:08:32.141050Z","title":"Optimization of epsilon-greedy exploration","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.12152","last_updated":"2026-05-28T06:33:59Z","snapshot_observed_at":"2026-08-08T21:08:00.200960Z","submitted_at":"2025-10-14T05:14:54Z","title":"Follow-the-Perturbed-Leader for Decoupled Bandits: Best-of-Both-Worlds and Practicality","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T10:08:32.141050Z"},"links":{"cited_paper":"/paper/2506.03324","citing_paper":"/paper/2510.12152"},"observation_digest":"sha256:3ca3869a8a8d187c50ef838cce4dd327190347ee9e450564852f7119493e5da9","observation_id":"1e14f41d-a43b-4a9e-b494-370aea945480","resolution":{"observed_at":"2026-08-04T10:08:32.141050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.03324/citation-record","integrity":"/paper/2506.03324/integrity","json":"/paper/2506.03324/citation-record.json","paper":"/paper/2506.03324"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:01.201779Z","title":"Barraza-Urbina","venue":null,"work_id":"756f6cbb-52fa-4171-9944-e0c28649c6e7","year":2017},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:50.915480Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:8a21341021e8cb31fea307162e9fab994d6902372a92f468db0032fe899a4bb5","observation_id":"05bba3ce-b9c3-4af0-af88-0bbdf859cfb1","resolution":{"observed_at":"2026-08-07T11:14:01.391351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:14:00.929086Z","title":"Bradbury, R","venue":null,"work_id":"f778f217-9c77-45ff-8092-6cbf812dda22","year":2018},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:50.987949Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:fb35acfc86598567f322ed4e26b5efc1d3bc46bcf580bf85cbb670c201e08f9c","observation_id":"37eea766-70e2-4985-a5c9-6aa45a037cb3","resolution":{"observed_at":"2026-08-07T11:14:01.051287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11582","last_updated":"2023-08-14T23:33:28Z","snapshot_observed_at":"2026-07-06T15:06:00.970408Z","submitted_at":"2023-03-21T04:17:03Z","title":"Adaptive Experimentation at Scale: A Computational Framework for Flexible Batches","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.11582","snapshot_observed_at":"2026-08-07T11:13:51.115593Z","title":"Che and H","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:51.115593Z"},"links":{"cited_paper":"/paper/2303.11582","citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:03c4ca674682e77fa96e7116eab03ac993a675030aae61533f9c73dface848ac","observation_id":"9d8197d1-2b22-4060-bb93-0bec294d9bf6","resolution":{"observed_at":"2026-08-07T11:13:51.115593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.04570","last_updated":"2024-11-07T22:15:01Z","snapshot_observed_at":"2026-08-09T16:58:25.904749Z","submitted_at":"2024-08-08T16:29:09Z","title":"Optimization-Driven Adaptive Experimentation","version":2},"cited_work":{"arxiv_id":"2408.04570","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.04570","snapshot_observed_at":"2026-08-07T11:13:54.543697Z","title":"Optimization-Driven Adaptive Experimentation","venue":"cs.LG","work_id":"ef6189b6-e629-46a2-b231-8005b263438f","year":2024},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:51.236903Z"},"links":{"cited_paper":"/paper/2408.04570","citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:fd16899b46a9d38e37223d1ef139419bdf4f03b027793e9a4e5c27105c89a8d7","observation_id":"5967d231-1b7b-4f9d-95d1-987de749be91","resolution":{"observed_at":"2026-08-07T11:13:54.642934Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:14:00.645193Z","title":null,"venue":null,"work_id":"79f231e2-f183-4212-98ac-29a7f80e312d","year":2021},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:51.356935Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:7defaf2b4ac152f60c7aa85ee837278037c2a30c5c133781720a4e4678277e2a","observation_id":"fb62106f-5b81-4a28-9247-4f8cd4cb3460","resolution":{"observed_at":"2026-08-07T11:14:00.774639Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:14:00.354269Z","title":null,"venue":null,"work_id":"e35f8731-4e3e-4bc0-8cd5-359349e0702c","year":2011},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:51.439721Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:540e70a89bd67cfdd2c3ef2ccf94011c60b86618df491f9f085a96a135642f8a","observation_id":"7713a275-e3e1-4da2-87be-c95e3b8a8d17","resolution":{"observed_at":"2026-08-07T11:14:00.515807Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:14:00.027836Z","title":null,"venue":null,"work_id":"233fb527-c107-4955-8e21-0b40978be51f","year":2024},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:51.537048Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:e1505aac18d51798fa946a5f8fe884c566b897843f40f0d3fe9614a894a70373","observation_id":"665680cd-ad7c-427b-8168-703e2b6360ed","resolution":{"observed_at":"2026-08-07T11:14:00.184597Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:59.783782Z","title":"Esfandiari, A","venue":null,"work_id":"81d2ddb3-a28d-4a42-9f9f-22b15074b824","year":2021},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:51.633023Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:41a8052c610bad775bf85166ed75225784a89fd9653f815b5ba02a66766e10d5","observation_id":"c348c2a6-8ff6-4dea-b641-743109327c09","resolution":{"observed_at":"2026-08-07T11:13:59.908020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:59.503893Z","title":"Foster, D","venue":null,"work_id":"c9c4c1ac-2bb1-4ade-b462-48b88c7a9651","year":2021},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:51.731077Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:cd794fbf4309f5eaa69c6e3747f1ba930fb2d5ae71461045323bfaf3c0dc70f3","observation_id":"d2bf421b-7b5d-4e3d-8f53-7237dd1d8859","resolution":{"observed_at":"2026-08-07T11:13:59.630845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:59.181869Z","title":null,"venue":null,"work_id":"4bb3a39f-b649-40a3-90a7-de34672dd154","year":2019},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:51.821024Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:2c5f2fbb1808dacf34d03e045bb988ad0db0554020801cef707eeb25c6b04450","observation_id":"269d5716-3764-45b6-8e17-9e5e86e32ee0","resolution":{"observed_at":"2026-08-07T11:13:59.366474Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:58.932569Z","title":"Garivier, T","venue":null,"work_id":"2942db88-2863-416f-a76b-9c3ce2831c29","year":2016},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:51.897540Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:5a1d31bd765be3ac13083eab02aa2c4db53b0c0611755fc5df7be4ea9eb2a8ec","observation_id":"fe2e16c9-b922-44e9-80f9-f4a64c670150","resolution":{"observed_at":"2026-08-07T11:13:59.079257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:58.557628Z","title":"Glowacka","venue":null,"work_id":"65aa32eb-4e09-4b42-8021-7cdfbe6d73ec","year":2019},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:51.986277Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:c0c687c3aa14b81ff6abba7d50ecec52c70507506cca62c91d75c4ab80c45cf5","observation_id":"bff8de31-64ed-4339-a6ee-a1238c8d63ed","resolution":{"observed_at":"2026-08-07T11:13:58.701954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:58.291496Z","title":null,"venue":null,"work_id":"ec3b2a19-0566-4217-9a90-f1cafcfd1b55","year":2020},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:52.070186Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:f4109e6e2fcae3c5891597f275a091303d87ef3fa0b3022e441af023ec834f67","observation_id":"5624bbf0-1510-4db7-a61a-a00955db2910","resolution":{"observed_at":"2026-08-07T11:13:58.389657Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:58.081995Z","title":null,"venue":null,"work_id":"eebc53ad-a046-475c-8d71-29762eee86ed","year":2023},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:52.154627Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:a337bdb36bc319610029404915e8a05cb4b409524871d2b7f62793e06f6a16fa","observation_id":"1f4321b6-12a0-454f-bd71-bb5998afc7e2","resolution":{"observed_at":"2026-08-07T11:13:58.196561Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:57.906168Z","title":"Kalkanli and A","venue":null,"work_id":"1e4529b5-4951-44c1-acfd-94ab0fbde578","year":2021},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:52.287896Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:dddf2e5469d418a51c532ffe7dbfd3b0f98d0e3a02d2c4dbbd8dff19beab2cd8","observation_id":"5a936823-5406-46c5-87d7-aebc1d6f431f","resolution":{"observed_at":"2026-08-07T11:13:57.991642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:57.720346Z","title":"Karbasi, V","venue":null,"work_id":"44cc2bcf-35eb-4fab-bc91-8e3c20c72781","year":2021},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:52.354521Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:ef28cd932edff491960c498edbc7888bbda966244a63c134bdbe15b979feb752","observation_id":"3789c3c4-596d-48a5-9333-0e5c0a218d4b","resolution":{"observed_at":"2026-08-07T11:13:57.820109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:57.489582Z","title":"Koren, R","venue":null,"work_id":"5d35a10f-960f-4eb0-8fcf-82c06ad29fa9","year":2009},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:52.447079Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:1e80326737057c158619b8ec90c8b761add828c4b7a34e79a9836932310b4eba","observation_id":"be29a2bd-af8c-473c-903e-50db20789955","resolution":{"observed_at":"2026-08-07T11:13:57.609478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:57.328799Z","title":"Langford and T","venue":null,"work_id":"f1fb0c47-2ae1-4e11-82cd-85c661304e30","year":2007},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:52.552020Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:027bbe96f893fe58450b44b8519c2375d52a7a084c2da874f165e4f0efec42c0","observation_id":"69847a66-30cb-428f-b538-1fe5dc3e5095","resolution":{"observed_at":"2026-08-07T11:13:57.395337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:52.631179Z","title":"Lattimore and C","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:52.631179Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:a5a4a841ae3167de9e00305890ebe76676f5f8f19804f92c451a409762ed070d","observation_id":"986c44ca-072e-4919-84c9-0f78abda9f29","resolution":{"observed_at":"2026-08-07T11:13:52.631179Z","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-07T11:13:57.090722Z","title":null,"venue":null,"work_id":"b2c95460-3266-4744-aaaa-3eaa743b03f9","year":2010},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:52.719728Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:54e014ddf3f48b45ea641db8e8e42b45e7b1a7c7b1357641992e88ef2f30f16b","observation_id":"6fd3d900-c84d-422a-92ed-0d087291e2fd","resolution":{"observed_at":"2026-08-07T11:13:57.230186Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:56.876470Z","title":null,"venue":null,"work_id":"17c4d890-2c86-40f4-876e-a63cd9c906c1","year":2022},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:52.831783Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:610ed23bc4dbb2c1f7b20c358316bff045439767d898c4bd15bf961a0dcdba15","observation_id":"85a14417-789c-4a73-a9a1-af2e9ba5b8c5","resolution":{"observed_at":"2026-08-07T11:13:56.973141Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.11431","last_updated":"2023-04-26T22:49:15Z","snapshot_observed_at":"2026-07-06T14:33:47.984474Z","submitted_at":"2022-12-22T00:47:40Z","title":"Local Policy Improvement for Recommender Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.11431","snapshot_observed_at":"2026-08-07T11:13:52.928488Z","title":"Liang and N","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:52.928488Z"},"links":{"cited_paper":"/paper/2212.11431","citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:11ad4e5d108a828ae578962acd8395d0156230069a39496a784b1cfbca3abd2b","observation_id":"e4a029fc-a19e-4ee3-8959-59d120594efd","resolution":{"observed_at":"2026-08-07T11:13:52.928488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1407.2806","last_updated":"2014-07-10T14:32:37Z","snapshot_observed_at":"2026-07-06T03:48:39.896655Z","submitted_at":"2014-07-10T14:32:37Z","title":"Bandits Warm-up Cold Recommender Systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1407.2806","snapshot_observed_at":"2026-08-07T11:13:53.029358Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:53.029358Z"},"links":{"cited_paper":"/paper/1407.2806","citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:8e89386713e42e06631b7dff226ab128cc47d73e28e646da05a05b56db5dfad8","observation_id":"a83570eb-aeb6-4674-9c49-5b929df310be","resolution":{"observed_at":"2026-08-07T11:13:53.029358Z","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-07T11:13:56.674714Z","title":"McInerney, B","venue":null,"work_id":"3e68b07f-8bc9-46e4-8b7e-9d775f45518b","year":2018},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:53.131339Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:be1e81b51daf28420249ce05338c1bd89dfa69643b3eac4cf634a09e61796705","observation_id":"b5767b91-7a6a-46fb-ade1-bde26aeca2f9","resolution":{"observed_at":"2026-08-07T11:13:56.767837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1405.7544","last_updated":"2014-05-29T13:05:39Z","snapshot_observed_at":"2026-08-08T20:06:25.850142Z","submitted_at":"2014-05-29T13:05:39Z","title":"Cold-start Problems in Recommendation Systems via Contextual-bandit Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1405.7544","snapshot_observed_at":"2026-08-07T11:13:53.189753Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:53.189753Z"},"links":{"cited_paper":"/paper/1405.7544","citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:65751e93e0794952bddb20cf1e3959684cf778915781e13c0b2138d2e31a2e12","observation_id":"bcd8fb4c-a873-4c9f-875d-eba6e8b90e6e","resolution":{"observed_at":"2026-08-07T11:13:53.189753Z","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-07T11:13:56.482748Z","title":"Paszke, S","venue":null,"work_id":"40e86b5a-fd2b-473c-897a-27ea7313ce25","year":2017},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:53.286678Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:d4f7040a1689a5cd5c34fccbce721ace4ff47405b46c05b05b096cfd521b1059","observation_id":"c38f4185-853e-416f-8bac-fd4c9b61e4bc","resolution":{"observed_at":"2026-08-07T11:13:56.567417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:56.364232Z","title":"Perchet, P","venue":null,"work_id":"b39909ce-2517-4fc6-bef8-d9c1e80a9ffa","year":2016},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:53.370571Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:b083409adcab635ebc93a11dcddb32393de46f763779614a4a6fcf7b1ba485bf","observation_id":"06eb3c68-e243-4663-862f-aa310d7640aa","resolution":{"observed_at":"2026-08-07T11:13:56.415372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:56.167680Z","title":"Rainforth, A","venue":null,"work_id":"ac8df649-8f60-456b-b703-8f2fffe9c468","year":2024},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:53.470728Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:2c1a340b495b00cfe509f33bd76e098342a86e4e72a618f020ec0008db94bcf6","observation_id":"435f1420-8b0c-48e2-ba68-244afacd29b4","resolution":{"observed_at":"2026-08-07T11:13:56.260478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:53.557442Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:53.557442Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:49b040eff26dc106bb25b5442976cce4f6cbe51fa512a612d46c526226d4b699","observation_id":"8c062de9-385d-42e2-adb0-6f26c2c3abb1","resolution":{"observed_at":"2026-08-07T11:13:53.557442Z","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-07T11:13:55.906700Z","title":null,"venue":null,"work_id":"ebbf4c95-a47a-4008-b69a-287bb8000b98","year":2002},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:53.659893Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:6c7a4a62611949ce54544720ba48c45d8e01884db4f951ca199057e26cd602fd","observation_id":"9205e77c-76e3-4f57-99ec-efafc650e9be","resolution":{"observed_at":"2026-08-07T11:13:56.035383Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:55.693760Z","title":"Silva, T","venue":null,"work_id":"f83098e2-44cf-4fc5-9b79-667c01d7d8b9","year":2023},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:53.756171Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:59e74e8b9216d0f85051ca7585987d6f70b40e0c813bd6b8ef4dfa9717a97e0d","observation_id":"ee999adb-1157-4613-9e48-dd896fc33d49","resolution":{"observed_at":"2026-08-07T11:13:55.823828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:53.865904Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:53.865904Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:a0610d15b29f64b42f60138a6168a099b681a0547b5577df7e0676c6d0afb594","observation_id":"75de1483-e8d7-4740-b88d-a4260492580a","resolution":{"observed_at":"2026-08-07T11:13:53.865904Z","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-07T11:13:55.498365Z","title":"Swaminathan, A","venue":null,"work_id":"95923e23-42dd-4a80-9207-969b9fd25ed8","year":2017},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:53.968591Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:ad9303aae1221b4f186e8247e6fd42f87472fc4d1679bb3aa5b823125ea8f973","observation_id":"1f285b2f-9283-4be2-b3f6-5146d4332a33","resolution":{"observed_at":"2026-08-07T11:13:55.580217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:55.274862Z","title":null,"venue":null,"work_id":"a23ccabc-9fdb-42e4-969e-955caa2d906e","year":2014},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:54.096527Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:955d5c989c67e9803ac554b4a7a0f5332d37f1bfcd906ddcb96221768c127c7e","observation_id":"56f0496b-f298-4377-9728-21894492ee82","resolution":{"observed_at":"2026-08-07T11:13:55.401664Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:55.113528Z","title":"van den Akker, O","venue":null,"work_id":"f56edee4-124f-465b-8804-e42b0f178a9f","year":2024},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:54.178329Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:ba6011801068dac112634bbb36f83c5ec2f5c2324f64dd276b7efd1e6366d03d","observation_id":"a9021c04-dc92-49f7-8616-1d28eefc4e33","resolution":{"observed_at":"2026-08-07T11:13:55.201879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:54.911369Z","title":"Vermorel and M","venue":null,"work_id":"07ee80f7-4ea8-4311-8f35-492071334d08","year":2005},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:54.293899Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:fd8875040541588620afdd99154e5ca8bfebd1cd9a0ecdc16c4613b8f9f0ecce","observation_id":"45470c32-37bd-4ff3-8465-1b1962d2771d","resolution":{"observed_at":"2026-08-07T11:13:55.027199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:13:54.749297Z","title":null,"venue":null,"work_id":"b160ac21-89b0-4bf9-921d-f59f385dec73","year":2014},"citing_paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T11:13:54.422096Z"},"links":{"citing_paper":"/paper/2506.03324"},"observation_digest":"sha256:c8161a6877f7d217c9650bb1187487bb2cae25a7117ca8f64132fd314500d474","observation_id":"0bfaefac-a618-4bda-805a-5b1fcd4dd9c8","resolution":{"observed_at":"2026-08-07T11:13:54.818461Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.03324","last_updated":"2025-06-03T19:14:53Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T21:07:44.959116Z","submitted_at":"2025-06-03T19:14:53Z","title":"Optimization of Epsilon-Greedy Exploration"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":1,"verified_fuzzy":18},"total_outbound_references":37},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 1 inbound Pith citation observation for arXiv:2506.03324."}