{"as_of":"2026-08-18T05:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a8c122e9b50404848a77045890d0f20d8dcfb2bae146bb929dc8c417f42bbe05","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:34:45.004373Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2608.11873/citation-record","integrity":"/paper/2608.11873/integrity","json":"/paper/2608.11873/citation-record.json","paper":"/paper/2608.11873"},"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-16T00:34:45.321990Z","title":"Cascading bandits: Learning to rank in the cascade model,","venue":null,"work_id":"5ca34353-6808-4ded-92b6-c9924b2cd17b","year":2015},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.900009Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:7be3e87d8ab5ead297a01c3077229d619b005109ab025480a4a0f531205bcb5d","observation_id":"e5e5c675-65ce-4577-97de-ee7304989901","resolution":{"observed_at":"2026-08-16T00:34:45.325534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.312220Z","title":"Efficient multiple-click models in web search,","venue":null,"work_id":"ddbbdc0b-6e2e-49a7-8431-a9909ba235f9","year":2009},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.903919Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:a0afa607259c28bc6b164d8ab6cfdc7ada4aaf190bb3141558942e7d83891f8a","observation_id":"f58c7444-a49b-4ee8-b2e3-2f8c88da9fea","resolution":{"observed_at":"2026-08-16T00:34:45.315755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.302558Z","title":"Dcm bandits: Learning to rank with multiple clicks,","venue":null,"work_id":"afad0aa3-29b7-4339-b9d5-7cb50b670715","year":2016},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.907463Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:77cf6e2f1d84c2cd4c0241ed34e273bda0fa1968af8eba07f0d7bfc02f2e2054","observation_id":"bd2ec3b6-b4fa-461b-8da4-175420807342","resolution":{"observed_at":"2026-08-16T00:34:45.305912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.293252Z","title":"Cascading bandits for large-scale recommendation problems,","venue":null,"work_id":"827053fb-bdf8-4e7d-a4d7-b505c120ecff","year":2016},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.912018Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:24291bb7c50d3bf5fa888a3cc9c987acbb3e9db9fb8cee1d796d153680cf7409","observation_id":"4c347765-044f-4744-9bea-0c54a7d1d37b","resolution":{"observed_at":"2026-08-16T00:34:45.296658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.283826Z","title":"Contextual combinatorial cascading bandits,","venue":null,"work_id":"b4f742e0-1698-4043-a39a-8a4c700157eb","year":2016},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.916588Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:a8813c6b397f3d8e50eab741e2727bfee8092d26dfe198dc5fff7c7dcc62870b","observation_id":"e6db63e6-5ddc-4729-8b8b-4f9dd017619f","resolution":{"observed_at":"2026-08-16T00:34:45.287377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.274479Z","title":"Thompson sampling algo- rithms for cascading bandits,","venue":null,"work_id":"07b2b700-25d9-4e49-8079-10c2364dd068","year":2021},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.920021Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:f9aee1a4fe86aac3dd1baa212b4eec11ac181b69d83f4bafbae8e084d9dbc156","observation_id":"4c3e1a55-f847-4163-a2a5-0c95615eaf2e","resolution":{"observed_at":"2026-08-16T00:34:45.277988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:44.924915Z","title":"Combinatorial cascading bandits,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.924915Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:d7201ec7f5452f1142d9671b9c5aa0265648d4ca70db3244a642dde4a26475a6","observation_id":"5adb9624-0736-4563-a643-8c2a7b415391","resolution":{"observed_at":"2026-08-16T00:34:44.924915Z","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-16T00:34:45.260026Z","title":"Federated combinatorial multi-agent multi-armed bandits,","venue":null,"work_id":"afcc74b6-4c46-42ec-aa7e-dde97437561e","year":2024},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.928471Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:1791dec99f7ab691d185b6d9730f5241ff70716783d844839d463cca4fdfd20b","observation_id":"ed85da42-40e8-434b-8793-fd6c3768cf1f","resolution":{"observed_at":"2026-08-16T00:34:45.263255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.251432Z","title":"Fatigue-aware bandits for dependent click models,","venue":null,"work_id":"e041448a-ca90-42c2-9c5d-b0fce14b2efd","year":2020},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.931804Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:aad52a6535196aa000ea8c61c5165ce7fc4c8e3461e17f4b3aef60e7a4214e1a","observation_id":"fc8e5835-8faa-47b2-bc3c-f38492b21e15","resolution":{"observed_at":"2026-08-16T00:34:45.254608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.242536Z","title":"Mitigating exposure bias in online learning to rank recommendation: A novel reward model for cascading bandits,","venue":null,"work_id":"5f9d3415-c9f6-4b83-9d42-e7bda17297ce","year":2024},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.934998Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:c701174a2d014dffa0780334dac02673f05efe95543e4c690ab6aa4cb6abe01c","observation_id":"04c330d2-a764-45c2-b753-e664da75df76","resolution":{"observed_at":"2026-08-16T00:34:45.246094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.232373Z","title":"Cascading bandits robust to adversarial corruptions,","venue":null,"work_id":"bc17e20e-de67-4780-b98b-2e7304b39ca2","year":2025},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.938160Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:86877ad1eaddb8823652025da3bf68d3a1e74051f20cf4522f3ad9562aa9c9d3","observation_id":"93060cb4-4dd4-4451-b1bd-23afe6e4b665","resolution":{"observed_at":"2026-08-16T00:34:45.235864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.223220Z","title":"A survey of real-world recommender systems: Challenges, constraints, and industrial perspectives,","venue":null,"work_id":"58b47377-8da5-4c34-a228-675b9a6c258a","year":2025},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.941397Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:bc5763669ca6933b06e6d41409709525fbaf736bc28dab2273a1fef0a468ae01","observation_id":"1397de72-023c-4f0e-96fa-4dc9aa89afe3","resolution":{"observed_at":"2026-08-16T00:34:45.226585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.213402Z","title":"Recommending for a multi- sided marketplace: A multi-objective hierarchical approach,","venue":null,"work_id":"ec8cd87d-653b-43b4-b784-c6350c7ac023","year":2025},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.944789Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:e3a77b4bb3af4a77c665662613ee774fdae4199f9ece4a3660d38a85cfd3ef85","observation_id":"c56a0753-47e6-4baa-91ab-48729c584b36","resolution":{"observed_at":"2026-08-16T00:34:45.217330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.203270Z","title":"A survey on multiplayer bandits,","venue":null,"work_id":"04289477-cb95-4d00-a135-5e282d0a3cfa","year":2022},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.948115Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:a5ea1956d4d4b16898a2d29e1d8467e8ad2a70b1e0cbb23c1960e08fbf6870a7","observation_id":"c2515032-8e7d-4f9b-b616-a72492648cf6","resolution":{"observed_at":"2026-08-16T00:34:45.207490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.194129Z","title":"Multiplayer bandit learning, from competition to cooperation,","venue":null,"work_id":"e5ef635e-4c0d-44d8-8494-86bea731da02","year":2021},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.951796Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:ae785f6465dc11223d5b613a65ca61d1d9dfaf10a00bfb2647320320903214c3","observation_id":"388fefd9-6345-4697-b510-a3c6194b62e0","resolution":{"observed_at":"2026-08-16T00:34:45.197650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.184587Z","title":"Online learning for coop- erative multi-player multi-armed bandits,","venue":null,"work_id":"f812a770-a25c-4e60-9bcd-c74508316e10","year":2022},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.954900Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:1970727c09f612fd57faf3b5834491c7f9566f22677840cad006a0b17a799494","observation_id":"9fb458d3-413a-4962-890a-4e01d5c1bbb3","resolution":{"observed_at":"2026-08-16T00:34:45.187858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.06210","last_updated":"2023-11-10T17:55:44Z","snapshot_observed_at":"2026-08-17T18:34:33.921452Z","submitted_at":"2023-11-10T17:55:44Z","title":"Optimal Cooperative Multiplayer Learning Bandits with Noisy Rewards and No Communication","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.06210","snapshot_observed_at":"2026-08-16T00:34:44.958023Z","title":"Optimal cooperative multiplayer learning bandits with noisy rewards and no communication,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.958023Z"},"links":{"cited_paper":"/paper/2311.06210","citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:d0f98b37671e8ee6520af22d004c152c54c44a93034216b02a0dab792a615c1f","observation_id":"4936443f-d52f-419d-880c-eb85a42ea507","resolution":{"observed_at":"2026-08-16T00:34:44.958023Z","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-16T00:34:45.176131Z","title":"Multiplayer information asymmetric contextual bandits,","venue":null,"work_id":"8e793805-b849-4631-9285-8885b97ac9bc","year":2025},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.961602Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:e52f5ddd950eaa00886f1468de3701b7f69ecf0b24225da4814a45e03969d4ff","observation_id":"81017b5a-675f-42dc-9c8c-1d3a21d97da6","resolution":{"observed_at":"2026-08-16T00:34:45.179274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.166202Z","title":"Multiplayer information asymmetric bandits in metric spaces,","venue":null,"work_id":"44cfe6a4-9f82-4649-ae40-6913e5aa2419","year":2025},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.964733Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:25a4bf7b6657e4c5fce3ae887145480c2eac345d892447d9525a2bcceca822ea","observation_id":"6fe845cb-3110-45e6-8cad-ebdbb6052cde","resolution":{"observed_at":"2026-08-16T00:34:45.169549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.156294Z","title":"Online clustering of contextual cascading bandits,","venue":null,"work_id":"0fa3a506-bb72-4b1a-aa42-0a799f6150f6","year":2018},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.967915Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:1489cdb3496a539096ff7af6d04d207233bea367bcf5a77c90a57ba594faa417","observation_id":"57bfb31f-fe89-4d89-9a59-8933af529bfe","resolution":{"observed_at":"2026-08-16T00:34:45.160156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.146977Z","title":"Cascading reinforcement learning,","venue":null,"work_id":"e3876577-cd91-41d8-8483-13e8914b5648","year":2024},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.971196Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:c6694771acee9b027a7b099d52400b5e421bbd167ed39cb9fcde254321a93936","observation_id":"56ed7f48-e429-4046-b04d-8ba81b839317","resolution":{"observed_at":"2026-08-16T00:34:45.150378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.137188Z","title":"Competitive collaborative learning,","venue":null,"work_id":"b5c4d78c-0204-4e56-a92d-15c0a561d8bc","year":2005},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.974236Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:a22d7ba32a773084c6a7ca37f429fe2afc64b0a12c5afdf3bbee6da8e70e1c37","observation_id":"d07f06bf-4973-426a-936a-b73da00aaa21","resolution":{"observed_at":"2026-08-16T00:34:45.140669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.127399Z","title":"Distributed cooperative decision-making in multiarmed bandits: Frequentist and bayesian algo- rithms,","venue":null,"work_id":"123b93e8-cc0d-4db0-adb7-c1e3a87b85a6","year":2016},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.977981Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:85a527615e6a7efb440c09bd2ca9681bc41a1b22560011ef3999c8b5dd9ebcb0","observation_id":"c681322c-ecf7-474e-af8e-23008bbf5da4","resolution":{"observed_at":"2026-08-16T00:34:45.130887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.117462Z","title":"Delay and cooperation in nonstochastic bandits,","venue":null,"work_id":"34962bb4-ad17-464c-9e09-1f035af9945e","year":2016},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.981184Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:cb4244488d0147231246d73d81626b5f0a128a99f2f799ad3d113e46e2b6d2a2","observation_id":"bdad4217-adff-473c-b582-b97a3606a8cb","resolution":{"observed_at":"2026-08-16T00:34:45.121017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.107072Z","title":"Multi-player bandits: The adversarial case,","venue":null,"work_id":"aa081b19-f171-458a-b8a9-818a329b3d46","year":2020},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.984318Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:78ebe28ee55fed062d4e993c27d5777c5e2d22b51b60588cd62344f4b54e77cc","observation_id":"53ee3672-87e4-4cb5-af83-9efcf2741e2c","resolution":{"observed_at":"2026-08-16T00:34:45.110823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.096109Z","title":"Multiplayer bandits without observing collision information,","venue":null,"work_id":"bebc1b88-b641-4bfc-967f-3c58b75971a8","year":2021},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.987464Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:3927b21d8a610a2f06d544474080a4ffede918abb0ffbebb4284c6b79198bd7d","observation_id":"2af13f08-f868-4821-9b7f-706c9d5be421","resolution":{"observed_at":"2026-08-16T00:34:45.099925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.085003Z","title":"Multi-list interfaces for recommender systems: survey and future directions,","venue":null,"work_id":"b6667882-5327-4b8e-b945-795f9d4034f7","year":2023},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.990721Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:ffc9ba518aa0886816db9fc7571d351e610d2c1d24d5a20cef2a700932ca0f6c","observation_id":"a8702454-a488-4b7c-8bae-b8ec81b54919","resolution":{"observed_at":"2026-08-16T00:34:45.089114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.074647Z","title":"Recommender systems and supplier competition on platforms,","venue":null,"work_id":"e7b90f79-d427-4000-a1b7-e0fde65da017","year":2023},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.994846Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:b136d001e7e314b9c0b405bd12c7d4733377dc6f7e698bbc8ac9148521864ae4","observation_id":"f9623c3c-94ab-4ec5-87da-c130e3b893cb","resolution":{"observed_at":"2026-08-16T00:34:45.078656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.064410Z","title":"Measurement and applications of position bias in a marketplace search engine,","venue":null,"work_id":"82b81f3b-aa65-4d28-811e-1748f4729a0f","year":2022},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.998196Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:1eb68faa00358c84c70d201c85910b32d6ae2c8039e64e0edd718e5de68fbcb3","observation_id":"e52a4009-ce19-4777-a833-b88693340c65","resolution":{"observed_at":"2026-08-16T00:34:45.068304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.053897Z","title":"Nonstochastic multi-armed bandits with graph-structured feedback,","venue":null,"work_id":"3e4eeb30-bb72-4c8e-a762-cfa1cf5a56fc","year":2014},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:45.001297Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:eb735f6eac3b15af01600af110dc4b23417b65072260bbb51ac0cc48dcb66319","observation_id":"df3d20fb-295b-4a45-a4e4-20ec0a7720a8","resolution":{"observed_at":"2026-08-16T00:34:45.057635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T00:34:45.040960Z","title":"A multi-player mab approach for distributed selection problems,","venue":null,"work_id":"a657c058-0f03-4ada-8c23-fd2af13795e3","year":2023},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:45.004373Z"},"links":{"citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:da47e5aa65e2be4e9341a8cfcf0c7908da47b1b965c4bd843d9e8653db108640","observation_id":"7802f4f3-6c35-4655-bcf6-eb143a83298f","resolution":{"observed_at":"2026-08-16T00:34:45.046686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":29},"total_outbound_references":31},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2608.11873."}