{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZXNAKONAR6LXXSJVUE3HVIB4SA","short_pith_number":"pith:ZXNAKONA","canonical_record":{"source":{"id":"1712.00656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-02T18:58:04Z","cross_cats_sorted":[],"title_canon_sha256":"0fb83652373e82cbc9bc2e8f8a3b43c7e58ed49e8e6407c263b3163334180a33","abstract_canon_sha256":"8356cc70b3deaf2d58f45d926a45b3bf4b66ee3a0bb5efbbdc509ae249a0f384"},"schema_version":"1.0"},"canonical_sha256":"cdda0539a08f977bc935a1367aa03c903ef7f9770af21a7f0473997118f39ee9","source":{"kind":"arxiv","id":"1712.00656","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00656","created_at":"2026-05-18T00:29:02Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00656v1","created_at":"2026-05-18T00:29:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00656","created_at":"2026-05-18T00:29:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZXNAKONAR6LX","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZXNAKONAR6LXXSJV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZXNAKONA","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZXNAKONAR6LXXSJVUE3HVIB4SA","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-02T18:58:04Z","cross_cats_sorted":[],"title_canon_sha256":"0fb83652373e82cbc9bc2e8f8a3b43c7e58ed49e8e6407c263b3163334180a33","abstract_canon_sha256":"8356cc70b3deaf2d58f45d926a45b3bf4b66ee3a0bb5efbbdc509ae249a0f384"},"schema_version":"1.0"},"canonical_sha256":"cdda0539a08f977bc935a1367aa03c903ef7f9770af21a7f0473997118f39ee9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:02.282227Z","signature_b64":"UbCurrbq3BVBke7A2bvwMkRvaYtJOU/byOtsSyBBRkYrUKna7s9eDjglXymN9h7kB6o+7gU31R/BYeryBmUjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdda0539a08f977bc935a1367aa03c903ef7f9770af21a7f0473997118f39ee9","last_reissued_at":"2026-05-18T00:29:02.281629Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:02.281629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00656","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-18T00:29:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1nOtU4CoXfqbturk0BbBFBXvYwyMzOX8/xOX/IzL5P87+QUOWY2b0d2ndp5Pwdjw4ngDHDzYvGn80fWS1Ds5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:17:39.722108Z"},"content_sha256":"23dc32e3138e6b9128ca8eb821e5d1024f5442a7270d744c799315f62eb8edcb","schema_version":"1.0","event_id":"sha256:23dc32e3138e6b9128ca8eb821e5d1024f5442a7270d744c799315f62eb8edcb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZXNAKONAR6LXXSJVUE3HVIB4SA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Asymptotically Optimal Algorithm for Communicating Multiplayer Multi-Armed Bandit Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alper Kose, Hakan Gokcesu, Noyan Evirgen","submitted_at":"2017-12-02T18:58:04Z","abstract_excerpt":"We consider a decentralized stochastic multi-armed bandit problem with multiple players. Each player aims to maximize his/her own reward by pulling an arm. The arms give rewards based on i.i.d. stochastic Bernoulli distributions. Players are not aware about the probability distributions of the arms. At the end of each turn, the players inform their neighbors about the arm he/she pulled and the reward he/she got. Neighbors of players are determined according to an Erd{\\H{o}}s-R{\\'e}nyi graph with connectivity $\\alpha$. This graph is reproduced in the beginning of every turn with the same connec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00656","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-18T00:29:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lypFyZldPM90bkiDno7sjMFwrD6Ui4GdliofbvRc63rO9XBFA5Ky3oY83kYwq0YAlViiIFwylvBiPPj/z+pMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:17:39.722719Z"},"content_sha256":"043932e93f14813b61e8ae9ea10394f7c13addbd253a4ea0c91d75b1ad4f1fc1","schema_version":"1.0","event_id":"sha256:043932e93f14813b61e8ae9ea10394f7c13addbd253a4ea0c91d75b1ad4f1fc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXNAKONAR6LXXSJVUE3HVIB4SA/bundle.json","state_url":"https://pith.science/pith/ZXNAKONAR6LXXSJVUE3HVIB4SA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXNAKONAR6LXXSJVUE3HVIB4SA/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-26T11:17:39Z","links":{"resolver":"https://pith.science/pith/ZXNAKONAR6LXXSJVUE3HVIB4SA","bundle":"https://pith.science/pith/ZXNAKONAR6LXXSJVUE3HVIB4SA/bundle.json","state":"https://pith.science/pith/ZXNAKONAR6LXXSJVUE3HVIB4SA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXNAKONAR6LXXSJVUE3HVIB4SA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZXNAKONAR6LXXSJVUE3HVIB4SA","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":"8356cc70b3deaf2d58f45d926a45b3bf4b66ee3a0bb5efbbdc509ae249a0f384","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-02T18:58:04Z","title_canon_sha256":"0fb83652373e82cbc9bc2e8f8a3b43c7e58ed49e8e6407c263b3163334180a33"},"schema_version":"1.0","source":{"id":"1712.00656","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00656","created_at":"2026-05-18T00:29:02Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00656v1","created_at":"2026-05-18T00:29:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00656","created_at":"2026-05-18T00:29:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZXNAKONAR6LX","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZXNAKONAR6LXXSJV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZXNAKONA","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:043932e93f14813b61e8ae9ea10394f7c13addbd253a4ea0c91d75b1ad4f1fc1","target":"graph","created_at":"2026-05-18T00:29:02Z","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 consider a decentralized stochastic multi-armed bandit problem with multiple players. Each player aims to maximize his/her own reward by pulling an arm. The arms give rewards based on i.i.d. stochastic Bernoulli distributions. Players are not aware about the probability distributions of the arms. At the end of each turn, the players inform their neighbors about the arm he/she pulled and the reward he/she got. Neighbors of players are determined according to an Erd{\\H{o}}s-R{\\'e}nyi graph with connectivity $\\alpha$. This graph is reproduced in the beginning of every turn with the same connec","authors_text":"Alper Kose, Hakan Gokcesu, Noyan Evirgen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-02T18:58:04Z","title":"An Asymptotically Optimal Algorithm for Communicating Multiplayer Multi-Armed Bandit Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00656","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:23dc32e3138e6b9128ca8eb821e5d1024f5442a7270d744c799315f62eb8edcb","target":"record","created_at":"2026-05-18T00:29:02Z","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":"8356cc70b3deaf2d58f45d926a45b3bf4b66ee3a0bb5efbbdc509ae249a0f384","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-02T18:58:04Z","title_canon_sha256":"0fb83652373e82cbc9bc2e8f8a3b43c7e58ed49e8e6407c263b3163334180a33"},"schema_version":"1.0","source":{"id":"1712.00656","kind":"arxiv","version":1}},"canonical_sha256":"cdda0539a08f977bc935a1367aa03c903ef7f9770af21a7f0473997118f39ee9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdda0539a08f977bc935a1367aa03c903ef7f9770af21a7f0473997118f39ee9","first_computed_at":"2026-05-18T00:29:02.281629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:02.281629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UbCurrbq3BVBke7A2bvwMkRvaYtJOU/byOtsSyBBRkYrUKna7s9eDjglXymN9h7kB6o+7gU31R/BYeryBmUjAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:02.282227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00656","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23dc32e3138e6b9128ca8eb821e5d1024f5442a7270d744c799315f62eb8edcb","sha256:043932e93f14813b61e8ae9ea10394f7c13addbd253a4ea0c91d75b1ad4f1fc1"],"state_sha256":"34639aeb83d339503f5330597280d15671a1e61202e195e787f40feb98262dd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mh3i0cx1FBwRG0QkruZEK83Iv6EQY2jsXDkIexGh8aLYLWVun2JSFOB0C6b7IY/KPgaAmR3hKtQ1ZCihbJBMBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:17:39.725985Z","bundle_sha256":"84fb1eb5f122ca1f10354394378cd8fe38d0988d8abec96b6f57916c65d10e31"}}