{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:M3GIEDJXHD7RNXQCXHU2LFFKJ2","short_pith_number":"pith:M3GIEDJX","schema_version":"1.0","canonical_sha256":"66cc820d3738ff16de02b9e9a594aa4e963105794a743c8577f0e772108f93a2","source":{"kind":"arxiv","id":"2505.10147","version":1},"attestation_state":"computed","paper":{"title":"Near Optimal Best Arm Identification for Clustered Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.LG","authors_text":"Avishek Ghosh, Nikhil Karamchandani, Yash","submitted_at":"2025-05-15T10:20:26Z","abstract_excerpt":"This work investigates the problem of best arm identification for multi-agent multi-armed bandits. We consider $N$ agents grouped into $M$ clusters, where each cluster solves a stochastic bandit problem. The mapping between agents and bandits is a priori unknown. Each bandit is associated with $K$ arms, and the goal is to identify the best arm for each agent under a $\\delta$-probably correct ($\\delta$-PC) framework, while minimizing sample complexity and communication overhead.\n  We propose two novel algorithms: Clustering then Best Arm Identification (Cl-BAI) and Best Arm Identification then "},"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":"2505.10147","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-15T10:20:26Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"75854a3456593fb432b0892deb07697077f3ff2fe0f56f00c61a62b1d8abfe3f","abstract_canon_sha256":"8d0d990e2a2a94b6dc8312078283fcf30fd231f96484bbe44048d00ec6ff8df4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:34.194571Z","signature_b64":"7In7yBIQ/km3nufFWLByPoSKuTaUNo62um+UdHbMUEbUaTGwLLQRBATfoAk8OugW3JdEf2enzbm4CVkQqB/GDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66cc820d3738ff16de02b9e9a594aa4e963105794a743c8577f0e772108f93a2","last_reissued_at":"2026-07-05T11:03:34.193801Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:34.193801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near Optimal Best Arm Identification for Clustered Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.LG","authors_text":"Avishek Ghosh, Nikhil Karamchandani, Yash","submitted_at":"2025-05-15T10:20:26Z","abstract_excerpt":"This work investigates the problem of best arm identification for multi-agent multi-armed bandits. We consider $N$ agents grouped into $M$ clusters, where each cluster solves a stochastic bandit problem. The mapping between agents and bandits is a priori unknown. Each bandit is associated with $K$ arms, and the goal is to identify the best arm for each agent under a $\\delta$-probably correct ($\\delta$-PC) framework, while minimizing sample complexity and communication overhead.\n  We propose two novel algorithms: Clustering then Best Arm Identification (Cl-BAI) and Best Arm Identification then "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.10147","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/2505.10147/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":"2505.10147","created_at":"2026-07-05T11:03:34.193907+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.10147v1","created_at":"2026-07-05T11:03:34.193907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.10147","created_at":"2026-07-05T11:03:34.193907+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3GIEDJXHD7R","created_at":"2026-07-05T11:03:34.193907+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3GIEDJXHD7RNXQC","created_at":"2026-07-05T11:03:34.193907+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3GIEDJX","created_at":"2026-07-05T11:03:34.193907+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M3GIEDJXHD7RNXQCXHU2LFFKJ2","json":"https://pith.science/pith/M3GIEDJXHD7RNXQCXHU2LFFKJ2.json","graph_json":"https://pith.science/api/pith-number/M3GIEDJXHD7RNXQCXHU2LFFKJ2/graph.json","events_json":"https://pith.science/api/pith-number/M3GIEDJXHD7RNXQCXHU2LFFKJ2/events.json","paper":"https://pith.science/paper/M3GIEDJX"},"agent_actions":{"view_html":"https://pith.science/pith/M3GIEDJXHD7RNXQCXHU2LFFKJ2","download_json":"https://pith.science/pith/M3GIEDJXHD7RNXQCXHU2LFFKJ2.json","view_paper":"https://pith.science/paper/M3GIEDJX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.10147&json=true","fetch_graph":"https://pith.science/api/pith-number/M3GIEDJXHD7RNXQCXHU2LFFKJ2/graph.json","fetch_events":"https://pith.science/api/pith-number/M3GIEDJXHD7RNXQCXHU2LFFKJ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3GIEDJXHD7RNXQCXHU2LFFKJ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3GIEDJXHD7RNXQCXHU2LFFKJ2/action/storage_attestation","attest_author":"https://pith.science/pith/M3GIEDJXHD7RNXQCXHU2LFFKJ2/action/author_attestation","sign_citation":"https://pith.science/pith/M3GIEDJXHD7RNXQCXHU2LFFKJ2/action/citation_signature","submit_replication":"https://pith.science/pith/M3GIEDJXHD7RNXQCXHU2LFFKJ2/action/replication_record"}},"created_at":"2026-07-05T11:03:34.193907+00:00","updated_at":"2026-07-05T11:03:34.193907+00:00"}