{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2PAMB6ET7OZHJFTU63H6OUS5ZR","short_pith_number":"pith:2PAMB6ET","canonical_record":{"source":{"id":"1611.05724","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-17T14:59:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5f82d7911d9f88517fdaccf22ca236b10519fd1abd9f01d789308af65c674be5","abstract_canon_sha256":"f61e9b31a94ce2d599cd6ee44ef7a19219370fc6365fd95d42854554e02ab0db"},"schema_version":"1.0"},"canonical_sha256":"d3c0c0f893fbb2749674f6cfe7525dcc731ba397f1da2c9311c8e683e9f0bf31","source":{"kind":"arxiv","id":"1611.05724","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05724","created_at":"2026-05-18T00:57:25Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05724v2","created_at":"2026-05-18T00:57:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05724","created_at":"2026-05-18T00:57:25Z"},{"alias_kind":"pith_short_12","alias_value":"2PAMB6ET7OZH","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2PAMB6ET7OZHJFTU","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2PAMB6ET","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2PAMB6ET7OZHJFTU63H6OUS5ZR","target":"record","payload":{"canonical_record":{"source":{"id":"1611.05724","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-17T14:59:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5f82d7911d9f88517fdaccf22ca236b10519fd1abd9f01d789308af65c674be5","abstract_canon_sha256":"f61e9b31a94ce2d599cd6ee44ef7a19219370fc6365fd95d42854554e02ab0db"},"schema_version":"1.0"},"canonical_sha256":"d3c0c0f893fbb2749674f6cfe7525dcc731ba397f1da2c9311c8e683e9f0bf31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:25.156351Z","signature_b64":"MtlCGUlQ8wjN1SHeIYBkjy1tjukECHjM9pMcLiKRovpia+hEKUdU90vWL2D9+S0cQqaKIRL1LwlukPmNpuOEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3c0c0f893fbb2749674f6cfe7525dcc731ba397f1da2c9311c8e683e9f0bf31","last_reissued_at":"2026-05-18T00:57:25.155802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:25.155802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.05724","source_version":2,"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:57:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yUbIXWFAwr2WycYzf/Vwea93c1k6yLHSaGSxs49wntFsqlkVaA07veDh5K2SnACO6TbhpIBMP1pJVHfqUd28DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:43:56.229830Z"},"content_sha256":"c31fb50ba3646bf3b28800ecbeff9fb71738adbd98e94e11a8865caa1134ddd7","schema_version":"1.0","event_id":"sha256:c31fb50ba3646bf3b28800ecbeff9fb71738adbd98e94e11a8865caa1134ddd7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2PAMB6ET7OZHJFTU63H6OUS5ZR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unimodal Thompson Sampling for Graph-Structured Arms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Francesco Trov\\`o, Marcello Restelli, Nicola Gatti, Stefano Paladino","submitted_at":"2016-11-17T14:59:55Z","abstract_excerpt":"We study, to the best of our knowledge, the first Bayesian algorithm for unimodal Multi-Armed Bandit (MAB) problems with graph structure. In this setting, each arm corresponds to a node of a graph and each edge provides a relationship, unknown to the learner, between two nodes in terms of expected reward. Furthermore, for any node of the graph there is a path leading to the unique node providing the maximum expected reward, along which the expected reward is monotonically increasing. Previous results on this setting describe the behavior of frequentist MAB algorithms. In our paper, we design a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05724","kind":"arxiv","version":2},"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:57:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A2T2qRFiKhY4xzPGklFbfdrBKrIPGfsvpQqTzmCA9J3Oj03VipVm0lVkNQaNZgU7CccboRg0lxS1de3yqXjaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:43:56.230193Z"},"content_sha256":"600954c553d2fffb1c44f6c483bd9865552d06af1ec7bb449625e3a1d541c54a","schema_version":"1.0","event_id":"sha256:600954c553d2fffb1c44f6c483bd9865552d06af1ec7bb449625e3a1d541c54a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PAMB6ET7OZHJFTU63H6OUS5ZR/bundle.json","state_url":"https://pith.science/pith/2PAMB6ET7OZHJFTU63H6OUS5ZR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PAMB6ET7OZHJFTU63H6OUS5ZR/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-28T18:43:56Z","links":{"resolver":"https://pith.science/pith/2PAMB6ET7OZHJFTU63H6OUS5ZR","bundle":"https://pith.science/pith/2PAMB6ET7OZHJFTU63H6OUS5ZR/bundle.json","state":"https://pith.science/pith/2PAMB6ET7OZHJFTU63H6OUS5ZR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PAMB6ET7OZHJFTU63H6OUS5ZR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2PAMB6ET7OZHJFTU63H6OUS5ZR","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":"f61e9b31a94ce2d599cd6ee44ef7a19219370fc6365fd95d42854554e02ab0db","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-17T14:59:55Z","title_canon_sha256":"5f82d7911d9f88517fdaccf22ca236b10519fd1abd9f01d789308af65c674be5"},"schema_version":"1.0","source":{"id":"1611.05724","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05724","created_at":"2026-05-18T00:57:25Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05724v2","created_at":"2026-05-18T00:57:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05724","created_at":"2026-05-18T00:57:25Z"},{"alias_kind":"pith_short_12","alias_value":"2PAMB6ET7OZH","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2PAMB6ET7OZHJFTU","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2PAMB6ET","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:600954c553d2fffb1c44f6c483bd9865552d06af1ec7bb449625e3a1d541c54a","target":"graph","created_at":"2026-05-18T00:57:25Z","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 study, to the best of our knowledge, the first Bayesian algorithm for unimodal Multi-Armed Bandit (MAB) problems with graph structure. In this setting, each arm corresponds to a node of a graph and each edge provides a relationship, unknown to the learner, between two nodes in terms of expected reward. Furthermore, for any node of the graph there is a path leading to the unique node providing the maximum expected reward, along which the expected reward is monotonically increasing. Previous results on this setting describe the behavior of frequentist MAB algorithms. In our paper, we design a","authors_text":"Francesco Trov\\`o, Marcello Restelli, Nicola Gatti, Stefano Paladino","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-17T14:59:55Z","title":"Unimodal Thompson Sampling for Graph-Structured Arms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05724","kind":"arxiv","version":2},"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:c31fb50ba3646bf3b28800ecbeff9fb71738adbd98e94e11a8865caa1134ddd7","target":"record","created_at":"2026-05-18T00:57:25Z","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":"f61e9b31a94ce2d599cd6ee44ef7a19219370fc6365fd95d42854554e02ab0db","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-17T14:59:55Z","title_canon_sha256":"5f82d7911d9f88517fdaccf22ca236b10519fd1abd9f01d789308af65c674be5"},"schema_version":"1.0","source":{"id":"1611.05724","kind":"arxiv","version":2}},"canonical_sha256":"d3c0c0f893fbb2749674f6cfe7525dcc731ba397f1da2c9311c8e683e9f0bf31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3c0c0f893fbb2749674f6cfe7525dcc731ba397f1da2c9311c8e683e9f0bf31","first_computed_at":"2026-05-18T00:57:25.155802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:25.155802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MtlCGUlQ8wjN1SHeIYBkjy1tjukECHjM9pMcLiKRovpia+hEKUdU90vWL2D9+S0cQqaKIRL1LwlukPmNpuOEBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:25.156351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.05724","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c31fb50ba3646bf3b28800ecbeff9fb71738adbd98e94e11a8865caa1134ddd7","sha256:600954c553d2fffb1c44f6c483bd9865552d06af1ec7bb449625e3a1d541c54a"],"state_sha256":"f8f58a2d6f9156fe6efe432f891e72b6dd6351a28fc30c5c87ed8dfafcb83907"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1vmu+W9LaVa1Go9hiWSfAliNpwEJ+RKEu4v768d8sk+YLG4/l7ZAZ1kAswlme7payBHgFNSkDkVg5bZjU3MYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:43:56.232442Z","bundle_sha256":"aed2c225e6b58e106ee23682038ec5cfc95891ce8acf53bd15012bc3a3980024"}}