{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZCUN6KJEVQB7D6JPCSXMWS2AVG","short_pith_number":"pith:ZCUN6KJE","canonical_record":{"source":{"id":"1905.08731","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-21T16:22:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2d9151b249e12bf7f4ccc2f0b63b3e29e0bf3890b993857d2ba51b7169033ed8","abstract_canon_sha256":"3d964b342d9face8f126cb09e377ba04eaf530ea457989df188182ab555f9eb0"},"schema_version":"1.0"},"canonical_sha256":"c8a8df2924ac03f1f92f14aecb4b40a9b60b833eef043401a6d5ff29af7d3ffa","source":{"kind":"arxiv","id":"1905.08731","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08731","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08731v1","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08731","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZCUN6KJEVQB7","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZCUN6KJEVQB7D6JP","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZCUN6KJE","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZCUN6KJEVQB7D6JPCSXMWS2AVG","target":"record","payload":{"canonical_record":{"source":{"id":"1905.08731","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-21T16:22:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2d9151b249e12bf7f4ccc2f0b63b3e29e0bf3890b993857d2ba51b7169033ed8","abstract_canon_sha256":"3d964b342d9face8f126cb09e377ba04eaf530ea457989df188182ab555f9eb0"},"schema_version":"1.0"},"canonical_sha256":"c8a8df2924ac03f1f92f14aecb4b40a9b60b833eef043401a6d5ff29af7d3ffa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:42.247263Z","signature_b64":"KIywI08cUiKsgkbGVm1oT+jZBbheCCu1XvIoVjxDTI3/+wsauBv2PwiZdGVuwa829Q/DDW4RpbFPEi0J0DH4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8a8df2924ac03f1f92f14aecb4b40a9b60b833eef043401a6d5ff29af7d3ffa","last_reissued_at":"2026-05-17T23:45:42.246415Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:42.246415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.08731","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-17T23:45:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vg7Crv1djno+fZ5MckmW3J8zIO2SsSforbuNhxmTFtzAnp+JF020EcVR813eIVAtElLqvcdcOOsMjnAgxD3BCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:05:42.270588Z"},"content_sha256":"b11019cac44f656cc01f3dacd772f070f43af9a2accfcc6a7c3233838a688d0d","schema_version":"1.0","event_id":"sha256:b11019cac44f656cc01f3dacd772f070f43af9a2accfcc6a7c3233838a688d0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZCUN6KJEVQB7D6JPCSXMWS2AVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Heterogeneous Stochastic Interactions for Multiple Agents in a Multi-armed Bandit Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Naomi Ehrich Leonard, Udari Madhushani","submitted_at":"2019-05-21T16:22:38Z","abstract_excerpt":"We define and analyze a multi-agent multi-armed bandit problem in which decision-making agents can observe the choices and rewards of their neighbors. Neighbors are defined by a network graph with heterogeneous and stochastic interconnections. These interactions are determined by the sociability of each agent, which corresponds to the probability that the agent observes its neighbors. We design an algorithm for each agent to maximize its own expected cumulative reward and prove performance bounds that depend on the sociability of the agents and the network structure. We use the bounds to predi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08731","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":""},"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-05-17T23:45:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bTTuLWaNE5YtG0Sn7rW3ia2Emy3RB1aRiI/pDRKN5UiRnCRil5gjqQ/clrZulk2lk/KkshEbPvH2SfVJ+cgQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:05:42.271039Z"},"content_sha256":"095cac183ac7067ad87ad64a37703528c68ba335fd1522b000ef48b7b5c7fdaf","schema_version":"1.0","event_id":"sha256:095cac183ac7067ad87ad64a37703528c68ba335fd1522b000ef48b7b5c7fdaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZCUN6KJEVQB7D6JPCSXMWS2AVG/bundle.json","state_url":"https://pith.science/pith/ZCUN6KJEVQB7D6JPCSXMWS2AVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZCUN6KJEVQB7D6JPCSXMWS2AVG/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-28T21:05:42Z","links":{"resolver":"https://pith.science/pith/ZCUN6KJEVQB7D6JPCSXMWS2AVG","bundle":"https://pith.science/pith/ZCUN6KJEVQB7D6JPCSXMWS2AVG/bundle.json","state":"https://pith.science/pith/ZCUN6KJEVQB7D6JPCSXMWS2AVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZCUN6KJEVQB7D6JPCSXMWS2AVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZCUN6KJEVQB7D6JPCSXMWS2AVG","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":"3d964b342d9face8f126cb09e377ba04eaf530ea457989df188182ab555f9eb0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-21T16:22:38Z","title_canon_sha256":"2d9151b249e12bf7f4ccc2f0b63b3e29e0bf3890b993857d2ba51b7169033ed8"},"schema_version":"1.0","source":{"id":"1905.08731","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08731","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08731v1","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08731","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZCUN6KJEVQB7","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZCUN6KJEVQB7D6JP","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZCUN6KJE","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:095cac183ac7067ad87ad64a37703528c68ba335fd1522b000ef48b7b5c7fdaf","target":"graph","created_at":"2026-05-17T23:45: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"},"paper":{"abstract_excerpt":"We define and analyze a multi-agent multi-armed bandit problem in which decision-making agents can observe the choices and rewards of their neighbors. Neighbors are defined by a network graph with heterogeneous and stochastic interconnections. These interactions are determined by the sociability of each agent, which corresponds to the probability that the agent observes its neighbors. We design an algorithm for each agent to maximize its own expected cumulative reward and prove performance bounds that depend on the sociability of the agents and the network structure. We use the bounds to predi","authors_text":"Naomi Ehrich Leonard, Udari Madhushani","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-21T16:22:38Z","title":"Heterogeneous Stochastic Interactions for Multiple Agents in a Multi-armed Bandit Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08731","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:b11019cac44f656cc01f3dacd772f070f43af9a2accfcc6a7c3233838a688d0d","target":"record","created_at":"2026-05-17T23:45: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":"3d964b342d9face8f126cb09e377ba04eaf530ea457989df188182ab555f9eb0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-21T16:22:38Z","title_canon_sha256":"2d9151b249e12bf7f4ccc2f0b63b3e29e0bf3890b993857d2ba51b7169033ed8"},"schema_version":"1.0","source":{"id":"1905.08731","kind":"arxiv","version":1}},"canonical_sha256":"c8a8df2924ac03f1f92f14aecb4b40a9b60b833eef043401a6d5ff29af7d3ffa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8a8df2924ac03f1f92f14aecb4b40a9b60b833eef043401a6d5ff29af7d3ffa","first_computed_at":"2026-05-17T23:45:42.246415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:42.246415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KIywI08cUiKsgkbGVm1oT+jZBbheCCu1XvIoVjxDTI3/+wsauBv2PwiZdGVuwa829Q/DDW4RpbFPEi0J0DH4Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:42.247263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08731","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b11019cac44f656cc01f3dacd772f070f43af9a2accfcc6a7c3233838a688d0d","sha256:095cac183ac7067ad87ad64a37703528c68ba335fd1522b000ef48b7b5c7fdaf"],"state_sha256":"08a54bfe78dd8337236060a8bbf400cf1ade1a96f96249bd0f861123e5f68027"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dvt3YiKg9uIwXTYjyGZIhAJ+gCIEig3i7TKAcyjsFZZz8IbSt3o0QVdF74WZAD23hk4lBhGMoLUu9HVfVlF5CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:05:42.275061Z","bundle_sha256":"1bc3c2c1c1957d467aaa70c51e05f909f97cd5e32337c8c8ffa573438bc0ab58"}}