{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JW3SNERCIUN74WKUEIF25JRXJ6","short_pith_number":"pith:JW3SNERC","canonical_record":{"source":{"id":"1805.08930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-23T01:47:56Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"ec6340f6cd2ba861f37cfc43f5be8730637a7797535aedcfb073b335d1e37f27","abstract_canon_sha256":"490bfda01a2288b2845e8d66594de663c649346758b67e587c36570c47940bf2"},"schema_version":"1.0"},"canonical_sha256":"4db7269222451bfe5954220baea6374f9740c6e126e827634a8bedb5bfba0853","source":{"kind":"arxiv","id":"1805.08930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08930","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08930v1","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08930","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"pith_short_12","alias_value":"JW3SNERCIUN7","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JW3SNERCIUN74WKU","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JW3SNERC","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JW3SNERCIUN74WKUEIF25JRXJ6","target":"record","payload":{"canonical_record":{"source":{"id":"1805.08930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-23T01:47:56Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"ec6340f6cd2ba861f37cfc43f5be8730637a7797535aedcfb073b335d1e37f27","abstract_canon_sha256":"490bfda01a2288b2845e8d66594de663c649346758b67e587c36570c47940bf2"},"schema_version":"1.0"},"canonical_sha256":"4db7269222451bfe5954220baea6374f9740c6e126e827634a8bedb5bfba0853","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:09.058799Z","signature_b64":"bTBWLN8VOWOittA41X14TUdbLto759xBou+LUlvhvLrkupY+FyVvmF2QxKdxLQkVxCYRmewPWrMi+r2IIEkkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4db7269222451bfe5954220baea6374f9740c6e126e827634a8bedb5bfba0853","last_reissued_at":"2026-05-18T00:15:09.058364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:09.058364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.08930","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:15:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lDum6hXwNUzgLt4dMEjVn+rrr1yf1gjZR8AMeZgRjepHUJ+hSh84gcZJFeHpwmWDs/8ZkgJCqr+o3LS5JT5sCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:08:11.167880Z"},"content_sha256":"3e725b1ad4f562a659180c78c1e6cd68435e54dea3a7acdc6c9891db3c6443c9","schema_version":"1.0","event_id":"sha256:3e725b1ad4f562a659180c78c1e6cd68435e54dea3a7acdc6c9891db3c6443c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JW3SNERCIUN74WKUEIF25JRXJ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of Thompson Sampling for Graphical Bandits Without the Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Fang Liu, Ness Shroff, Zizhan Zheng","submitted_at":"2018-05-23T01:47:56Z","abstract_excerpt":"We study multi-armed bandit problems with graph feedback, in which the decision maker is allowed to observe the neighboring actions of the chosen action, in a setting where the graph may vary over time and is never fully revealed to the decision maker. We show that when the feedback graphs are undirected, the original Thompson Sampling achieves the optimal (within logarithmic factors) regret $\\tilde{O}\\left(\\sqrt{\\beta_0(G)T}\\right)$ over time horizon $T$, where $\\beta_0(G)$ is the average independence number of the latent graphs. To the best of our knowledge, this is the first result showing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08930","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:15:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VgQUojIDQWSHgojADfyD3dF5HwSxTyIL83q8ex96jFBFMtk9ak/YtXrnNbnQjNJ2cqfhPHYBlmXNimnruSLDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:08:11.168587Z"},"content_sha256":"08f0f89aa5158088bcf68e1c4849f81fb52fc713b7f0bb4b586d8bdacd5d12ec","schema_version":"1.0","event_id":"sha256:08f0f89aa5158088bcf68e1c4849f81fb52fc713b7f0bb4b586d8bdacd5d12ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JW3SNERCIUN74WKUEIF25JRXJ6/bundle.json","state_url":"https://pith.science/pith/JW3SNERCIUN74WKUEIF25JRXJ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JW3SNERCIUN74WKUEIF25JRXJ6/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-25T21:08:11Z","links":{"resolver":"https://pith.science/pith/JW3SNERCIUN74WKUEIF25JRXJ6","bundle":"https://pith.science/pith/JW3SNERCIUN74WKUEIF25JRXJ6/bundle.json","state":"https://pith.science/pith/JW3SNERCIUN74WKUEIF25JRXJ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JW3SNERCIUN74WKUEIF25JRXJ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JW3SNERCIUN74WKUEIF25JRXJ6","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":"490bfda01a2288b2845e8d66594de663c649346758b67e587c36570c47940bf2","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-23T01:47:56Z","title_canon_sha256":"ec6340f6cd2ba861f37cfc43f5be8730637a7797535aedcfb073b335d1e37f27"},"schema_version":"1.0","source":{"id":"1805.08930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08930","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08930v1","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08930","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"pith_short_12","alias_value":"JW3SNERCIUN7","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JW3SNERCIUN74WKU","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JW3SNERC","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:08f0f89aa5158088bcf68e1c4849f81fb52fc713b7f0bb4b586d8bdacd5d12ec","target":"graph","created_at":"2026-05-18T00:15: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 study multi-armed bandit problems with graph feedback, in which the decision maker is allowed to observe the neighboring actions of the chosen action, in a setting where the graph may vary over time and is never fully revealed to the decision maker. We show that when the feedback graphs are undirected, the original Thompson Sampling achieves the optimal (within logarithmic factors) regret $\\tilde{O}\\left(\\sqrt{\\beta_0(G)T}\\right)$ over time horizon $T$, where $\\beta_0(G)$ is the average independence number of the latent graphs. To the best of our knowledge, this is the first result showing ","authors_text":"Fang Liu, Ness Shroff, Zizhan Zheng","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-23T01:47:56Z","title":"Analysis of Thompson Sampling for Graphical Bandits Without the Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08930","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:3e725b1ad4f562a659180c78c1e6cd68435e54dea3a7acdc6c9891db3c6443c9","target":"record","created_at":"2026-05-18T00:15: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":"490bfda01a2288b2845e8d66594de663c649346758b67e587c36570c47940bf2","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-23T01:47:56Z","title_canon_sha256":"ec6340f6cd2ba861f37cfc43f5be8730637a7797535aedcfb073b335d1e37f27"},"schema_version":"1.0","source":{"id":"1805.08930","kind":"arxiv","version":1}},"canonical_sha256":"4db7269222451bfe5954220baea6374f9740c6e126e827634a8bedb5bfba0853","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4db7269222451bfe5954220baea6374f9740c6e126e827634a8bedb5bfba0853","first_computed_at":"2026-05-18T00:15:09.058364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:09.058364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bTBWLN8VOWOittA41X14TUdbLto759xBou+LUlvhvLrkupY+FyVvmF2QxKdxLQkVxCYRmewPWrMi+r2IIEkkBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:09.058799Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e725b1ad4f562a659180c78c1e6cd68435e54dea3a7acdc6c9891db3c6443c9","sha256:08f0f89aa5158088bcf68e1c4849f81fb52fc713b7f0bb4b586d8bdacd5d12ec"],"state_sha256":"6e7a5c25e2a48dfc99a14a17d348144de3230307ab4f4fc80e18144b3ca56fbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YDOLDQYPbzYu1sXHFSFaE9931vHegb8e/+v7SFeaAGltDWPrHOAVXaQsJ3uYr3D0pmj1f2jSAREG/NlgKYTkAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:08:11.172176Z","bundle_sha256":"f26408c79277798eb262e0cc5ba5347dc5e982aad0751c5a251aee1ffcce369f"}}