{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MKQZSJ7VNSIKB67MIWWGJNDBP4","short_pith_number":"pith:MKQZSJ7V","canonical_record":{"source":{"id":"1604.07706","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-26T14:59:43Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"93add5fe583d9e2f0f859b1ded29a6e216e448961a97e506df6f6ff02498124b","abstract_canon_sha256":"63659f47a4f0be211d32d45c39a389234c37aea18d4d8787ede1cc9235523045"},"schema_version":"1.0"},"canonical_sha256":"62a19927f56c90a0fbec45ac64b4617f294744c7bdab41a4125f8615ed1914fb","source":{"kind":"arxiv","id":"1604.07706","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07706","created_at":"2026-05-18T01:12:48Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07706v3","created_at":"2026-05-18T01:12:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07706","created_at":"2026-05-18T01:12:48Z"},{"alias_kind":"pith_short_12","alias_value":"MKQZSJ7VNSIK","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MKQZSJ7VNSIKB67M","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MKQZSJ7V","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MKQZSJ7VNSIKB67MIWWGJNDBP4","target":"record","payload":{"canonical_record":{"source":{"id":"1604.07706","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-26T14:59:43Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"93add5fe583d9e2f0f859b1ded29a6e216e448961a97e506df6f6ff02498124b","abstract_canon_sha256":"63659f47a4f0be211d32d45c39a389234c37aea18d4d8787ede1cc9235523045"},"schema_version":"1.0"},"canonical_sha256":"62a19927f56c90a0fbec45ac64b4617f294744c7bdab41a4125f8615ed1914fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:48.345640Z","signature_b64":"P6e4/qLYyhbrGMEP6GFqNXF32uSIrTAD3oHvxLgjp/eh+OfnH1jnmVY+YEf52mxaJWkUAJxK39uMSo+XhW3mAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62a19927f56c90a0fbec45ac64b4617f294744c7bdab41a4125f8615ed1914fb","last_reissued_at":"2026-05-18T01:12:48.345242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:48.345242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.07706","source_version":3,"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-18T01:12:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x5VVrGehNmmHNggZq28jjOFnxSVBoJm5MTkG/9QZ/beFZHRT7BvYqXKnpOVrIpTG86fKICugRNYERfTg3NM8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:00:33.661523Z"},"content_sha256":"d7c78f8860e4d6697ec1ddec9e30507c390b0dccedd775b03c4d6bf271b71c19","schema_version":"1.0","event_id":"sha256:d7c78f8860e4d6697ec1ddec9e30507c390b0dccedd775b03c4d6bf271b71c19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MKQZSJ7VNSIKB67MIWWGJNDBP4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Clustering of Linear Bandits in Peer to Peer Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Balazs Szorenyi, Nathan Korda, Shuai Li","submitted_at":"2016-04-26T14:59:43Z","abstract_excerpt":"We provide two distributed confidence ball algorithms for solving linear bandit problems in peer to peer networks with limited communication capabilities. For the first, we assume that all the peers are solving the same linear bandit problem, and prove that our algorithm achieves the optimal asymptotic regret rate of any centralised algorithm that can instantly communicate information between the peers. For the second, we assume that there are clusters of peers solving the same bandit problem within each cluster, and we prove that our algorithm discovers these clusters, while achieving the opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07706","kind":"arxiv","version":3},"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-18T01:12:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BmQB7D36pecFcByq6NZOlBxk8EK3zRro7GEeGEV3i6kl07m8fRGwYIIbrGaZf560hjyKfF9N2drQsW5dta3rDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:00:33.661890Z"},"content_sha256":"8f5bedbfee766cb5f12f7da2306bcc486c979545de215372a7e8ad62b1bef123","schema_version":"1.0","event_id":"sha256:8f5bedbfee766cb5f12f7da2306bcc486c979545de215372a7e8ad62b1bef123"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKQZSJ7VNSIKB67MIWWGJNDBP4/bundle.json","state_url":"https://pith.science/pith/MKQZSJ7VNSIKB67MIWWGJNDBP4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKQZSJ7VNSIKB67MIWWGJNDBP4/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-06-03T03:00:33Z","links":{"resolver":"https://pith.science/pith/MKQZSJ7VNSIKB67MIWWGJNDBP4","bundle":"https://pith.science/pith/MKQZSJ7VNSIKB67MIWWGJNDBP4/bundle.json","state":"https://pith.science/pith/MKQZSJ7VNSIKB67MIWWGJNDBP4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKQZSJ7VNSIKB67MIWWGJNDBP4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MKQZSJ7VNSIKB67MIWWGJNDBP4","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":"63659f47a4f0be211d32d45c39a389234c37aea18d4d8787ede1cc9235523045","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-26T14:59:43Z","title_canon_sha256":"93add5fe583d9e2f0f859b1ded29a6e216e448961a97e506df6f6ff02498124b"},"schema_version":"1.0","source":{"id":"1604.07706","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07706","created_at":"2026-05-18T01:12:48Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07706v3","created_at":"2026-05-18T01:12:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07706","created_at":"2026-05-18T01:12:48Z"},{"alias_kind":"pith_short_12","alias_value":"MKQZSJ7VNSIK","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MKQZSJ7VNSIKB67M","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MKQZSJ7V","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:8f5bedbfee766cb5f12f7da2306bcc486c979545de215372a7e8ad62b1bef123","target":"graph","created_at":"2026-05-18T01:12:48Z","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 provide two distributed confidence ball algorithms for solving linear bandit problems in peer to peer networks with limited communication capabilities. For the first, we assume that all the peers are solving the same linear bandit problem, and prove that our algorithm achieves the optimal asymptotic regret rate of any centralised algorithm that can instantly communicate information between the peers. For the second, we assume that there are clusters of peers solving the same bandit problem within each cluster, and we prove that our algorithm discovers these clusters, while achieving the opt","authors_text":"Balazs Szorenyi, Nathan Korda, Shuai Li","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-26T14:59:43Z","title":"Distributed Clustering of Linear Bandits in Peer to Peer Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07706","kind":"arxiv","version":3},"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:d7c78f8860e4d6697ec1ddec9e30507c390b0dccedd775b03c4d6bf271b71c19","target":"record","created_at":"2026-05-18T01:12:48Z","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":"63659f47a4f0be211d32d45c39a389234c37aea18d4d8787ede1cc9235523045","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-26T14:59:43Z","title_canon_sha256":"93add5fe583d9e2f0f859b1ded29a6e216e448961a97e506df6f6ff02498124b"},"schema_version":"1.0","source":{"id":"1604.07706","kind":"arxiv","version":3}},"canonical_sha256":"62a19927f56c90a0fbec45ac64b4617f294744c7bdab41a4125f8615ed1914fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62a19927f56c90a0fbec45ac64b4617f294744c7bdab41a4125f8615ed1914fb","first_computed_at":"2026-05-18T01:12:48.345242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:48.345242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P6e4/qLYyhbrGMEP6GFqNXF32uSIrTAD3oHvxLgjp/eh+OfnH1jnmVY+YEf52mxaJWkUAJxK39uMSo+XhW3mAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:48.345640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07706","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7c78f8860e4d6697ec1ddec9e30507c390b0dccedd775b03c4d6bf271b71c19","sha256:8f5bedbfee766cb5f12f7da2306bcc486c979545de215372a7e8ad62b1bef123"],"state_sha256":"1d8e2ce6f6dcfd4a7ef00793ed32a6621d9ad4426af52c1458e90d61b0272978"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O3FObblLUlLzdRJ9uig5FSOSVZCKJ9noSahGA7DZZLo8S+EgGHSujenpH9lC8tJBDOAAqhHhvozvEvU9/oHmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:00:33.663904Z","bundle_sha256":"c65f0f958596341f760af1bb37328b4ca26edecdf73fa11e42b399319695e8d3"}}