{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NKIJBRUEAFHWFX5LSAOYVP2JZJ","short_pith_number":"pith:NKIJBRUE","schema_version":"1.0","canonical_sha256":"6a9090c684014f62dfab901d8abf49ca7b76a5c90b7faecedb4f79927f2bcf39","source":{"kind":"arxiv","id":"2111.10933","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2111.10933","created_at":"2026-07-05T09:54:41.846262+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.10933v4","created_at":"2026-07-05T09:54:41.846262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.10933","created_at":"2026-07-05T09:54:41.846262+00:00"},{"alias_kind":"pith_short_12","alias_value":"NKIJBRUEAFHW","created_at":"2026-07-05T09:54:41.846262+00:00"},{"alias_kind":"pith_short_16","alias_value":"NKIJBRUEAFHWFX5L","created_at":"2026-07-05T09:54:41.846262+00:00"},{"alias_kind":"pith_short_8","alias_value":"NKIJBRUE","created_at":"2026-07-05T09:54:41.846262+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08003","citing_title":"Heterogeneous Multi-agent Multi-armed Bandits on Stochastic Block Models","ref_index":66,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NKIJBRUEAFHWFX5LSAOYVP2JZJ","json":"https://pith.science/pith/NKIJBRUEAFHWFX5LSAOYVP2JZJ.json","graph_json":"https://pith.science/api/pith-number/NKIJBRUEAFHWFX5LSAOYVP2JZJ/graph.json","events_json":"https://pith.science/api/pith-number/NKIJBRUEAFHWFX5LSAOYVP2JZJ/events.json","paper":"https://pith.science/paper/NKIJBRUE"},"agent_actions":{"view_html":"https://pith.science/pith/NKIJBRUEAFHWFX5LSAOYVP2JZJ","download_json":"https://pith.science/pith/NKIJBRUEAFHWFX5LSAOYVP2JZJ.json","view_paper":"https://pith.science/paper/NKIJBRUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.10933&json=true","fetch_graph":"https://pith.science/api/pith-number/NKIJBRUEAFHWFX5LSAOYVP2JZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/NKIJBRUEAFHWFX5LSAOYVP2JZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NKIJBRUEAFHWFX5LSAOYVP2JZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NKIJBRUEAFHWFX5LSAOYVP2JZJ/action/storage_attestation","attest_author":"https://pith.science/pith/NKIJBRUEAFHWFX5LSAOYVP2JZJ/action/author_attestation","sign_citation":"https://pith.science/pith/NKIJBRUEAFHWFX5LSAOYVP2JZJ/action/citation_signature","submit_replication":"https://pith.science/pith/NKIJBRUEAFHWFX5LSAOYVP2JZJ/action/replication_record"}},"created_at":"2026-07-05T09:54:41.846262+00:00","updated_at":"2026-07-05T09:54:41.846262+00:00"}