{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:7V7K33WK25DRTWTNPQGCG6Y33M","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":"35d1434976f2b9281a1c1c0b2aa0e4c8ae1fa7adf36b20a104408296967349ed","cross_cats_sorted":["cs.LG","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-11-16T04:53:54Z","title_canon_sha256":"2666ee2031948cf6e9ca477274d4b710b9626b3782205aa2c36bbc08c8ff5f37"},"schema_version":"1.0","source":{"id":"2011.07720","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.07720","created_at":"2026-07-05T03:21:07Z"},{"alias_kind":"arxiv_version","alias_value":"2011.07720v2","created_at":"2026-07-05T03:21:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.07720","created_at":"2026-07-05T03:21:07Z"},{"alias_kind":"pith_short_12","alias_value":"7V7K33WK25DR","created_at":"2026-07-05T03:21:07Z"},{"alias_kind":"pith_short_16","alias_value":"7V7K33WK25DRTWTN","created_at":"2026-07-05T03:21:07Z"},{"alias_kind":"pith_short_8","alias_value":"7V7K33WK","created_at":"2026-07-05T03:21:07Z"}],"graph_snapshots":[{"event_id":"sha256:159a2c0050bb5d9c50a5ebf9c19a725461ff454ac2faeab1adf2e8513e48813b","target":"graph","created_at":"2026-07-05T03:21:07Z","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/2011.07720/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the decentralized multi-agent multi-armed bandit problem for agents that communicate with probability over a network defined by a $d$-regular graph. Every edge in the graph has probabilistic weight $p$ to account for the ($1\\!-\\!p$) probability of a communication link failure. At each time step, each agent chooses an arm and receives a numerical reward associated with the chosen arm. After each choice, each agent observes the last obtained reward of each of its neighbors with probability $p$. We propose a new Upper Confidence Bound (UCB) based algorithm and analyze how agent-based str","authors_text":"Naomi Ehrich Leonard, Udari Madhushani","cross_cats":["cs.LG","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-11-16T04:53:54Z","title":"Distributed Bandits: Probabilistic Communication on $d$-regular Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.07720","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:8998167d4ee2fe2d3472a85b7dae92467b9d03a32d1211ce956d91a19ef39993","target":"record","created_at":"2026-07-05T03:21:07Z","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":"35d1434976f2b9281a1c1c0b2aa0e4c8ae1fa7adf36b20a104408296967349ed","cross_cats_sorted":["cs.LG","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-11-16T04:53:54Z","title_canon_sha256":"2666ee2031948cf6e9ca477274d4b710b9626b3782205aa2c36bbc08c8ff5f37"},"schema_version":"1.0","source":{"id":"2011.07720","kind":"arxiv","version":2}},"canonical_sha256":"fd7eadeecad74719da6d7c0c237b1bdb34b27fc1f55c590bd2896914c7578819","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd7eadeecad74719da6d7c0c237b1bdb34b27fc1f55c590bd2896914c7578819","first_computed_at":"2026-07-05T03:21:07.219594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:21:07.219594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YbocRAFJwFQUT76ikQDPkxHIxCYWtEu6m7eCo6Bs5sDOfyqjwUKcJVuGvmppLLtUPgZFHH0KR0u7zGicccXADQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:21:07.220070Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.07720","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8998167d4ee2fe2d3472a85b7dae92467b9d03a32d1211ce956d91a19ef39993","sha256:159a2c0050bb5d9c50a5ebf9c19a725461ff454ac2faeab1adf2e8513e48813b"],"state_sha256":"8d6e72c8a5983fa4dde770ef4fdada544f9c74a22b22e74474a347bc11a30bca"}