{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QX4EMMWD57QKEA3ZLJ5ACDRG3V","short_pith_number":"pith:QX4EMMWD","canonical_record":{"source":{"id":"2605.13145","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T08:10:36Z","cross_cats_sorted":[],"title_canon_sha256":"66aea708a1a3d2139e2f755160c248da0d44433ba44e897b2bdcc478d308a435","abstract_canon_sha256":"8a811d4a5c6cec83e31e2fec7dd496b58db5cf34240362f4e11fc1b85a28f0a2"},"schema_version":"1.0"},"canonical_sha256":"85f84632c3efe0a203795a7a010e26dd66135c2a3229c6fafeedb305115d3b5f","source":{"kind":"arxiv","id":"2605.13145","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13145","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13145v1","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13145","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"pith_short_12","alias_value":"QX4EMMWD57QK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"QX4EMMWD57QKEA3Z","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"QX4EMMWD","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QX4EMMWD57QKEA3ZLJ5ACDRG3V","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13145","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T08:10:36Z","cross_cats_sorted":[],"title_canon_sha256":"66aea708a1a3d2139e2f755160c248da0d44433ba44e897b2bdcc478d308a435","abstract_canon_sha256":"8a811d4a5c6cec83e31e2fec7dd496b58db5cf34240362f4e11fc1b85a28f0a2"},"schema_version":"1.0"},"canonical_sha256":"85f84632c3efe0a203795a7a010e26dd66135c2a3229c6fafeedb305115d3b5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:57.317446Z","signature_b64":"rpRoTepCuAd9vLnKRWZf6gqeNRDhMd/W2uFky8zV4HZYE5M3eOrlY1Yc3ij7D30jArsQhIRB+NPwuDbX80k8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85f84632c3efe0a203795a7a010e26dd66135c2a3229c6fafeedb305115d3b5f","last_reissued_at":"2026-05-18T03:08:57.316635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:57.316635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13145","source_version":1,"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-05-18T03:08:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3iB3OFMh4sYclMzjJN3ZE6MY/scvAKjDWUAJOJLCIzWIukEuBSLDvNp1ToQfGyQV4Ofab/3XD6wA5QRfN1slCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:30:50.960826Z"},"content_sha256":"352f6f7f7fb10d52819ea4e56d9ea1c1c67c7731a433d1bf4a45157aded7ed0d","schema_version":"1.0","event_id":"sha256:352f6f7f7fb10d52819ea4e56d9ea1c1c67c7731a433d1bf4a45157aded7ed0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QX4EMMWD57QKEA3ZLJ5ACDRG3V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Collaborating in Multi-Armed Bandits with Strategic Agents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"CAOS mechanism sustains collaboration as a Nash equilibrium in strategic multi-agent bandits via information sharing rules.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Idan Barnea, Ofir Schlisselberg, Yishay Mansour","submitted_at":"2026-05-13T08:10:36Z","abstract_excerpt":"We study collaborative learning in multi-agent Bayesian bandit problems, where strategic agents collectively solve the same bandit instance. While multiple agents can accelerate learning by sharing information, strategic agents might prefer to free-ride and avoid exploration. We consider a setting with persistent agents that participate in multiple time periods. This is in contrast to most previous works on incentives in multi-agent MAB, which assume short-lived agents, namely each agent has a single decision to make and optimizes their expected reward in that single decision. As in the multi-"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We propose CAOS, a mechanism that sustains collaboration as a Nash equilibrium while achieving strong regret guarantees.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The setting assumes persistent agents that participate across multiple time periods and that the only incentives come from information sharing rules, with agents playing according to Nash equilibrium.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"CAOS sustains collaboration as a Nash equilibrium among persistent strategic agents in Bayesian multi-armed bandits via information sharing, with strong regret guarantees.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"CAOS mechanism sustains collaboration as a Nash equilibrium in strategic multi-agent bandits via information sharing rules.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8ab49aac42b27efe0e337864ffc6dfac47ad4289a78cd1b45941291acd8a95db"},"source":{"id":"2605.13145","kind":"arxiv","version":1},"verdict":{"id":"9431827e-d239-4418-bf67-7ba6f59a3a84","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:19:18.715703Z","strongest_claim":"We propose CAOS, a mechanism that sustains collaboration as a Nash equilibrium while achieving strong regret guarantees.","one_line_summary":"CAOS sustains collaboration as a Nash equilibrium among persistent strategic agents in Bayesian multi-armed bandits via information sharing, with strong regret guarantees.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The setting assumes persistent agents that participate across multiple time periods and that the only incentives come from information sharing rules, with agents playing according to Nash equilibrium.","pith_extraction_headline":"CAOS mechanism sustains collaboration as a Nash equilibrium in strategic multi-agent bandits via information sharing rules."},"references":{"count":32,"sample":[{"doi":"","year":2002,"title":"P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. The nonstochastic multiarmed bandit problem.SIAM J. Comput., 2002","work_id":"2f51b82e-a01c-4b43-8c95-0161f6fd2752","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"K. Banihashem, N. Collina, and A. Slivkins. Bandit social learning with exploration episodes,","work_id":"69b04cb7-f640-4d16-92fb-0f51ec75307e","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"URLhttps://arxiv.org/abs/2602.05835","work_id":"72430df7-34c3-40b2-83d6-90464d7a1a59","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Y. Bar-On and Y. Mansour. Individual regret in cooperative nonstochastic multi-armed bandits. Advances in Neural Information Processing Systems, 2019","work_id":"8c5d7494-ff87-4913-ae2b-8fb028e761d4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"The Horizon Threshold in Cooperative Multi-Agent Reward-Free Exploration","work_id":"a92c1151-5181-4598-ad28-95b438219353","ref_index":5,"cited_arxiv_id":"2602.01453","is_internal_anchor":true}],"resolved_work":32,"snapshot_sha256":"692ab3246f3ecf69ea7d371b00633818e949cb250746b5aca758b4ef0a40270d","internal_anchors":2},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f9d56f2a2cc4daa7cacaf5fed3d82dc3471bbf7de049891f5aca790d22892744"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"9431827e-d239-4418-bf67-7ba6f59a3a84"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:08:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1utMhS1spjcSksMUi5j+iYXrp2mRyf8hvmjtjKhD2WjrpHmZIxetAcGaG/4g8BMvH+SwxED3qZYqoc7lt4BcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:30:50.961706Z"},"content_sha256":"924db47ef93d8e55011601d926f91b72387e0be0251ddefd27d7845483961119","schema_version":"1.0","event_id":"sha256:924db47ef93d8e55011601d926f91b72387e0be0251ddefd27d7845483961119"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QX4EMMWD57QKEA3ZLJ5ACDRG3V/bundle.json","state_url":"https://pith.science/pith/QX4EMMWD57QKEA3ZLJ5ACDRG3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QX4EMMWD57QKEA3ZLJ5ACDRG3V/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-05-27T23:30:50Z","links":{"resolver":"https://pith.science/pith/QX4EMMWD57QKEA3ZLJ5ACDRG3V","bundle":"https://pith.science/pith/QX4EMMWD57QKEA3ZLJ5ACDRG3V/bundle.json","state":"https://pith.science/pith/QX4EMMWD57QKEA3ZLJ5ACDRG3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QX4EMMWD57QKEA3ZLJ5ACDRG3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QX4EMMWD57QKEA3ZLJ5ACDRG3V","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":"8a811d4a5c6cec83e31e2fec7dd496b58db5cf34240362f4e11fc1b85a28f0a2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T08:10:36Z","title_canon_sha256":"66aea708a1a3d2139e2f755160c248da0d44433ba44e897b2bdcc478d308a435"},"schema_version":"1.0","source":{"id":"2605.13145","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13145","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13145v1","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13145","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"pith_short_12","alias_value":"QX4EMMWD57QK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"QX4EMMWD57QKEA3Z","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"QX4EMMWD","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:924db47ef93d8e55011601d926f91b72387e0be0251ddefd27d7845483961119","target":"graph","created_at":"2026-05-18T03:08:57Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We propose CAOS, a mechanism that sustains collaboration as a Nash equilibrium while achieving strong regret guarantees."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The setting assumes persistent agents that participate across multiple time periods and that the only incentives come from information sharing rules, with agents playing according to Nash equilibrium."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"CAOS sustains collaboration as a Nash equilibrium among persistent strategic agents in Bayesian multi-armed bandits via information sharing, with strong regret guarantees."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"CAOS mechanism sustains collaboration as a Nash equilibrium in strategic multi-agent bandits via information sharing rules."}],"snapshot_sha256":"8ab49aac42b27efe0e337864ffc6dfac47ad4289a78cd1b45941291acd8a95db"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f9d56f2a2cc4daa7cacaf5fed3d82dc3471bbf7de049891f5aca790d22892744"},"paper":{"abstract_excerpt":"We study collaborative learning in multi-agent Bayesian bandit problems, where strategic agents collectively solve the same bandit instance. While multiple agents can accelerate learning by sharing information, strategic agents might prefer to free-ride and avoid exploration. We consider a setting with persistent agents that participate in multiple time periods. This is in contrast to most previous works on incentives in multi-agent MAB, which assume short-lived agents, namely each agent has a single decision to make and optimizes their expected reward in that single decision. As in the multi-","authors_text":"Idan Barnea, Ofir Schlisselberg, Yishay Mansour","cross_cats":[],"headline":"CAOS mechanism sustains collaboration as a Nash equilibrium in strategic multi-agent bandits via information sharing rules.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T08:10:36Z","title":"Collaborating in Multi-Armed Bandits with Strategic Agents"},"references":{"count":32,"internal_anchors":2,"resolved_work":32,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. The nonstochastic multiarmed bandit problem.SIAM J. Comput., 2002","work_id":"2f51b82e-a01c-4b43-8c95-0161f6fd2752","year":2002},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"K. Banihashem, N. Collina, and A. Slivkins. Bandit social learning with exploration episodes,","work_id":"69b04cb7-f640-4d16-92fb-0f51ec75307e","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"URLhttps://arxiv.org/abs/2602.05835","work_id":"72430df7-34c3-40b2-83d6-90464d7a1a59","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Y. Bar-On and Y. Mansour. Individual regret in cooperative nonstochastic multi-armed bandits. Advances in Neural Information Processing Systems, 2019","work_id":"8c5d7494-ff87-4913-ae2b-8fb028e761d4","year":2019},{"cited_arxiv_id":"2602.01453","doi":"","is_internal_anchor":true,"ref_index":5,"title":"The Horizon Threshold in Cooperative Multi-Agent Reward-Free Exploration","work_id":"a92c1151-5181-4598-ad28-95b438219353","year":2026}],"snapshot_sha256":"692ab3246f3ecf69ea7d371b00633818e949cb250746b5aca758b4ef0a40270d"},"source":{"id":"2605.13145","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:19:18.715703Z","id":"9431827e-d239-4418-bf67-7ba6f59a3a84","model_set":{"reader":"grok-4.3"},"one_line_summary":"CAOS sustains collaboration as a Nash equilibrium among persistent strategic agents in Bayesian multi-armed bandits via information sharing, with strong regret guarantees.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"CAOS mechanism sustains collaboration as a Nash equilibrium in strategic multi-agent bandits via information sharing rules.","strongest_claim":"We propose CAOS, a mechanism that sustains collaboration as a Nash equilibrium while achieving strong regret guarantees.","weakest_assumption":"The setting assumes persistent agents that participate across multiple time periods and that the only incentives come from information sharing rules, with agents playing according to Nash equilibrium."}},"verdict_id":"9431827e-d239-4418-bf67-7ba6f59a3a84"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:352f6f7f7fb10d52819ea4e56d9ea1c1c67c7731a433d1bf4a45157aded7ed0d","target":"record","created_at":"2026-05-18T03:08:57Z","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":"8a811d4a5c6cec83e31e2fec7dd496b58db5cf34240362f4e11fc1b85a28f0a2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T08:10:36Z","title_canon_sha256":"66aea708a1a3d2139e2f755160c248da0d44433ba44e897b2bdcc478d308a435"},"schema_version":"1.0","source":{"id":"2605.13145","kind":"arxiv","version":1}},"canonical_sha256":"85f84632c3efe0a203795a7a010e26dd66135c2a3229c6fafeedb305115d3b5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85f84632c3efe0a203795a7a010e26dd66135c2a3229c6fafeedb305115d3b5f","first_computed_at":"2026-05-18T03:08:57.316635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:57.316635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rpRoTepCuAd9vLnKRWZf6gqeNRDhMd/W2uFky8zV4HZYE5M3eOrlY1Yc3ij7D30jArsQhIRB+NPwuDbX80k8Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:57.317446Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13145","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:352f6f7f7fb10d52819ea4e56d9ea1c1c67c7731a433d1bf4a45157aded7ed0d","sha256:924db47ef93d8e55011601d926f91b72387e0be0251ddefd27d7845483961119"],"state_sha256":"d15f063b9831524ad0f8ca60076e8020223dff7c12c2173e194a0a6cb878fa75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4nV9Brs3Z5WeWFI+hlwTdQOitXACTeAsbAElALeYvA8vhtlLscY5XBJGT56EnxuSbJuvh2PtvoxdVscw3J2RAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:30:50.966394Z","bundle_sha256":"cb58a38c7c42bbe8368a24a602d65fb2a6c08ee26b8e8481d9ee19f6514909fc"}}