{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:SOSDXB5VYQEESMC3PPERCMQJDK","short_pith_number":"pith:SOSDXB5V","schema_version":"1.0","canonical_sha256":"93a43b87b5c40849305b7bc91132091a9b5a1cbd3c943bbd0bcfa0347f9758bc","source":{"kind":"arxiv","id":"2109.14733","version":1},"attestation_state":"computed","paper":{"title":"Batched Bandits with Crowd Externalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Nicolas Broutin, Othmane Safsafi, Raphael Feraud, Romain Laroche","submitted_at":"2021-09-29T21:43:16Z","abstract_excerpt":"In Batched Multi-Armed Bandits (BMAB), the policy is not allowed to be updated at each time step. Usually, the setting asserts a maximum number of allowed policy updates and the algorithm schedules them so that to minimize the expected regret. In this paper, we describe a novel setting for BMAB, with the following twist: the timing of the policy update is not controlled by the BMAB algorithm, but instead the amount of data received during each batch, called \\textit{crowd}, is influenced by the past selection of arms. We first design a near-optimal policy with approximate knowledge of the param"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2109.14733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-09-29T21:43:16Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0bb36f47fef0a932bd2ba3ecadf3bbff8b90dfbcb9bd33899ac4879e1f69d232","abstract_canon_sha256":"9e306dc79726308fc578657778cb64c98aa578570a745d2a0d72777c856b594d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:18:43.939885Z","signature_b64":"6nzUgFd3SgE6Qf9FeTS/11c8G1VkYFzN0xgBl8mkuIwZI9mEfXwhFbCmDFDlcpO9O53Mmr1vr0OVsP6Xp21sAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93a43b87b5c40849305b7bc91132091a9b5a1cbd3c943bbd0bcfa0347f9758bc","last_reissued_at":"2026-07-05T03:18:43.939501Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:18:43.939501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Batched Bandits with Crowd Externalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Nicolas Broutin, Othmane Safsafi, Raphael Feraud, Romain Laroche","submitted_at":"2021-09-29T21:43:16Z","abstract_excerpt":"In Batched Multi-Armed Bandits (BMAB), the policy is not allowed to be updated at each time step. Usually, the setting asserts a maximum number of allowed policy updates and the algorithm schedules them so that to minimize the expected regret. In this paper, we describe a novel setting for BMAB, with the following twist: the timing of the policy update is not controlled by the BMAB algorithm, but instead the amount of data received during each batch, called \\textit{crowd}, is influenced by the past selection of arms. We first design a near-optimal policy with approximate knowledge of the param"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.14733","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.14733/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2109.14733","created_at":"2026-07-05T03:18:43.939558+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.14733v1","created_at":"2026-07-05T03:18:43.939558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.14733","created_at":"2026-07-05T03:18:43.939558+00:00"},{"alias_kind":"pith_short_12","alias_value":"SOSDXB5VYQEE","created_at":"2026-07-05T03:18:43.939558+00:00"},{"alias_kind":"pith_short_16","alias_value":"SOSDXB5VYQEESMC3","created_at":"2026-07-05T03:18:43.939558+00:00"},{"alias_kind":"pith_short_8","alias_value":"SOSDXB5V","created_at":"2026-07-05T03:18:43.939558+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SOSDXB5VYQEESMC3PPERCMQJDK","json":"https://pith.science/pith/SOSDXB5VYQEESMC3PPERCMQJDK.json","graph_json":"https://pith.science/api/pith-number/SOSDXB5VYQEESMC3PPERCMQJDK/graph.json","events_json":"https://pith.science/api/pith-number/SOSDXB5VYQEESMC3PPERCMQJDK/events.json","paper":"https://pith.science/paper/SOSDXB5V"},"agent_actions":{"view_html":"https://pith.science/pith/SOSDXB5VYQEESMC3PPERCMQJDK","download_json":"https://pith.science/pith/SOSDXB5VYQEESMC3PPERCMQJDK.json","view_paper":"https://pith.science/paper/SOSDXB5V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.14733&json=true","fetch_graph":"https://pith.science/api/pith-number/SOSDXB5VYQEESMC3PPERCMQJDK/graph.json","fetch_events":"https://pith.science/api/pith-number/SOSDXB5VYQEESMC3PPERCMQJDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SOSDXB5VYQEESMC3PPERCMQJDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SOSDXB5VYQEESMC3PPERCMQJDK/action/storage_attestation","attest_author":"https://pith.science/pith/SOSDXB5VYQEESMC3PPERCMQJDK/action/author_attestation","sign_citation":"https://pith.science/pith/SOSDXB5VYQEESMC3PPERCMQJDK/action/citation_signature","submit_replication":"https://pith.science/pith/SOSDXB5VYQEESMC3PPERCMQJDK/action/replication_record"}},"created_at":"2026-07-05T03:18:43.939558+00:00","updated_at":"2026-07-05T03:18:43.939558+00:00"}