{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GALZC3LTJB6FN7DJXLEWC5VPGR","short_pith_number":"pith:GALZC3LT","canonical_record":{"source":{"id":"1802.08159","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T16:47:56Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"a10c5a66e4ff3fcd26b6aa9e193428a483f977e99b3f922343aae3c469d5e35e","abstract_canon_sha256":"30caa5f166ad807d0c6c4fe3e682b7e75a09d75ea1bab37b521e4727a6cf40b3"},"schema_version":"1.0"},"canonical_sha256":"3017916d73487c56fc69bac96176af34440f47edf1d1d1422f3d312719b8b2c3","source":{"kind":"arxiv","id":"1802.08159","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08159","created_at":"2026-05-18T00:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08159v3","created_at":"2026-05-18T00:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08159","created_at":"2026-05-18T00:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"GALZC3LTJB6F","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GALZC3LTJB6FN7DJ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GALZC3LT","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GALZC3LTJB6FN7DJXLEWC5VPGR","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08159","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T16:47:56Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"a10c5a66e4ff3fcd26b6aa9e193428a483f977e99b3f922343aae3c469d5e35e","abstract_canon_sha256":"30caa5f166ad807d0c6c4fe3e682b7e75a09d75ea1bab37b521e4727a6cf40b3"},"schema_version":"1.0"},"canonical_sha256":"3017916d73487c56fc69bac96176af34440f47edf1d1d1422f3d312719b8b2c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:09.781405Z","signature_b64":"yJnGO/VKqzQ/7J7fmH5D+bGxLuk5HJBRVtisLaiaC6q6ee0KIuO7ey3l57CBm6bAHrRaGqocnDTgIafHueaoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3017916d73487c56fc69bac96176af34440f47edf1d1d1422f3d312719b8b2c3","last_reissued_at":"2026-05-18T00:01:09.780679Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:09.780679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08159","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-18T00:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WMmJarDuZ5bd9ufHQevQqPR7V7K9wuQv1/bTIN1btZgmdfxuMpxZnLrbLSDraRvie2t5HPORA6n/M7ndMAw7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:28:35.573429Z"},"content_sha256":"99e5489108fa2cd3d7eda24699041929bfdf1c6c9356509d76c0ba27215bd9ec","schema_version":"1.0","event_id":"sha256:99e5489108fa2cd3d7eda24699041929bfdf1c6c9356509d76c0ba27215bd9ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GALZC3LTJB6FN7DJXLEWC5VPGR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Collaboratively Learning the Best Option, Using Bounded Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Lili Su, Martin Zubeldia, Nancy Lynch","submitted_at":"2018-02-22T16:47:56Z","abstract_excerpt":"We consider multi-armed bandit problems in social groups wherein each individual has bounded memory and shares the common goal of learning the best arm/option. We say an individual learns the best option if eventually (as $t \\to \\infty$) it pulls only the arm with the highest average reward. While this goal is provably impossible for an isolated individual, we show that, in social groups, this goal can be achieved easily with the aid of social persuasion, i.e., communication. Specifically, we study the learning dynamics wherein an individual sequentially decides on which arm to pull next based"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08159","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-18T00:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RkmOd6fKMWgXZukzTggh3l9TlYjxTYcFNsb+cx+e5yrb16qzDUV06J+mjim+a/d1T9kNBJqdzJTi+/yt5EnjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:28:35.573806Z"},"content_sha256":"e38019fc356f9e1add56d1d0ca0a9b96fc8f12da65535a62dd14f0799d5543c3","schema_version":"1.0","event_id":"sha256:e38019fc356f9e1add56d1d0ca0a9b96fc8f12da65535a62dd14f0799d5543c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GALZC3LTJB6FN7DJXLEWC5VPGR/bundle.json","state_url":"https://pith.science/pith/GALZC3LTJB6FN7DJXLEWC5VPGR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GALZC3LTJB6FN7DJXLEWC5VPGR/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-03T01:28:35Z","links":{"resolver":"https://pith.science/pith/GALZC3LTJB6FN7DJXLEWC5VPGR","bundle":"https://pith.science/pith/GALZC3LTJB6FN7DJXLEWC5VPGR/bundle.json","state":"https://pith.science/pith/GALZC3LTJB6FN7DJXLEWC5VPGR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GALZC3LTJB6FN7DJXLEWC5VPGR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GALZC3LTJB6FN7DJXLEWC5VPGR","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":"30caa5f166ad807d0c6c4fe3e682b7e75a09d75ea1bab37b521e4727a6cf40b3","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T16:47:56Z","title_canon_sha256":"a10c5a66e4ff3fcd26b6aa9e193428a483f977e99b3f922343aae3c469d5e35e"},"schema_version":"1.0","source":{"id":"1802.08159","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08159","created_at":"2026-05-18T00:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08159v3","created_at":"2026-05-18T00:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08159","created_at":"2026-05-18T00:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"GALZC3LTJB6F","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GALZC3LTJB6FN7DJ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GALZC3LT","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:e38019fc356f9e1add56d1d0ca0a9b96fc8f12da65535a62dd14f0799d5543c3","target":"graph","created_at":"2026-05-18T00:01:09Z","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 multi-armed bandit problems in social groups wherein each individual has bounded memory and shares the common goal of learning the best arm/option. We say an individual learns the best option if eventually (as $t \\to \\infty$) it pulls only the arm with the highest average reward. While this goal is provably impossible for an isolated individual, we show that, in social groups, this goal can be achieved easily with the aid of social persuasion, i.e., communication. Specifically, we study the learning dynamics wherein an individual sequentially decides on which arm to pull next based","authors_text":"Lili Su, Martin Zubeldia, Nancy Lynch","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T16:47:56Z","title":"Collaboratively Learning the Best Option, Using Bounded Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08159","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:99e5489108fa2cd3d7eda24699041929bfdf1c6c9356509d76c0ba27215bd9ec","target":"record","created_at":"2026-05-18T00:01:09Z","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":"30caa5f166ad807d0c6c4fe3e682b7e75a09d75ea1bab37b521e4727a6cf40b3","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T16:47:56Z","title_canon_sha256":"a10c5a66e4ff3fcd26b6aa9e193428a483f977e99b3f922343aae3c469d5e35e"},"schema_version":"1.0","source":{"id":"1802.08159","kind":"arxiv","version":3}},"canonical_sha256":"3017916d73487c56fc69bac96176af34440f47edf1d1d1422f3d312719b8b2c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3017916d73487c56fc69bac96176af34440f47edf1d1d1422f3d312719b8b2c3","first_computed_at":"2026-05-18T00:01:09.780679Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:09.780679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yJnGO/VKqzQ/7J7fmH5D+bGxLuk5HJBRVtisLaiaC6q6ee0KIuO7ey3l57CBm6bAHrRaGqocnDTgIafHueaoCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:09.781405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08159","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99e5489108fa2cd3d7eda24699041929bfdf1c6c9356509d76c0ba27215bd9ec","sha256:e38019fc356f9e1add56d1d0ca0a9b96fc8f12da65535a62dd14f0799d5543c3"],"state_sha256":"1e70363c3084d797f2bd4a106eb286beb42dd30a2bf2bf5093dbfb3807e39595"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"di6cuKxhO5gtk13jBYQlG/aD+ksCBwx8XTIdSaiqPlCGAucfbFmrdDafFioEf1s8ajcaALjUayJr2vut2f0ZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:28:35.575749Z","bundle_sha256":"0cc86d4db5e2c9c0b0f719563c3933b479f1ce3952776dea4e185582dee05431"}}