{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JIV6P2HMW47D6L2FM57G24ZHBX","short_pith_number":"pith:JIV6P2HM","canonical_record":{"source":{"id":"1109.2296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-11T09:00:53Z","cross_cats_sorted":[],"title_canon_sha256":"2f46c5fc28ee338806531a6e77985447ca9148b61222a43a095ff6e707bedce6","abstract_canon_sha256":"4bdfb555cea609320200433316d4d3e56590f88137b72ffd62c29cbdcfbfb1dd"},"schema_version":"1.0"},"canonical_sha256":"4a2be7e8ecb73e3f2f45677e6d73270dce03f1c18b17a3be9f15299a35a1c652","source":{"kind":"arxiv","id":"1109.2296","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2296","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2296v1","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2296","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"JIV6P2HMW47D","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JIV6P2HMW47D6L2F","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JIV6P2HM","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JIV6P2HMW47D6L2FM57G24ZHBX","target":"record","payload":{"canonical_record":{"source":{"id":"1109.2296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-11T09:00:53Z","cross_cats_sorted":[],"title_canon_sha256":"2f46c5fc28ee338806531a6e77985447ca9148b61222a43a095ff6e707bedce6","abstract_canon_sha256":"4bdfb555cea609320200433316d4d3e56590f88137b72ffd62c29cbdcfbfb1dd"},"schema_version":"1.0"},"canonical_sha256":"4a2be7e8ecb73e3f2f45677e6d73270dce03f1c18b17a3be9f15299a35a1c652","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:38.049044Z","signature_b64":"qMKMY11LmKhsjZuUkuw9Qt4OnloZm0fVkfOAAgnTkyC3iwF/OG5s0SBwPbACVPIGA1g/ER5uBd5wK+5nf9pcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a2be7e8ecb73e3f2f45677e6d73270dce03f1c18b17a3be9f15299a35a1c652","last_reissued_at":"2026-05-18T04:13:38.048465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:38.048465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.2296","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-18T04:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7H6Q+PqvMn530xra34YXwyOUgAqxQk0me04wVeFwM9Vvqau7vdaYByEezxS9Ze/0yp+jZfZkkzwEg7hfgXvZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:34:46.007752Z"},"content_sha256":"887c7be2f31b62cb9901bb8a94dc679949374f46d54a12b9bc367c54037f1497","schema_version":"1.0","event_id":"sha256:887c7be2f31b62cb9901bb8a94dc679949374f46d54a12b9bc367c54037f1497"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JIV6P2HMW47D6L2FM57G24ZHBX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bandits with an Edge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Claudio Gentile, Dotan Di Castro, Shie Mannor","submitted_at":"2011-09-11T09:00:53Z","abstract_excerpt":"We consider a bandit problem over a graph where the rewards are not directly observed. Instead, the decision maker can compare two nodes and receive (stochastic) information pertaining to the difference in their value. The graph structure describes the set of possible comparisons. Consequently, comparing between two nodes that are relatively far requires estimating the difference between every pair of nodes on the path between them. We analyze this problem from the perspective of sample complexity: How many queries are needed to find an approximately optimal node with probability more than $1-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2296","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-18T04:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kSoFlmxGN5QYsxa/QJ1/kWhwmt6GVcaYYJfOwf2HihkgT6tEy9XmibaxuvaXJd0/TwnqgYLbC1MiCZUSO/6xDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:34:46.008519Z"},"content_sha256":"6f22dc4ccdfa9a164ee95ff6fdb3089fe7a3f48337db06b22e77596314a9ebad","schema_version":"1.0","event_id":"sha256:6f22dc4ccdfa9a164ee95ff6fdb3089fe7a3f48337db06b22e77596314a9ebad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JIV6P2HMW47D6L2FM57G24ZHBX/bundle.json","state_url":"https://pith.science/pith/JIV6P2HMW47D6L2FM57G24ZHBX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JIV6P2HMW47D6L2FM57G24ZHBX/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-31T07:34:46Z","links":{"resolver":"https://pith.science/pith/JIV6P2HMW47D6L2FM57G24ZHBX","bundle":"https://pith.science/pith/JIV6P2HMW47D6L2FM57G24ZHBX/bundle.json","state":"https://pith.science/pith/JIV6P2HMW47D6L2FM57G24ZHBX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JIV6P2HMW47D6L2FM57G24ZHBX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JIV6P2HMW47D6L2FM57G24ZHBX","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":"4bdfb555cea609320200433316d4d3e56590f88137b72ffd62c29cbdcfbfb1dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-11T09:00:53Z","title_canon_sha256":"2f46c5fc28ee338806531a6e77985447ca9148b61222a43a095ff6e707bedce6"},"schema_version":"1.0","source":{"id":"1109.2296","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2296","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2296v1","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2296","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"JIV6P2HMW47D","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JIV6P2HMW47D6L2F","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JIV6P2HM","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:6f22dc4ccdfa9a164ee95ff6fdb3089fe7a3f48337db06b22e77596314a9ebad","target":"graph","created_at":"2026-05-18T04:13:38Z","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 bandit problem over a graph where the rewards are not directly observed. Instead, the decision maker can compare two nodes and receive (stochastic) information pertaining to the difference in their value. The graph structure describes the set of possible comparisons. Consequently, comparing between two nodes that are relatively far requires estimating the difference between every pair of nodes on the path between them. We analyze this problem from the perspective of sample complexity: How many queries are needed to find an approximately optimal node with probability more than $1-","authors_text":"Claudio Gentile, Dotan Di Castro, Shie Mannor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-11T09:00:53Z","title":"Bandits with an Edge"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2296","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:887c7be2f31b62cb9901bb8a94dc679949374f46d54a12b9bc367c54037f1497","target":"record","created_at":"2026-05-18T04:13:38Z","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":"4bdfb555cea609320200433316d4d3e56590f88137b72ffd62c29cbdcfbfb1dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-11T09:00:53Z","title_canon_sha256":"2f46c5fc28ee338806531a6e77985447ca9148b61222a43a095ff6e707bedce6"},"schema_version":"1.0","source":{"id":"1109.2296","kind":"arxiv","version":1}},"canonical_sha256":"4a2be7e8ecb73e3f2f45677e6d73270dce03f1c18b17a3be9f15299a35a1c652","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a2be7e8ecb73e3f2f45677e6d73270dce03f1c18b17a3be9f15299a35a1c652","first_computed_at":"2026-05-18T04:13:38.048465Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:38.048465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qMKMY11LmKhsjZuUkuw9Qt4OnloZm0fVkfOAAgnTkyC3iwF/OG5s0SBwPbACVPIGA1g/ER5uBd5wK+5nf9pcCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:38.049044Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2296","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:887c7be2f31b62cb9901bb8a94dc679949374f46d54a12b9bc367c54037f1497","sha256:6f22dc4ccdfa9a164ee95ff6fdb3089fe7a3f48337db06b22e77596314a9ebad"],"state_sha256":"380b7685baacd5a58b8766107d56137ae2f521b2624d4f8f5d3a645a855ba5fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RaIXQDjG+iqQtdrBAuZ4BJqPmVtqKprQNDiwpLISWE+EfnVO4H5ItBCy7bhEdh+j8Ob4XpATi1T8eV81IGZsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:34:46.012292Z","bundle_sha256":"10260b4701838af2b3f9fc73363dd4920ef8861fd3137e6e95ee9ed03824a508"}}