{"as_of":"2026-08-08T21:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7db9e47ce4687f38d1aa4bf8364206e95507e02c2adfc1e9858981cd43f3e58d","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-08T06:32:00.761636+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-07T00:45:55.834771Z","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:aa54c0167f1b23d395c7f50ae1d60e17a9a32104e83d8522ddc05e06ab2c30ed","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:36f3447b352a0c6566f634f3ec8794038b90a72212b0af2ff988ff211eae1194","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:37c0cc5316af0c4a86318d247d7b2b953bf57d0de61f50f8703307a0fa2d7c23","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:27a8a3c50496d182bd60999179715c29e6825170539aa8965b1ea01e26e7b280","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:023af9c4083eddacef3d5f05cf34d6b007b06d8849f05fbd33af4f3b0afa147e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:402463527fd24f6a40f69fec824ac8fa2593fb31fa293dd5eb4a533d94f43711","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:aff5c4c5aa3b9aa4103480b1555c2805bd46eddb28a3af20a1d334fe09e1e621","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:366b7a63302bb536269bab72fed65c792e1d0e2c2bd4f3ad2a12730ef344ab92","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:5566065957457cd9155203fc3dbd29bac57da943c25e53bd6177c4273734c185","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:d1cf994cffd02661cf0f36b5757c99ea85e01fbd0288edb404c5aa2d26daf04d","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:95280f80b0ddb83e543c4a9deb0e0fc437be70e99ca6fb7b8d155920c858e010","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:5e99811dc97b962128f6afa549d8092d587a20d7e7de67754a4bde44ad6188ea","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:daf2282ac5aa27846a5ee8d2c6370f98f23e5e0061a9665e79270c602969b773","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:39c9220d2a50674862f4ffd3769cd7a83b1b5e33897ecdce6c2430a3260cd988","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:4785e3602cc8f5308a58c199a8c5376fefb02fa79d2f7c6516a8639af856ab25","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:14353197912384c08eea20811d4db565158294c46e24c19c0d089c880a9ded00","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:b7f22c7cc1317853b6e260810c5fb90bd0db8dc19c520f461f9d69c8e9f88122","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:e5b6a3fb88f459ee446afed018899b01a8bfb4379c3c8d87d79262b7a3020bdb","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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:5c184dda81bda06c831f6615b3acb48b3406d10e9dbd6aaa7700f562e857d27f","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-07T16:07:02.808962Z","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-07T00:45:55.834771Z","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:b2dd3c110c3054acaf96f304b8cca8646f2ef15481e2945c1ad1122afed0147d","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-07T00:45:55.834771Z","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:c76b884daa63bbe630758da986cd33477d4ab0f8b31b3c48bdb48ee0643ac26d","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-07T00:45:55.834771Z","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:f00f828bc46e700224c6218217040e48e10bde3ee2aab3223532955cd3dc7168","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T00:45:55.834771Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2506.12490."}