{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6YQMLSF6M23GJTVQHCGJ3HDPAC","short_pith_number":"pith:6YQMLSF6","canonical_record":{"source":{"id":"1806.02252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T15:39:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4a4b2242456c955e1796ac939fb30a7a0076d986a200722df56f7cd4643b266f","abstract_canon_sha256":"95e827c294fed2877faafe2ebdabb9eb439faab0cfe1d02f8da0c4fa90539485"},"schema_version":"1.0"},"canonical_sha256":"f620c5c8be66b664ceb0388c9d9c6f00acec68f8e5efe1279acc3378cd8384f7","source":{"kind":"arxiv","id":"1806.02252","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02252","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02252v1","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02252","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"pith_short_12","alias_value":"6YQMLSF6M23G","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6YQMLSF6M23GJTVQ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6YQMLSF6","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6YQMLSF6M23GJTVQHCGJ3HDPAC","target":"record","payload":{"canonical_record":{"source":{"id":"1806.02252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T15:39:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4a4b2242456c955e1796ac939fb30a7a0076d986a200722df56f7cd4643b266f","abstract_canon_sha256":"95e827c294fed2877faafe2ebdabb9eb439faab0cfe1d02f8da0c4fa90539485"},"schema_version":"1.0"},"canonical_sha256":"f620c5c8be66b664ceb0388c9d9c6f00acec68f8e5efe1279acc3378cd8384f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:02.118192Z","signature_b64":"YD0cC6gJ6+weA60ooUEl82AfmCF66Awe7NGuZYnfN4e8x9F6/TeQ8hkpF5tH3hWA0zoGspHgIhzX4pSSQ0KIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f620c5c8be66b664ceb0388c9d9c6f00acec68f8e5efe1279acc3378cd8384f7","last_reissued_at":"2026-05-18T00:14:02.117464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:02.117464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.02252","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:14:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0m7/TuBxoDNjGhIWVEkU7hh8op3WkfpGTCrlS5bVA8Agl1KMXtVfmciQsem/NStJh0mNeEPYIV9v8lxcma7LCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:06:12.491510Z"},"content_sha256":"fbf46e3b73ca6a1b868da70142dbac884a30582245a6e460f3311b1dcc0f9e26","schema_version":"1.0","event_id":"sha256:fbf46e3b73ca6a1b868da70142dbac884a30582245a6e460f3311b1dcc0f9e26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6YQMLSF6M23GJTVQHCGJ3HDPAC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Causal Bandits with Propagating Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Ken-ichi Kawarabayashi, Naonori Kakimura, Shinji Ito, Takuro Fukunaga","submitted_at":"2018-06-06T15:39:20Z","abstract_excerpt":"Bandit is a framework for designing sequential experiments. In each experiment, a learner selects an arm $A \\in \\mathcal{A}$ and obtains an observation corresponding to $A$. Theoretically, the tight regret lower-bound for the general bandit is polynomial with respect to the number of arms $|\\mathcal{A}|$. This makes bandit incapable of handling an exponentially large number of arms, hence the bandit problem with side-information is often considered to overcome this lower bound. Recently, a bandit framework over a causal graph was introduced, where the structure of the causal graph is available"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02252","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:14:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WXahWSqRKeX214huFgrzAye4J1g5q4RQXFqizuyvb9Blocn2QUcE5vh4oKUvQ6TcX5OvxtPbwu+vrXFaU6V0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:06:12.492146Z"},"content_sha256":"325b9b645144aa134dd88c41894a456dea235758d7b257bd57d9bd8e140fa6cd","schema_version":"1.0","event_id":"sha256:325b9b645144aa134dd88c41894a456dea235758d7b257bd57d9bd8e140fa6cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YQMLSF6M23GJTVQHCGJ3HDPAC/bundle.json","state_url":"https://pith.science/pith/6YQMLSF6M23GJTVQHCGJ3HDPAC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YQMLSF6M23GJTVQHCGJ3HDPAC/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-02T21:06:12Z","links":{"resolver":"https://pith.science/pith/6YQMLSF6M23GJTVQHCGJ3HDPAC","bundle":"https://pith.science/pith/6YQMLSF6M23GJTVQHCGJ3HDPAC/bundle.json","state":"https://pith.science/pith/6YQMLSF6M23GJTVQHCGJ3HDPAC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YQMLSF6M23GJTVQHCGJ3HDPAC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6YQMLSF6M23GJTVQHCGJ3HDPAC","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":"95e827c294fed2877faafe2ebdabb9eb439faab0cfe1d02f8da0c4fa90539485","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T15:39:20Z","title_canon_sha256":"4a4b2242456c955e1796ac939fb30a7a0076d986a200722df56f7cd4643b266f"},"schema_version":"1.0","source":{"id":"1806.02252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02252","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02252v1","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02252","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"pith_short_12","alias_value":"6YQMLSF6M23G","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6YQMLSF6M23GJTVQ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6YQMLSF6","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:325b9b645144aa134dd88c41894a456dea235758d7b257bd57d9bd8e140fa6cd","target":"graph","created_at":"2026-05-18T00:14:02Z","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":"Bandit is a framework for designing sequential experiments. In each experiment, a learner selects an arm $A \\in \\mathcal{A}$ and obtains an observation corresponding to $A$. Theoretically, the tight regret lower-bound for the general bandit is polynomial with respect to the number of arms $|\\mathcal{A}|$. This makes bandit incapable of handling an exponentially large number of arms, hence the bandit problem with side-information is often considered to overcome this lower bound. Recently, a bandit framework over a causal graph was introduced, where the structure of the causal graph is available","authors_text":"Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Ken-ichi Kawarabayashi, Naonori Kakimura, Shinji Ito, Takuro Fukunaga","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T15:39:20Z","title":"Causal Bandits with Propagating Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02252","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:fbf46e3b73ca6a1b868da70142dbac884a30582245a6e460f3311b1dcc0f9e26","target":"record","created_at":"2026-05-18T00:14:02Z","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":"95e827c294fed2877faafe2ebdabb9eb439faab0cfe1d02f8da0c4fa90539485","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T15:39:20Z","title_canon_sha256":"4a4b2242456c955e1796ac939fb30a7a0076d986a200722df56f7cd4643b266f"},"schema_version":"1.0","source":{"id":"1806.02252","kind":"arxiv","version":1}},"canonical_sha256":"f620c5c8be66b664ceb0388c9d9c6f00acec68f8e5efe1279acc3378cd8384f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f620c5c8be66b664ceb0388c9d9c6f00acec68f8e5efe1279acc3378cd8384f7","first_computed_at":"2026-05-18T00:14:02.117464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:02.117464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YD0cC6gJ6+weA60ooUEl82AfmCF66Awe7NGuZYnfN4e8x9F6/TeQ8hkpF5tH3hWA0zoGspHgIhzX4pSSQ0KIDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:02.118192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbf46e3b73ca6a1b868da70142dbac884a30582245a6e460f3311b1dcc0f9e26","sha256:325b9b645144aa134dd88c41894a456dea235758d7b257bd57d9bd8e140fa6cd"],"state_sha256":"da81dcb08d47cdcee6df3708ce6e592e87ef4de9994401568a41c1e093e7ba38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NmikROuALd9FuQ7PV26ncc3opBS3dmzF0US/xqF37Zj2chVMiHRO+PbNa1Rt/k7DZv3ft9L1nUtkQWIHLsO6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:06:12.495345Z","bundle_sha256":"427d72af1a3edf430e3e7da4893972ff8e895032790a74173c2692659773bfed"}}