{"as_of":"2026-08-17T03:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:662e7dd8f8733960afdb4439147e703f2aeec004363b5c045298725d20e33b73","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T01:10:39.240949Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2506.12490/citation-record","integrity":"/paper/2506.12490/integrity","json":"/paper/2506.12490/citation-record.json","paper":"/paper/2506.12490"},"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-07T01:10:43.307991Z","title":"Fighting bandits with a new kind of smoothness","venue":null,"work_id":"c99cdd93-815b-4832-8dd9-5ec367c2812a","year":2015},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.290743Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:4ad21953e5da94332e7318ab38e88ecc5d5654769fe9541a89c2f8f3f61e0b6b","observation_id":"ce50842e-d0c5-44d5-be67-5ae24a0f4407","resolution":{"observed_at":"2026-08-07T01:10:43.438222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:43.064166Z","title":"Regret in online combinatorial optimization","venue":null,"work_id":"b898f7ea-37e4-4012-a4ad-b77c6f77efde","year":2014},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.381016Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:70b4c5b0f7a47a9eeee9b923669d0c4f61d2fbccff36477e5b04689bfb84df39","observation_id":"e1c9d1ec-09fd-491e-947d-0e21910a08dd","resolution":{"observed_at":"2026-08-07T01:10:43.174127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:42.814417Z","title":"Geometric resampling in nearly linear time for follow-the-perturbed-leader with best-of-both-worlds guarantee in bandit problems","venue":null,"work_id":"8de726dd-a415-44a9-a234-813771d8fc0f","year":2025},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.493409Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:62cf25c8a934b9bdced4839beae9d5afc78f981bd593a6320953b5d718de7399","observation_id":"7c965ff0-6b57-4bb8-8507-902ccde2eb2c","resolution":{"observed_at":"2026-08-07T01:10:42.934456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:42.504060Z","title":"Combinatorial multi-armed bandit: General framework and applications","venue":null,"work_id":"1f209927-f831-4b7c-b008-ab29d075cba7","year":2013},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.594589Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:2db75ae886cdd3489d52ab61f35353765a1fc0597052d3a48b0c5ccd9fb450b4","observation_id":"9dda6306-5540-4f99-98dd-59e22f093e83","resolution":{"observed_at":"2026-08-07T01:10:42.648126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:42.238733Z","title":"Combinatorial network optimization with unknown variables: Multi-armed bandits with linear rewards and individual observations","venue":null,"work_id":"c70e87c3-f02c-4460-bcf7-4bc38b63accd","year":2012},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.674290Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:b1358f7bcfbcfcd96081cc29a9f644f02c435b12e2229868624e72d1bfc876fa","observation_id":"d22bd4bc-3875-4e79-bdfa-b181afe6b21a","resolution":{"observed_at":"2026-08-07T01:10:42.367380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:42.022018Z","title":"Follow-the-Perturbed-Leader Achieves Best-of-Both-Worlds for Bandit Problems","venue":null,"work_id":"25b64533-eb5c-47c3-b2d3-3216f98f8a73","year":2023},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.797038Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:40efe999fce60b1eb04ac5958aa1d34dbbe2c7fa9124fe5dfbde9cd1dfd1abcb","observation_id":"1ebe5827-2a83-4e8b-b0cc-ecc2ff7bcdad","resolution":{"observed_at":"2026-08-07T01:10:42.113649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:41.778277Z","title":"Hybrid regret bounds for combinatorial semi-bandits and adversarial linear bandits","venue":null,"work_id":"35d26bde-2cc3-4456-9189-bb92a7031eb5","year":2021},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.895960Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:97adcdd85f8866f8789095ee7e8731db9d62b2713f72534c2c78e685421f0fc0","observation_id":"e1d098f5-f577-4504-a9d5-fc893191b6c2","resolution":{"observed_at":"2026-08-07T01:10:41.887039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:41.627737Z","title":"Matroid bandits: fast combinatorial optimization with learning","venue":null,"work_id":"8e8d2eca-b714-46dc-999e-8d159b59e4b1","year":2014},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.986231Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:49f567f3186b66420bbb95e237c5360fdd769473e9ac129942fdfd7272a63062","observation_id":"c6013070-d1ef-46ed-a0bf-97b5ed21500f","resolution":{"observed_at":"2026-08-07T01:10:41.710403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:41.448131Z","title":"Tight regret bounds for stochastic combinatorial semi-bandits","venue":null,"work_id":"04e1f3d2-b434-4eaf-9a3a-e808961216ed","year":2015},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.065751Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:5221c8297e9731769fcc4b2b5ff14b15e6871725ae091fc9cf132414056e69f5","observation_id":"869c4262-d63a-477c-bc80-249f4f52bc1d","resolution":{"observed_at":"2026-08-07T01:10:41.565269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:41.285192Z","title":"Follow-the-perturbed-leader with fréchet-type tail distributions: Optimality in adversarial bandits and best-of-both-worlds","venue":null,"work_id":"ee19e3d5-baa0-4136-bc23-13c2a63f9aae","year":2024},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.139137Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:d10924d41d4146faa488b1f1be883ffd18587451dcf019da71a5b0ebc85cea18","observation_id":"66b0766a-0e33-454e-9afc-2ec65ef96ea9","resolution":{"observed_at":"2026-08-07T01:10:41.384464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:41.106907Z","title":"Exact moments of order statistics from the pareto distribution","venue":null,"work_id":"2c3f234d-b846-4e57-a0c2-4f33bf92bb2b","year":1966},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.223142Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:5778d90b386acb07b96997d947e929676922faf49cfe46560127e1b8c607d936","observation_id":"481f619a-dde7-462c-b189-559026062428","resolution":{"observed_at":"2026-08-07T01:10:41.167370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:40.865693Z","title":"First-order regret bounds for combinatorial semi-bandits","venue":null,"work_id":"afdae585-fa7a-4785-8c82-d8645774665f","year":2015},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.304154Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:795e953df7895473cd768131070b4a9892b3ce18fedecbc2864fb5ef9b59db6f","observation_id":"95f2b1c0-9106-406d-84a4-21e4d1287c9b","resolution":{"observed_at":"2026-08-07T01:10:40.990249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:40.621129Z","title":"Importance weighting without importance weights: An efficient algorithm for combinatorial semi-bandits","venue":null,"work_id":"f83d0a4b-3606-47a9-8c74-b5377500dbc1","year":2016},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.405670Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:1485e83428392aa1c98aa6dd1aff15569f6be7e1701dacee656caab157f45b2a","observation_id":"287d65e2-6bf5-4cb7-847b-7dc6263d558a","resolution":{"observed_at":"2026-08-07T01:10:40.747769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:40.422863Z","title":"Online joint bid/daily budget optimization of internet advertising campaigns","venue":null,"work_id":"af86af6f-37fc-4c95-90ed-4793e28ce33c","year":2022},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.502466Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:2bedc9253c3f9490cde14c69fd8fd6b936f4d1aad124b294696782b0b6b66a16","observation_id":"b5a15666-8591-44e9-938b-844c23a95b8a","resolution":{"observed_at":"2026-08-07T01:10:40.516754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:40.188356Z","title":"Further adaptive best-of-both-worlds algorithm for combinatorial semi-bandits","venue":null,"work_id":"dd859e91-74d6-4e1c-8346-22f645137f2b","year":2023},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.581590Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:46107343e91ada05c273d90bb077ab8ab67ace58240aab67d16ac7f301b38896","observation_id":"87ddbfd4-565b-410c-b36b-bf3ac18eadae","resolution":{"observed_at":"2026-08-07T01:10:40.307122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:40.003860Z","title":"Efficient task assignment for spatial crowdsourcing: A combinatorial fractional optimization approach with semi-bandit learning","venue":null,"work_id":"107b14ac-6339-4421-9eed-8e0ee24a2437","year":2016},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.662715Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:09cfaefc2b3459ca926c371440058268229ac17b8eef8144fe6025f4f1c7568c","observation_id":"8c7be7e1-b75e-417c-b85b-365bbcfb82be","resolution":{"observed_at":"2026-08-07T01:10:40.067515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:39.796343Z","title":"Thompson sampling for combinatorial semi-bandits","venue":null,"work_id":"5d3ed681-d915-44df-b621-5e874e79fb94","year":2018},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.783016Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:264542b7babf9741283fc4fe83f17efd05416f6183407f7c6d4648974c2549a3","observation_id":"bfb29e84-a737-4c12-9c6a-049081ae5306","resolution":{"observed_at":"2026-08-07T01:10:39.866882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:39.591221Z","title":"Efficient ordered combinatorial semi-bandits for whole-page recommendation","venue":null,"work_id":"a48436dc-eb47-4b43-ac89-371207ae0c5a","year":2017},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.890399Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:c3ec6758e661a6023e6214fe19d8978da60594748c250e19f696b9fac4f4672f","observation_id":"d24ca6a1-bede-431d-bfbc-e6f1a1062af2","resolution":{"observed_at":"2026-08-07T01:10:39.685318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:38.970333Z","title":"More adaptive algorithms for adversarial bandits","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.970333Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:5cb9e713b601a31142ec8e4b3af0bb33fffaf6fdd03e2dd9eff58062d204d05a","observation_id":"81afac34-0bf8-411e-bc89-bb515e21a1ea","resolution":{"observed_at":"2026-08-07T01:10:38.970333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.07307","last_updated":"2025-07-07T14:25:36Z","snapshot_observed_at":"2026-08-16T12:42:34.107965Z","submitted_at":"2025-04-09T22:07:01Z","title":"Follow-the-Perturbed-Leader Approaches Best-of-Both-Worlds for the m-Set Semi-Bandit Problems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.07307","snapshot_observed_at":"2026-08-07T01:10:39.084987Z","title":"Follow-the-perturbed-leader approaches best-of-both-worlds for the m-set semi-bandit problems","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:39.084987Z"},"links":{"cited_paper":"/paper/2504.07307","citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:6d94cef426bc253cf4597eb5953756b1d346e9454995a1d9cbf0c6c723a55fb7","observation_id":"7cd1c428-1131-432b-bc61-16bc38b38b2a","resolution":{"observed_at":"2026-08-07T01:10:39.084987Z","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-07T01:10:39.163800Z","title":"Tsallis-inf: An optimal algorithm for stochastic and adversarial bandits","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:39.163800Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:a4ccad6623b91e5fad401d3cd6665a4df8b625f607f255cee04886428d5fb526","observation_id":"682d8edf-3974-403d-9936-f9827df21869","resolution":{"observed_at":"2026-08-07T01:10:39.163800Z","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-07T01:10:39.367746Z","title":"Beating stochastic and adversarial semi-bandits optimally and simultaneously","venue":null,"work_id":"ba040df5-af6e-4174-8eaf-3a01be21e7ce","year":2019},"citing_paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:39.240949Z"},"links":{"citing_paper":"/paper/2506.12490"},"observation_digest":"sha256:05d0b9f24fdfab86285e4b62d2e1640d787d0d7297738adddae3c18add583f8b","observation_id":"aa7ac782-61e2-47a7-916e-bb30ab4743f9","resolution":{"observed_at":"2026-08-07T01:10:39.451752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.12490","last_updated":"2025-07-22T07:29:46Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T01:41:22.434504Z","submitted_at":"2025-06-14T13:06:30Z","title":"Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":19},"total_outbound_references":22},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2506.12490."}