{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DLYTFQ4NK47MYCNNGPFGJERTR6","short_pith_number":"pith:DLYTFQ4N","schema_version":"1.0","canonical_sha256":"1af132c38d573ecc09ad33ca6492338fab77cedc37f754a7ed7955c0cf3c6bc1","source":{"kind":"arxiv","id":"2411.13690","version":2},"attestation_state":"computed","paper":{"title":"Multi-Agent Best Arm Identification in Stochastic Linear Bandits","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Sanjana Agrawal, Sa\\'ul A. Blanco","submitted_at":"2024-11-20T20:09:44Z","abstract_excerpt":"We study the problem of collaborative best-arm identification in stochastic linear bandits under a fixed-budget scenario. In our learning model, we first consider multiple agents connected through a star network, interacting with a linear bandit instance in parallel. We then extend our analysis to arbitrary network topologies. The objective of the agents is to collaboratively identify the best arm of the given bandit instance with the help of a central server while minimizing the probability of error in best arm estimation. To this end, we propose two algorithms, MaLinBAI-Star and MaLinBAI-Gen"},"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":"2411.13690","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-20T20:09:44Z","cross_cats_sorted":[],"title_canon_sha256":"b9ced9ea09f1d0eec25a2e4bb9a457886eb04e2ec884fafefb8ce9595f98ce27","abstract_canon_sha256":"80d08d09567d08e4bb0dc8369652a07a698a4320bdc2538c4020054f92470c46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:04.260670Z","signature_b64":"vrejVMbcESF0IGNL2duUfPK2j2PJKpGag54rzJxRJ+SPg01WRjAvvRKGA42eFrTmbAftCp6zirs/lNa11wI7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1af132c38d573ecc09ad33ca6492338fab77cedc37f754a7ed7955c0cf3c6bc1","last_reissued_at":"2026-07-05T11:09:04.260143Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:04.260143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Agent Best Arm Identification in Stochastic Linear Bandits","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Sanjana Agrawal, Sa\\'ul A. Blanco","submitted_at":"2024-11-20T20:09:44Z","abstract_excerpt":"We study the problem of collaborative best-arm identification in stochastic linear bandits under a fixed-budget scenario. In our learning model, we first consider multiple agents connected through a star network, interacting with a linear bandit instance in parallel. We then extend our analysis to arbitrary network topologies. The objective of the agents is to collaboratively identify the best arm of the given bandit instance with the help of a central server while minimizing the probability of error in best arm estimation. To this end, we propose two algorithms, MaLinBAI-Star and MaLinBAI-Gen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13690","kind":"arxiv","version":2},"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/2411.13690/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":"2411.13690","created_at":"2026-07-05T11:09:04.260199+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13690v2","created_at":"2026-07-05T11:09:04.260199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13690","created_at":"2026-07-05T11:09:04.260199+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLYTFQ4NK47M","created_at":"2026-07-05T11:09:04.260199+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLYTFQ4NK47MYCNN","created_at":"2026-07-05T11:09:04.260199+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLYTFQ4N","created_at":"2026-07-05T11:09:04.260199+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/DLYTFQ4NK47MYCNNGPFGJERTR6","json":"https://pith.science/pith/DLYTFQ4NK47MYCNNGPFGJERTR6.json","graph_json":"https://pith.science/api/pith-number/DLYTFQ4NK47MYCNNGPFGJERTR6/graph.json","events_json":"https://pith.science/api/pith-number/DLYTFQ4NK47MYCNNGPFGJERTR6/events.json","paper":"https://pith.science/paper/DLYTFQ4N"},"agent_actions":{"view_html":"https://pith.science/pith/DLYTFQ4NK47MYCNNGPFGJERTR6","download_json":"https://pith.science/pith/DLYTFQ4NK47MYCNNGPFGJERTR6.json","view_paper":"https://pith.science/paper/DLYTFQ4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13690&json=true","fetch_graph":"https://pith.science/api/pith-number/DLYTFQ4NK47MYCNNGPFGJERTR6/graph.json","fetch_events":"https://pith.science/api/pith-number/DLYTFQ4NK47MYCNNGPFGJERTR6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLYTFQ4NK47MYCNNGPFGJERTR6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLYTFQ4NK47MYCNNGPFGJERTR6/action/storage_attestation","attest_author":"https://pith.science/pith/DLYTFQ4NK47MYCNNGPFGJERTR6/action/author_attestation","sign_citation":"https://pith.science/pith/DLYTFQ4NK47MYCNNGPFGJERTR6/action/citation_signature","submit_replication":"https://pith.science/pith/DLYTFQ4NK47MYCNNGPFGJERTR6/action/replication_record"}},"created_at":"2026-07-05T11:09:04.260199+00:00","updated_at":"2026-07-05T11:09:04.260199+00:00"}