{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y2AZAOP6GEDB5VUWGTCKEBU7VR","short_pith_number":"pith:Y2AZAOP6","canonical_record":{"source":{"id":"1811.03968","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-08T03:59:55Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"3e983aad96bf876c923bf3f2c605249866e3d1fc349dd659d8e18f171c89c22c","abstract_canon_sha256":"302db3bdb310734562f6807851fa72a8d378bb6273298eb4f072252602e03800"},"schema_version":"1.0"},"canonical_sha256":"c6819039fe31061ed69634c4a2069fac7afe7ac0aa0dec08866db037dedcbea8","source":{"kind":"arxiv","id":"1811.03968","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03968","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03968v3","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03968","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"pith_short_12","alias_value":"Y2AZAOP6GEDB","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y2AZAOP6GEDB5VUW","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y2AZAOP6","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y2AZAOP6GEDB5VUWGTCKEBU7VR","target":"record","payload":{"canonical_record":{"source":{"id":"1811.03968","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-08T03:59:55Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"3e983aad96bf876c923bf3f2c605249866e3d1fc349dd659d8e18f171c89c22c","abstract_canon_sha256":"302db3bdb310734562f6807851fa72a8d378bb6273298eb4f072252602e03800"},"schema_version":"1.0"},"canonical_sha256":"c6819039fe31061ed69634c4a2069fac7afe7ac0aa0dec08866db037dedcbea8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:30.883768Z","signature_b64":"F/Kikh7QAv4eKEYeeydEtSpj4t40noLXLcVnjljuwe0WuZQ8svsOdv8G+vv6E7qu3mKx6BQgABbpx2zTX+YHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6819039fe31061ed69634c4a2069fac7afe7ac0aa0dec08866db037dedcbea8","last_reissued_at":"2026-05-17T23:57:30.883183Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:30.883183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.03968","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-17T23:57:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vwqq9/Natur4Q7FudJZ7u5ewtfr3dI7klDGtWSKQ4NY1xjKkDCorgJQDjehwMk4hgfKfn86b0wy1DUqZeTY5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:54:45.832037Z"},"content_sha256":"d1d58864af8125db95d172f0fff3e7cafe73070d4c5c39615de6f8fd5478d04b","schema_version":"1.0","event_id":"sha256:d1d58864af8125db95d172f0fff3e7cafe73070d4c5c39615de6f8fd5478d04b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y2AZAOP6GEDB5VUWGTCKEBU7VR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Collaboratively Learning the Best Option on Graphs, Using Bounded Local Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Lili Su, Martin Zubeldia, Nancy Lynch","submitted_at":"2018-11-08T03:59:55Z","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 expected reward. While this goal is provably impossible for an isolated individual due to bounded memory, we show that, in social groups, this goal can be achieved easily with the aid of social persuasion (i.e., communication) as long as the communication networks/graphs satisfy some mild conditions. To deal with the inter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03968","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-17T23:57:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aOt+Vk/MuI3zyIKGO4DVkXIPJ+OPrW/Colcx3RAUZxDsXzUQWUrbZGytMyayUGNJMTi4aPChc4k156enWJoZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:54:45.832409Z"},"content_sha256":"23360f3e5461e86f21e2f40def15497cc6b792745f7f685886b19972a1d8216a","schema_version":"1.0","event_id":"sha256:23360f3e5461e86f21e2f40def15497cc6b792745f7f685886b19972a1d8216a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2AZAOP6GEDB5VUWGTCKEBU7VR/bundle.json","state_url":"https://pith.science/pith/Y2AZAOP6GEDB5VUWGTCKEBU7VR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2AZAOP6GEDB5VUWGTCKEBU7VR/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-03T08:54:45Z","links":{"resolver":"https://pith.science/pith/Y2AZAOP6GEDB5VUWGTCKEBU7VR","bundle":"https://pith.science/pith/Y2AZAOP6GEDB5VUWGTCKEBU7VR/bundle.json","state":"https://pith.science/pith/Y2AZAOP6GEDB5VUWGTCKEBU7VR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2AZAOP6GEDB5VUWGTCKEBU7VR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y2AZAOP6GEDB5VUWGTCKEBU7VR","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":"302db3bdb310734562f6807851fa72a8d378bb6273298eb4f072252602e03800","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-08T03:59:55Z","title_canon_sha256":"3e983aad96bf876c923bf3f2c605249866e3d1fc349dd659d8e18f171c89c22c"},"schema_version":"1.0","source":{"id":"1811.03968","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03968","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03968v3","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03968","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"pith_short_12","alias_value":"Y2AZAOP6GEDB","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y2AZAOP6GEDB5VUW","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y2AZAOP6","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:23360f3e5461e86f21e2f40def15497cc6b792745f7f685886b19972a1d8216a","target":"graph","created_at":"2026-05-17T23:57:30Z","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 expected reward. While this goal is provably impossible for an isolated individual due to bounded memory, we show that, in social groups, this goal can be achieved easily with the aid of social persuasion (i.e., communication) as long as the communication networks/graphs satisfy some mild conditions. To deal with the inter","authors_text":"Lili Su, Martin Zubeldia, Nancy Lynch","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-08T03:59:55Z","title":"Collaboratively Learning the Best Option on Graphs, Using Bounded Local Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03968","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:d1d58864af8125db95d172f0fff3e7cafe73070d4c5c39615de6f8fd5478d04b","target":"record","created_at":"2026-05-17T23:57:30Z","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":"302db3bdb310734562f6807851fa72a8d378bb6273298eb4f072252602e03800","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-08T03:59:55Z","title_canon_sha256":"3e983aad96bf876c923bf3f2c605249866e3d1fc349dd659d8e18f171c89c22c"},"schema_version":"1.0","source":{"id":"1811.03968","kind":"arxiv","version":3}},"canonical_sha256":"c6819039fe31061ed69634c4a2069fac7afe7ac0aa0dec08866db037dedcbea8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6819039fe31061ed69634c4a2069fac7afe7ac0aa0dec08866db037dedcbea8","first_computed_at":"2026-05-17T23:57:30.883183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:30.883183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F/Kikh7QAv4eKEYeeydEtSpj4t40noLXLcVnjljuwe0WuZQ8svsOdv8G+vv6E7qu3mKx6BQgABbpx2zTX+YHAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:30.883768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03968","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1d58864af8125db95d172f0fff3e7cafe73070d4c5c39615de6f8fd5478d04b","sha256:23360f3e5461e86f21e2f40def15497cc6b792745f7f685886b19972a1d8216a"],"state_sha256":"88ecd8de43be2cbcd2806dcee71eb6ab2e6355d558476143794151c06e654111"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vUBb8NpibjL3xmJajHam59u0sdYqJUkBo/9V/+gdEU0A/0YLs9/G1CjNJCJg5NLGxq2lM52XqIBBCp66pm9zAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:54:45.834417Z","bundle_sha256":"b743965f3adceb2e0870f59828b8c24c6d2a32055d6c105815ea514e3dec1595"}}