{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:PIBTTMDWGRGO3XJGW6TSLK7M4K","short_pith_number":"pith:PIBTTMDW","canonical_record":{"source":{"id":"2110.04396","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2021-10-08T22:30:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2abfe4aa1a47622e39d12b466db0015ab8270ea1409b9047a09a29026165628c","abstract_canon_sha256":"7d885c5a04cb2031d5be13e2c966251010e05071a537e3f22effe57166a284a1"},"schema_version":"1.0"},"canonical_sha256":"7a0339b076344ceddd26b7a725abece2b6ae5d6dedf650735a2463d741274a6d","source":{"kind":"arxiv","id":"2110.04396","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.04396","created_at":"2026-07-05T03:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"2110.04396v1","created_at":"2026-07-05T03:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.04396","created_at":"2026-07-05T03:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"PIBTTMDWGRGO","created_at":"2026-07-05T03:21:16Z"},{"alias_kind":"pith_short_16","alias_value":"PIBTTMDWGRGO3XJG","created_at":"2026-07-05T03:21:16Z"},{"alias_kind":"pith_short_8","alias_value":"PIBTTMDW","created_at":"2026-07-05T03:21:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:PIBTTMDWGRGO3XJGW6TSLK7M4K","target":"record","payload":{"canonical_record":{"source":{"id":"2110.04396","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2021-10-08T22:30:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2abfe4aa1a47622e39d12b466db0015ab8270ea1409b9047a09a29026165628c","abstract_canon_sha256":"7d885c5a04cb2031d5be13e2c966251010e05071a537e3f22effe57166a284a1"},"schema_version":"1.0"},"canonical_sha256":"7a0339b076344ceddd26b7a725abece2b6ae5d6dedf650735a2463d741274a6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:21:16.327556Z","signature_b64":"dXyq8NtsDKSp/eBx06zPd8pkPYkkfhjFfMYSs13UGUV0b1j+ZrUPRvVJKPqFATfuEkJlyG4CuoeVHuwIEljVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a0339b076344ceddd26b7a725abece2b6ae5d6dedf650735a2463d741274a6d","last_reissued_at":"2026-07-05T03:21:16.327072Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:21:16.327072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.04396","source_version":1,"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-05T03:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FVqJA0O33LNmTiIJuBsS9K55zr5vJpUWTYF2Uj7YMfb9A/V1HGroYW33Vdqp1ZlUrywsJB2jGNTfzEchslr5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T05:28:56.312762Z"},"content_sha256":"26d09a29bc503aebedae6f2f39e19175af1644ce3c425e90a053eb49618d2579","schema_version":"1.0","event_id":"sha256:26d09a29bc503aebedae6f2f39e19175af1644ce3c425e90a053eb49618d2579"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:PIBTTMDWGRGO3XJGW6TSLK7M4K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"When to Call Your Neighbor? Strategic Communication in Cooperative Stochastic Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Naomi Leonard, Udari Madhushani","submitted_at":"2021-10-08T22:30:43Z","abstract_excerpt":"In cooperative bandits, a framework that captures essential features of collective sequential decision making, agents can minimize group regret, and thereby improve performance, by leveraging shared information. However, sharing information can be costly, which motivates developing policies that minimize group regret while also reducing the number of messages communicated by agents. Existing cooperative bandit algorithms obtain optimal performance when agents share information with their neighbors at \\textit{every time step}, i.e., full communication. This requires $\\Theta(T)$ number of messag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.04396","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/2110.04396/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-05T03:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xEu/7D7xUYMauDHlCCoYxvEfl9FybUYGTZ9Llt8Fn8yGKR4JKVhJK10fqV9FGEli+4rfphjL4+T05j+Ae+KkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T05:28:56.313304Z"},"content_sha256":"fc376e64098e00e34654fb94cfafa4511e9404cf3e5a53a1f91efe50a3dbdb82","schema_version":"1.0","event_id":"sha256:fc376e64098e00e34654fb94cfafa4511e9404cf3e5a53a1f91efe50a3dbdb82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PIBTTMDWGRGO3XJGW6TSLK7M4K/bundle.json","state_url":"https://pith.science/pith/PIBTTMDWGRGO3XJGW6TSLK7M4K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PIBTTMDWGRGO3XJGW6TSLK7M4K/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-08-01T05:28:56Z","links":{"resolver":"https://pith.science/pith/PIBTTMDWGRGO3XJGW6TSLK7M4K","bundle":"https://pith.science/pith/PIBTTMDWGRGO3XJGW6TSLK7M4K/bundle.json","state":"https://pith.science/pith/PIBTTMDWGRGO3XJGW6TSLK7M4K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PIBTTMDWGRGO3XJGW6TSLK7M4K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:PIBTTMDWGRGO3XJGW6TSLK7M4K","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":"7d885c5a04cb2031d5be13e2c966251010e05071a537e3f22effe57166a284a1","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2021-10-08T22:30:43Z","title_canon_sha256":"2abfe4aa1a47622e39d12b466db0015ab8270ea1409b9047a09a29026165628c"},"schema_version":"1.0","source":{"id":"2110.04396","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.04396","created_at":"2026-07-05T03:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"2110.04396v1","created_at":"2026-07-05T03:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.04396","created_at":"2026-07-05T03:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"PIBTTMDWGRGO","created_at":"2026-07-05T03:21:16Z"},{"alias_kind":"pith_short_16","alias_value":"PIBTTMDWGRGO3XJG","created_at":"2026-07-05T03:21:16Z"},{"alias_kind":"pith_short_8","alias_value":"PIBTTMDW","created_at":"2026-07-05T03:21:16Z"}],"graph_snapshots":[{"event_id":"sha256:fc376e64098e00e34654fb94cfafa4511e9404cf3e5a53a1f91efe50a3dbdb82","target":"graph","created_at":"2026-07-05T03:21:16Z","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/2110.04396/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In cooperative bandits, a framework that captures essential features of collective sequential decision making, agents can minimize group regret, and thereby improve performance, by leveraging shared information. However, sharing information can be costly, which motivates developing policies that minimize group regret while also reducing the number of messages communicated by agents. Existing cooperative bandit algorithms obtain optimal performance when agents share information with their neighbors at \\textit{every time step}, i.e., full communication. This requires $\\Theta(T)$ number of messag","authors_text":"Naomi Leonard, Udari Madhushani","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2021-10-08T22:30:43Z","title":"When to Call Your Neighbor? Strategic Communication in Cooperative Stochastic Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.04396","kind":"arxiv","version":1},"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:26d09a29bc503aebedae6f2f39e19175af1644ce3c425e90a053eb49618d2579","target":"record","created_at":"2026-07-05T03:21:16Z","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":"7d885c5a04cb2031d5be13e2c966251010e05071a537e3f22effe57166a284a1","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2021-10-08T22:30:43Z","title_canon_sha256":"2abfe4aa1a47622e39d12b466db0015ab8270ea1409b9047a09a29026165628c"},"schema_version":"1.0","source":{"id":"2110.04396","kind":"arxiv","version":1}},"canonical_sha256":"7a0339b076344ceddd26b7a725abece2b6ae5d6dedf650735a2463d741274a6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a0339b076344ceddd26b7a725abece2b6ae5d6dedf650735a2463d741274a6d","first_computed_at":"2026-07-05T03:21:16.327072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:21:16.327072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dXyq8NtsDKSp/eBx06zPd8pkPYkkfhjFfMYSs13UGUV0b1j+ZrUPRvVJKPqFATfuEkJlyG4CuoeVHuwIEljVBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:21:16.327556Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.04396","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26d09a29bc503aebedae6f2f39e19175af1644ce3c425e90a053eb49618d2579","sha256:fc376e64098e00e34654fb94cfafa4511e9404cf3e5a53a1f91efe50a3dbdb82"],"state_sha256":"68bee8b1033f43d2f4cb3da9d496654ddcdc9de87259a784b02c35a773f9ed8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p5EfdODPD/5tKd3mJmzxsY9oAxdhujpNe5j4/Nwge+zQcrWusSpLklB+cUfYpWTxSVoUZapUzUjwAyZkdIKmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T05:28:56.319038Z","bundle_sha256":"0109ed31ec4956d14f2853d4110344ae23f18f4aac225b919670b261d163cffb"}}