{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4KYOUPOWDTT4WSFAPVVQKTCRVC","short_pith_number":"pith:4KYOUPOW","canonical_record":{"source":{"id":"1810.04468","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-10-10T11:46:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"663a2580a2a2155339de1e7a1fd06d1031ff502b97e5e188b18a8c470bcdc7b5","abstract_canon_sha256":"b003046d203b6b370db36acd5a2a87c2c9955ffdc77d359313b7c92991b26615"},"schema_version":"1.0"},"canonical_sha256":"e2b0ea3dd61ce7cb48a07d6b054c51a883eaaced950fcbcd4b062516a872105b","source":{"kind":"arxiv","id":"1810.04468","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04468","created_at":"2026-07-05T00:14:29Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04468v2","created_at":"2026-07-05T00:14:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04468","created_at":"2026-07-05T00:14:29Z"},{"alias_kind":"pith_short_12","alias_value":"4KYOUPOWDTT4","created_at":"2026-07-05T00:14:29Z"},{"alias_kind":"pith_short_16","alias_value":"4KYOUPOWDTT4WSFA","created_at":"2026-07-05T00:14:29Z"},{"alias_kind":"pith_short_8","alias_value":"4KYOUPOW","created_at":"2026-07-05T00:14:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4KYOUPOWDTT4WSFAPVVQKTCRVC","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04468","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-10-10T11:46:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"663a2580a2a2155339de1e7a1fd06d1031ff502b97e5e188b18a8c470bcdc7b5","abstract_canon_sha256":"b003046d203b6b370db36acd5a2a87c2c9955ffdc77d359313b7c92991b26615"},"schema_version":"1.0"},"canonical_sha256":"e2b0ea3dd61ce7cb48a07d6b054c51a883eaaced950fcbcd4b062516a872105b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:14:29.408622Z","signature_b64":"p58xrHwh5ay4LzM6ExlYSw7RWbtbLrOGjRqof3v6IhiML+9Ve1p0bJ4G+9YwZyFKx7BBKSDacIODqoD3IkX1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2b0ea3dd61ce7cb48a07d6b054c51a883eaaced950fcbcd4b062516a872105b","last_reissued_at":"2026-07-05T00:14:29.408209Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:14:29.408209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04468","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:14:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j08h1QlO4PvkylWF8/y0QsRxdfpH7zVvHiIJKNhJULkR6PY8Axzs/4O0SihovhEcrQhSc5Vt4v7RsJ7kF5YBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T14:48:57.019982Z"},"content_sha256":"8551e4af1b8421927d6c44af5b01302f4c98aca5e572e4de6050b1037dec762b","schema_version":"1.0","event_id":"sha256:8551e4af1b8421927d6c44af5b01302f4c98aca5e572e4de6050b1037dec762b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4KYOUPOWDTT4WSFAPVVQKTCRVC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decentralized Cooperative Stochastic Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"David Mart\\'inez-Rubio, Patrick Rebeschini, Varun Kanade","submitted_at":"2018-10-10T11:46:20Z","abstract_excerpt":"We study a decentralized cooperative stochastic multi-armed bandit problem with $K$ arms on a network of $N$ agents. In our model, the reward distribution of each arm is the same for each agent and rewards are drawn independently across agents and time steps. In each round, each agent chooses an arm to play and subsequently sends a message to her neighbors. The goal is to minimize the overall regret of the entire network. We design a fully decentralized algorithm that uses an accelerated consensus procedure to compute (delayed) estimates of the average of rewards obtained by all the agents for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04468","kind":"arxiv","version":2},"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/1810.04468/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:14:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OM7f1GOna4fGs4+PVn2qCFARsHG39iav3zuWDg0a4W4ikmEOokG91tWGbigc8lB2xpvm044Ip5Mm2+341lpZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T14:48:57.020371Z"},"content_sha256":"d528dce72d5516bb5841db77862851d099c392e71ff1cf6d2f0759cd679f85df","schema_version":"1.0","event_id":"sha256:d528dce72d5516bb5841db77862851d099c392e71ff1cf6d2f0759cd679f85df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4KYOUPOWDTT4WSFAPVVQKTCRVC/bundle.json","state_url":"https://pith.science/pith/4KYOUPOWDTT4WSFAPVVQKTCRVC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4KYOUPOWDTT4WSFAPVVQKTCRVC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T14:48:57Z","links":{"resolver":"https://pith.science/pith/4KYOUPOWDTT4WSFAPVVQKTCRVC","bundle":"https://pith.science/pith/4KYOUPOWDTT4WSFAPVVQKTCRVC/bundle.json","state":"https://pith.science/pith/4KYOUPOWDTT4WSFAPVVQKTCRVC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4KYOUPOWDTT4WSFAPVVQKTCRVC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4KYOUPOWDTT4WSFAPVVQKTCRVC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b003046d203b6b370db36acd5a2a87c2c9955ffdc77d359313b7c92991b26615","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-10-10T11:46:20Z","title_canon_sha256":"663a2580a2a2155339de1e7a1fd06d1031ff502b97e5e188b18a8c470bcdc7b5"},"schema_version":"1.0","source":{"id":"1810.04468","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04468","created_at":"2026-07-05T00:14:29Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04468v2","created_at":"2026-07-05T00:14:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04468","created_at":"2026-07-05T00:14:29Z"},{"alias_kind":"pith_short_12","alias_value":"4KYOUPOWDTT4","created_at":"2026-07-05T00:14:29Z"},{"alias_kind":"pith_short_16","alias_value":"4KYOUPOWDTT4WSFA","created_at":"2026-07-05T00:14:29Z"},{"alias_kind":"pith_short_8","alias_value":"4KYOUPOW","created_at":"2026-07-05T00:14:29Z"}],"graph_snapshots":[{"event_id":"sha256:d528dce72d5516bb5841db77862851d099c392e71ff1cf6d2f0759cd679f85df","target":"graph","created_at":"2026-07-05T00:14:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1810.04468/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a decentralized cooperative stochastic multi-armed bandit problem with $K$ arms on a network of $N$ agents. In our model, the reward distribution of each arm is the same for each agent and rewards are drawn independently across agents and time steps. In each round, each agent chooses an arm to play and subsequently sends a message to her neighbors. The goal is to minimize the overall regret of the entire network. We design a fully decentralized algorithm that uses an accelerated consensus procedure to compute (delayed) estimates of the average of rewards obtained by all the agents for","authors_text":"David Mart\\'inez-Rubio, Patrick Rebeschini, Varun Kanade","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-10-10T11:46:20Z","title":"Decentralized Cooperative Stochastic Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04468","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8551e4af1b8421927d6c44af5b01302f4c98aca5e572e4de6050b1037dec762b","target":"record","created_at":"2026-07-05T00:14:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b003046d203b6b370db36acd5a2a87c2c9955ffdc77d359313b7c92991b26615","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-10-10T11:46:20Z","title_canon_sha256":"663a2580a2a2155339de1e7a1fd06d1031ff502b97e5e188b18a8c470bcdc7b5"},"schema_version":"1.0","source":{"id":"1810.04468","kind":"arxiv","version":2}},"canonical_sha256":"e2b0ea3dd61ce7cb48a07d6b054c51a883eaaced950fcbcd4b062516a872105b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2b0ea3dd61ce7cb48a07d6b054c51a883eaaced950fcbcd4b062516a872105b","first_computed_at":"2026-07-05T00:14:29.408209Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:14:29.408209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p58xrHwh5ay4LzM6ExlYSw7RWbtbLrOGjRqof3v6IhiML+9Ve1p0bJ4G+9YwZyFKx7BBKSDacIODqoD3IkX1AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:14:29.408622Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04468","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8551e4af1b8421927d6c44af5b01302f4c98aca5e572e4de6050b1037dec762b","sha256:d528dce72d5516bb5841db77862851d099c392e71ff1cf6d2f0759cd679f85df"],"state_sha256":"92e6854ea7106bb542c500c09623015d34348ea7933b2e413a65e0255c46c4fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MgLNU2D/8ccyjN3WurWZTYvx6raJDx/ivnAvRAtP758vg70TOy9lMD4vWb5s/2tT99Vp3iiJZvSm1ZqnVocxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T14:48:57.022669Z","bundle_sha256":"24460810970f676cfb741f3e600b8db79aea54b1b16ca2199d8482b844de8900"}}