{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NFTUALSLIGW5X5HJRZBTUDOTER","short_pith_number":"pith:NFTUALSL","canonical_record":{"source":{"id":"2411.08167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-12T20:20:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"16a719b1911e0e5ae8c49d6691b60aa932c5c5ed69791de809bc5ce0ba471ffa","abstract_canon_sha256":"45c6e7d70d361a206f31156ea447464238191155666a580d71b39369137a9769"},"schema_version":"1.0"},"canonical_sha256":"6967402e4b41addbf4e98e433a0dd32467573656331351a85cce9c5f207d9f3a","source":{"kind":"arxiv","id":"2411.08167","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.08167","created_at":"2026-07-05T09:34:42Z"},{"alias_kind":"arxiv_version","alias_value":"2411.08167v1","created_at":"2026-07-05T09:34:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.08167","created_at":"2026-07-05T09:34:42Z"},{"alias_kind":"pith_short_12","alias_value":"NFTUALSLIGW5","created_at":"2026-07-05T09:34:42Z"},{"alias_kind":"pith_short_16","alias_value":"NFTUALSLIGW5X5HJ","created_at":"2026-07-05T09:34:42Z"},{"alias_kind":"pith_short_8","alias_value":"NFTUALSL","created_at":"2026-07-05T09:34:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NFTUALSLIGW5X5HJRZBTUDOTER","target":"record","payload":{"canonical_record":{"source":{"id":"2411.08167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-12T20:20:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"16a719b1911e0e5ae8c49d6691b60aa932c5c5ed69791de809bc5ce0ba471ffa","abstract_canon_sha256":"45c6e7d70d361a206f31156ea447464238191155666a580d71b39369137a9769"},"schema_version":"1.0"},"canonical_sha256":"6967402e4b41addbf4e98e433a0dd32467573656331351a85cce9c5f207d9f3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:34:42.497419Z","signature_b64":"ZhcEGDvtdHYkMZ+yjZwERq8hiw56GkFQGvZ36Zhp6Ru1YQ+wsHMIhWnzbyJWzwFGJcOAIPx04RTwSMiGfB8rDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6967402e4b41addbf4e98e433a0dd32467573656331351a85cce9c5f207d9f3a","last_reissued_at":"2026-07-05T09:34:42.496974Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:34:42.496974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.08167","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-07-05T09:34:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WFF8HipdzDRkEGT5hNlxFcNXTGyCPrZ/OM9omyK8djDUaHyt15OaENDepPL3NPXdfE4aZWgIV3uXCy6s9kw6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T03:43:14.552231Z"},"content_sha256":"1b1546abfec3219d9aaa0b5f8d46b00545466e0049daa886cf30b5106a8380d3","schema_version":"1.0","event_id":"sha256:1b1546abfec3219d9aaa0b5f8d46b00545466e0049daa886cf30b5106a8380d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NFTUALSLIGW5X5HJRZBTUDOTER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Fatemeh Ghaffari, Jinhang Zuo, Mohammad Hajiesmaili, Xuchuang Wang","submitted_at":"2024-11-12T20:20:26Z","abstract_excerpt":"We study the problem of multi-agent multi-armed bandits with adversarial corruption in a heterogeneous setting, where each agent accesses a subset of arms. The adversary can corrupt the reward observations for all agents. Agents share these corrupted rewards with each other, and the objective is to maximize the cumulative total reward of all agents (and not be misled by the adversary). We propose a multi-agent cooperative learning algorithm that is robust to adversarial corruptions. For this newly devised algorithm, we demonstrate that an adversary with an unknown corruption budget $C$ only in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.08167","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/2411.08167/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:34:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jFhwL1giyE7vKSzui/rbKE5c7vVJdPS4nPjiqpvPpikig2pqflbrlLhKiuAUIRKdAa8FfzFWhYK+hj9MZaBjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T03:43:14.553217Z"},"content_sha256":"576e5c71945daba2517ac7b629e799440ea8d0a18fefb6650d151cf038d9db05","schema_version":"1.0","event_id":"sha256:576e5c71945daba2517ac7b629e799440ea8d0a18fefb6650d151cf038d9db05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NFTUALSLIGW5X5HJRZBTUDOTER/bundle.json","state_url":"https://pith.science/pith/NFTUALSLIGW5X5HJRZBTUDOTER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NFTUALSLIGW5X5HJRZBTUDOTER/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-17T03:43:14Z","links":{"resolver":"https://pith.science/pith/NFTUALSLIGW5X5HJRZBTUDOTER","bundle":"https://pith.science/pith/NFTUALSLIGW5X5HJRZBTUDOTER/bundle.json","state":"https://pith.science/pith/NFTUALSLIGW5X5HJRZBTUDOTER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NFTUALSLIGW5X5HJRZBTUDOTER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NFTUALSLIGW5X5HJRZBTUDOTER","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":"45c6e7d70d361a206f31156ea447464238191155666a580d71b39369137a9769","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-12T20:20:26Z","title_canon_sha256":"16a719b1911e0e5ae8c49d6691b60aa932c5c5ed69791de809bc5ce0ba471ffa"},"schema_version":"1.0","source":{"id":"2411.08167","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.08167","created_at":"2026-07-05T09:34:42Z"},{"alias_kind":"arxiv_version","alias_value":"2411.08167v1","created_at":"2026-07-05T09:34:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.08167","created_at":"2026-07-05T09:34:42Z"},{"alias_kind":"pith_short_12","alias_value":"NFTUALSLIGW5","created_at":"2026-07-05T09:34:42Z"},{"alias_kind":"pith_short_16","alias_value":"NFTUALSLIGW5X5HJ","created_at":"2026-07-05T09:34:42Z"},{"alias_kind":"pith_short_8","alias_value":"NFTUALSL","created_at":"2026-07-05T09:34:42Z"}],"graph_snapshots":[{"event_id":"sha256:576e5c71945daba2517ac7b629e799440ea8d0a18fefb6650d151cf038d9db05","target":"graph","created_at":"2026-07-05T09:34:42Z","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/2411.08167/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of multi-agent multi-armed bandits with adversarial corruption in a heterogeneous setting, where each agent accesses a subset of arms. The adversary can corrupt the reward observations for all agents. Agents share these corrupted rewards with each other, and the objective is to maximize the cumulative total reward of all agents (and not be misled by the adversary). We propose a multi-agent cooperative learning algorithm that is robust to adversarial corruptions. For this newly devised algorithm, we demonstrate that an adversary with an unknown corruption budget $C$ only in","authors_text":"Fatemeh Ghaffari, Jinhang Zuo, Mohammad Hajiesmaili, Xuchuang Wang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.08167","kind":"arxiv","version":1},"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:1b1546abfec3219d9aaa0b5f8d46b00545466e0049daa886cf30b5106a8380d3","target":"record","created_at":"2026-07-05T09:34:42Z","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":"45c6e7d70d361a206f31156ea447464238191155666a580d71b39369137a9769","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-12T20:20:26Z","title_canon_sha256":"16a719b1911e0e5ae8c49d6691b60aa932c5c5ed69791de809bc5ce0ba471ffa"},"schema_version":"1.0","source":{"id":"2411.08167","kind":"arxiv","version":1}},"canonical_sha256":"6967402e4b41addbf4e98e433a0dd32467573656331351a85cce9c5f207d9f3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6967402e4b41addbf4e98e433a0dd32467573656331351a85cce9c5f207d9f3a","first_computed_at":"2026-07-05T09:34:42.496974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:34:42.496974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZhcEGDvtdHYkMZ+yjZwERq8hiw56GkFQGvZ36Zhp6Ru1YQ+wsHMIhWnzbyJWzwFGJcOAIPx04RTwSMiGfB8rDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:34:42.497419Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.08167","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b1546abfec3219d9aaa0b5f8d46b00545466e0049daa886cf30b5106a8380d3","sha256:576e5c71945daba2517ac7b629e799440ea8d0a18fefb6650d151cf038d9db05"],"state_sha256":"0e8786f5a345706dab82b060edc198123206498d54d2d47639e9b227b6b32a2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IkbWDDjXvKe3D7+LJ4+lLDGc2ik3CHk9Cdt32/98w96CDgDuO/oVeNFk9RpMxbKvrPBHABPfje1EpYm1WfiYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T03:43:14.619872Z","bundle_sha256":"771e6b827e5848df8428bc37640b805da3e99548977e7da457fd1e746a76585a"}}