{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZJ43M7LGABDJK4COXQ2ZECYZZB","short_pith_number":"pith:ZJ43M7LG","canonical_record":{"source":{"id":"1711.03198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T22:47:59Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"61d249082c7a70e4d57ca394479027cf8e1d0f3f4f4013e6c9a20a9d0c1b5476","abstract_canon_sha256":"114279a4d41771ee2b9af3dfec82bd6e2fa57b57c696074b4b4c65c7cd1bb6b5"},"schema_version":"1.0"},"canonical_sha256":"ca79b67d66004695704ebc35920b19c876c945cd5c1bd02d88d9f48503991913","source":{"kind":"arxiv","id":"1711.03198","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03198","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03198v1","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03198","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"pith_short_12","alias_value":"ZJ43M7LGABDJ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZJ43M7LGABDJK4CO","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZJ43M7LG","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZJ43M7LGABDJK4COXQ2ZECYZZB","target":"record","payload":{"canonical_record":{"source":{"id":"1711.03198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T22:47:59Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"61d249082c7a70e4d57ca394479027cf8e1d0f3f4f4013e6c9a20a9d0c1b5476","abstract_canon_sha256":"114279a4d41771ee2b9af3dfec82bd6e2fa57b57c696074b4b4c65c7cd1bb6b5"},"schema_version":"1.0"},"canonical_sha256":"ca79b67d66004695704ebc35920b19c876c945cd5c1bd02d88d9f48503991913","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:56.942350Z","signature_b64":"ybFm6Yr9IRmbTWrV4KkmCwqDa1kauZkKcu6GE09yw5EM+6DBRKTnsvlBNoxCknmLKo3r9HkCY/VbJIIMxrrNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca79b67d66004695704ebc35920b19c876c945cd5c1bd02d88d9f48503991913","last_reissued_at":"2026-05-18T00:30:56.941876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:56.941876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.03198","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-18T00:30:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YhzX5ucbdglsuze4DD9sILGpJ5QWcs8WkFZcI58hBHe8UC/1KIowhB01LVUatTIdu6L6ZKVqvZK3CrZxjM0iDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:08:05.223340Z"},"content_sha256":"b99f868751fff3e534fa8d17c7a997b58d51c63d6a7f99e5042687a33c0518ec","schema_version":"1.0","event_id":"sha256:b99f868751fff3e534fa8d17c7a997b58d51c63d6a7f99e5042687a33c0518ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZJ43M7LGABDJK4COXQ2ZECYZZB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Directed Sampling for Stochastic Bandits with Graph Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Fang Liu, Ness Shroff, Swapna Buccapatnam","submitted_at":"2017-11-08T22:47:59Z","abstract_excerpt":"We consider stochastic multi-armed bandit problems with graph feedback, where the decision maker is allowed to observe the neighboring actions of the chosen action. We allow the graph structure to vary with time and consider both deterministic and Erd\\H{o}s-R\\'enyi random graph models. For such a graph feedback model, we first present a novel analysis of Thompson sampling that leads to tighter performance bound than existing work. Next, we propose new Information Directed Sampling based policies that are graph-aware in their decision making. Under the deterministic graph case, we establish a B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03198","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-18T00:30:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y9EDxEVIxN8+xTzhIoN1gCpMaECkggJac90F/g2xjMkhs3fvMDdXi5eg+nOgnN3FpeY1P65Ht+eYONyRh5oWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:08:05.224044Z"},"content_sha256":"c3ce6ea67e161ced58e89ac1b4bd8ff24143c5b1ddd54279b2ee3ec55295ecfb","schema_version":"1.0","event_id":"sha256:c3ce6ea67e161ced58e89ac1b4bd8ff24143c5b1ddd54279b2ee3ec55295ecfb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZJ43M7LGABDJK4COXQ2ZECYZZB/bundle.json","state_url":"https://pith.science/pith/ZJ43M7LGABDJK4COXQ2ZECYZZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZJ43M7LGABDJK4COXQ2ZECYZZB/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-31T08:08:05Z","links":{"resolver":"https://pith.science/pith/ZJ43M7LGABDJK4COXQ2ZECYZZB","bundle":"https://pith.science/pith/ZJ43M7LGABDJK4COXQ2ZECYZZB/bundle.json","state":"https://pith.science/pith/ZJ43M7LGABDJK4COXQ2ZECYZZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZJ43M7LGABDJK4COXQ2ZECYZZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZJ43M7LGABDJK4COXQ2ZECYZZB","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":"114279a4d41771ee2b9af3dfec82bd6e2fa57b57c696074b4b4c65c7cd1bb6b5","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T22:47:59Z","title_canon_sha256":"61d249082c7a70e4d57ca394479027cf8e1d0f3f4f4013e6c9a20a9d0c1b5476"},"schema_version":"1.0","source":{"id":"1711.03198","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03198","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03198v1","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03198","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"pith_short_12","alias_value":"ZJ43M7LGABDJ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZJ43M7LGABDJK4CO","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZJ43M7LG","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:c3ce6ea67e161ced58e89ac1b4bd8ff24143c5b1ddd54279b2ee3ec55295ecfb","target":"graph","created_at":"2026-05-18T00:30:56Z","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 stochastic multi-armed bandit problems with graph feedback, where the decision maker is allowed to observe the neighboring actions of the chosen action. We allow the graph structure to vary with time and consider both deterministic and Erd\\H{o}s-R\\'enyi random graph models. For such a graph feedback model, we first present a novel analysis of Thompson sampling that leads to tighter performance bound than existing work. Next, we propose new Information Directed Sampling based policies that are graph-aware in their decision making. Under the deterministic graph case, we establish a B","authors_text":"Fang Liu, Ness Shroff, Swapna Buccapatnam","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T22:47:59Z","title":"Information Directed Sampling for Stochastic Bandits with Graph Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03198","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:b99f868751fff3e534fa8d17c7a997b58d51c63d6a7f99e5042687a33c0518ec","target":"record","created_at":"2026-05-18T00:30:56Z","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":"114279a4d41771ee2b9af3dfec82bd6e2fa57b57c696074b4b4c65c7cd1bb6b5","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T22:47:59Z","title_canon_sha256":"61d249082c7a70e4d57ca394479027cf8e1d0f3f4f4013e6c9a20a9d0c1b5476"},"schema_version":"1.0","source":{"id":"1711.03198","kind":"arxiv","version":1}},"canonical_sha256":"ca79b67d66004695704ebc35920b19c876c945cd5c1bd02d88d9f48503991913","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca79b67d66004695704ebc35920b19c876c945cd5c1bd02d88d9f48503991913","first_computed_at":"2026-05-18T00:30:56.941876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:56.941876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ybFm6Yr9IRmbTWrV4KkmCwqDa1kauZkKcu6GE09yw5EM+6DBRKTnsvlBNoxCknmLKo3r9HkCY/VbJIIMxrrNDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:56.942350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03198","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b99f868751fff3e534fa8d17c7a997b58d51c63d6a7f99e5042687a33c0518ec","sha256:c3ce6ea67e161ced58e89ac1b4bd8ff24143c5b1ddd54279b2ee3ec55295ecfb"],"state_sha256":"59549c3f001b055be664edfd55850d11341dee6d9dc9230fc6de65f1e50442fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wx5v3pbA4yOvuUva7ArlaRXjNjemEm4+brZ+bZZ5nQUbXN0AyuSF0ZLRa0fkntSF31BMWV++1qMyHSmwYmmtDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:08:05.227598Z","bundle_sha256":"f5c63e20789410ad65c7089510155e0c308461318c91c5b32ac34c7fee035d10"}}