{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:NKIJBRUEAFHWFX5LSAOYVP2JZJ","short_pith_number":"pith:NKIJBRUE","canonical_record":{"source":{"id":"2111.10933","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-22T01:05:52Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"08277d852226557ae7cab211b853b6c52047e2807a452dbb1a94a612dafbf824","abstract_canon_sha256":"6b4341a031e038254da69d3ea8002af1d323528f802e85bbe6a7763259d8a47d"},"schema_version":"1.0"},"canonical_sha256":"6a9090c684014f62dfab901d8abf49ca7b76a5c90b7faecedb4f79927f2bcf39","source":{"kind":"arxiv","id":"2111.10933","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.10933","created_at":"2026-07-05T09:54:41Z"},{"alias_kind":"arxiv_version","alias_value":"2111.10933v4","created_at":"2026-07-05T09:54:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.10933","created_at":"2026-07-05T09:54:41Z"},{"alias_kind":"pith_short_12","alias_value":"NKIJBRUEAFHW","created_at":"2026-07-05T09:54:41Z"},{"alias_kind":"pith_short_16","alias_value":"NKIJBRUEAFHWFX5L","created_at":"2026-07-05T09:54:41Z"},{"alias_kind":"pith_short_8","alias_value":"NKIJBRUE","created_at":"2026-07-05T09:54:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:NKIJBRUEAFHWFX5LSAOYVP2JZJ","target":"record","payload":{"canonical_record":{"source":{"id":"2111.10933","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-22T01:05:52Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"08277d852226557ae7cab211b853b6c52047e2807a452dbb1a94a612dafbf824","abstract_canon_sha256":"6b4341a031e038254da69d3ea8002af1d323528f802e85bbe6a7763259d8a47d"},"schema_version":"1.0"},"canonical_sha256":"6a9090c684014f62dfab901d8abf49ca7b76a5c90b7faecedb4f79927f2bcf39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:41.846701Z","signature_b64":"d4/thYzBBhogb+6PotPMdBxKHNd7j96OQ9qCDh/WC2sX2dEfdVQ1kDbyt/SlgxOtiSc2KgGqVvvX/3nRxOTJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a9090c684014f62dfab901d8abf49ca7b76a5c90b7faecedb4f79927f2bcf39","last_reissued_at":"2026-07-05T09:54:41.846192Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:41.846192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.10933","source_version":4,"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-05T09:54:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k8EVXA8rqNZACM64lgZzJUh4rrrjCJQbzBWHJaHO8AWgPQ+RpotfBzydfp7aKLG5H7DcVi8WDueGxoTNyGevBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T20:09:55.448028Z"},"content_sha256":"356c35aa4a2c884a5730d0b252270d0045c3efc778fbb7fead4c6531a3c5064d","schema_version":"1.0","event_id":"sha256:356c35aa4a2c884a5730d0b252270d0045c3efc778fbb7fead4c6531a3c5064d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:NKIJBRUEAFHWFX5LSAOYVP2JZJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decentralized Upper Confidence Bound Algorithms for Homogeneous Multi-Agent Multi-Armed Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Alec Koppel, Christopher S. Smith, Ethan Mulle, Ji Liu, Jingxuan Zhu","submitted_at":"2021-11-22T01:05:52Z","abstract_excerpt":"This paper studies a decentralized homogeneous multi-armed bandit problem in a multi-agent network. The problem is simultaneously solved by $N$ agents assuming they face a common set of $M$ arms and share the same arms' reward distributions. Each agent can receive information only from its neighbors, where the neighbor relationships among the agents are described by a fixed graph. Two fully decentralized upper confidence bound (UCB) algorithms are proposed for undirected graphs, respectively based on the classic algorithm and the state-of-the-art Kullback-Leibler upper confidence bound (KL-UCB"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.10933","kind":"arxiv","version":4},"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/2111.10933/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-05T09:54:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SEvRR17myYYBqsEKeWgDjVUdOrjdcb2Sjf1qUGWaG/yVYuGQEMQbY7ZaX+2hHNAX4iYa0QpCmAWYsLXu0sp2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T20:09:55.448671Z"},"content_sha256":"53c58e868a2dc2c4e66a86f118bbc25c2502a89ff580a7eb09e4fa8db5f38ea5","schema_version":"1.0","event_id":"sha256:53c58e868a2dc2c4e66a86f118bbc25c2502a89ff580a7eb09e4fa8db5f38ea5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NKIJBRUEAFHWFX5LSAOYVP2JZJ/bundle.json","state_url":"https://pith.science/pith/NKIJBRUEAFHWFX5LSAOYVP2JZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NKIJBRUEAFHWFX5LSAOYVP2JZJ/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-19T20:09:55Z","links":{"resolver":"https://pith.science/pith/NKIJBRUEAFHWFX5LSAOYVP2JZJ","bundle":"https://pith.science/pith/NKIJBRUEAFHWFX5LSAOYVP2JZJ/bundle.json","state":"https://pith.science/pith/NKIJBRUEAFHWFX5LSAOYVP2JZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NKIJBRUEAFHWFX5LSAOYVP2JZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:NKIJBRUEAFHWFX5LSAOYVP2JZJ","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":"6b4341a031e038254da69d3ea8002af1d323528f802e85bbe6a7763259d8a47d","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-22T01:05:52Z","title_canon_sha256":"08277d852226557ae7cab211b853b6c52047e2807a452dbb1a94a612dafbf824"},"schema_version":"1.0","source":{"id":"2111.10933","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.10933","created_at":"2026-07-05T09:54:41Z"},{"alias_kind":"arxiv_version","alias_value":"2111.10933v4","created_at":"2026-07-05T09:54:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.10933","created_at":"2026-07-05T09:54:41Z"},{"alias_kind":"pith_short_12","alias_value":"NKIJBRUEAFHW","created_at":"2026-07-05T09:54:41Z"},{"alias_kind":"pith_short_16","alias_value":"NKIJBRUEAFHWFX5L","created_at":"2026-07-05T09:54:41Z"},{"alias_kind":"pith_short_8","alias_value":"NKIJBRUE","created_at":"2026-07-05T09:54:41Z"}],"graph_snapshots":[{"event_id":"sha256:53c58e868a2dc2c4e66a86f118bbc25c2502a89ff580a7eb09e4fa8db5f38ea5","target":"graph","created_at":"2026-07-05T09:54:41Z","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/2111.10933/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies a decentralized homogeneous multi-armed bandit problem in a multi-agent network. The problem is simultaneously solved by $N$ agents assuming they face a common set of $M$ arms and share the same arms' reward distributions. Each agent can receive information only from its neighbors, where the neighbor relationships among the agents are described by a fixed graph. Two fully decentralized upper confidence bound (UCB) algorithms are proposed for undirected graphs, respectively based on the classic algorithm and the state-of-the-art Kullback-Leibler upper confidence bound (KL-UCB","authors_text":"Alec Koppel, Christopher S. Smith, Ethan Mulle, Ji Liu, Jingxuan Zhu","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-22T01:05:52Z","title":"Decentralized Upper Confidence Bound Algorithms for Homogeneous Multi-Agent Multi-Armed Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.10933","kind":"arxiv","version":4},"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:356c35aa4a2c884a5730d0b252270d0045c3efc778fbb7fead4c6531a3c5064d","target":"record","created_at":"2026-07-05T09:54:41Z","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":"6b4341a031e038254da69d3ea8002af1d323528f802e85bbe6a7763259d8a47d","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-22T01:05:52Z","title_canon_sha256":"08277d852226557ae7cab211b853b6c52047e2807a452dbb1a94a612dafbf824"},"schema_version":"1.0","source":{"id":"2111.10933","kind":"arxiv","version":4}},"canonical_sha256":"6a9090c684014f62dfab901d8abf49ca7b76a5c90b7faecedb4f79927f2bcf39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a9090c684014f62dfab901d8abf49ca7b76a5c90b7faecedb4f79927f2bcf39","first_computed_at":"2026-07-05T09:54:41.846192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:54:41.846192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d4/thYzBBhogb+6PotPMdBxKHNd7j96OQ9qCDh/WC2sX2dEfdVQ1kDbyt/SlgxOtiSc2KgGqVvvX/3nRxOTJAw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:54:41.846701Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.10933","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:356c35aa4a2c884a5730d0b252270d0045c3efc778fbb7fead4c6531a3c5064d","sha256:53c58e868a2dc2c4e66a86f118bbc25c2502a89ff580a7eb09e4fa8db5f38ea5"],"state_sha256":"4e4757dc0dbaafff73461a3c7cc5bd0e89d00c1e0c3be5267292a960965fb1eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2IGSqyO84X6jqzmJVeUQWNg2+y7N+yPng1WuY9ByGiL3GdPyphr8/Eq8bSEZdxhu7/5epL4Muz+WsZgWvTm1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T20:09:55.453809Z","bundle_sha256":"5ba7f4e20a110bf3ee6541285d61a82fa433edadb68ec6b3b53bf626be8763cc"}}